Alice wants to use the ECDSA signature algorithm.
For this, she chooses to use the elliptic curve equation E where y2 = x3 – x, defined on the finite field with q elements, Fq, with q = 134747661567386867366256408824228742802669457 .
She chose P as a base point of order N = 2902021510595963727029 with:
P = (18185174461194872234733581786593019886770620, 74952280828346465277451545812645059041440154)
Then, she chooses as secret signature key a random integer d with 1<d<N.
The public key is the point Q=d⊗P where ⊗ is the scalar multiplication on the elliptic curve E.
The value of Q is:
Le fichier pcap suivant contient une capture réseau d’un scan nmap, retrouvez les services qui ont été trouvés sur la machine cible. La clef de validation seraservice1:service2:service3:... en mettant les services par ordre de ports croissants.
Good challenges overall, but the staff lacked organization.
Although with a single administrator to manage everything, it shouldn’t be easy either!
Moreover we would have preferred a page announcing the challenges updates (and especially their modifications) rather than be surprised when someone from the team found out.
In terms of ranking, the first days we managed to keep a place in the Top 10 without too much difficulty.
After a week and 18/20 solved challenges, we were ranked first.
The days that followed, our position has decreased to finally be ranked 5th out of 106, with 19/22 solved challenges.
This is not so bad after all, especially since it was the first CTF for most of us!
It’s clear that our team unfortunately does not have enough skill in reverse/exploit 🙂
(For the next CTF we will revise these themes, because yes -to general demand- we will do it again!)
Anyway, we’re just finishing the writeups to share them.