Reputation
33,833
Next tag badge:
95/100 score
20/20 answers
Badges
2 50 137
Impact
~560k people reached

Jan
27
revised Are there reasonably secure online voting implementations e.g. for student council elections?
Fix a few typos
Jan
27
comment Are there reasonably secure online voting implementations e.g. for student council elections?
@cygnusv: short answer, no. The website accmv.org is entirely in French, dated, and mostly empty; even the address is wrong. My apologies but our activity has been legal (fighting and loosing a battle in the constitutional court) and direct lobying of the authorities in charge (with some sucess, perhaps thanks to the former).
Jan
27
revised Are there reasonably secure online voting implementations e.g. for student council elections?
added 471 characters in body
Jan
27
answered Are there reasonably secure online voting implementations e.g. for student council elections?
Jan
26
comment Finding a secret cipher given the key and known plaintext?
Hint: assume $\operatorname{Enc}_k(x)$ is defined as $\operatorname{AES-128}_{k\oplus c}(x)$ for some unknown 128-bit constant $c$.
Jan
26
comment Is there any more information on this RSA backdoor?
In the context of the question, $P=A(P^\prime+i)+P^\prime$ for $A$ an unknown 384-bit prime, $P^\prime$ an unknown 128-bit prime, and $i$ small (likely $0\le i<500$). I doubt that makes $P$ weak in the sense of the paper.
Jan
26
comment Is there any more information on this RSA backdoor?
Can you expand on how "we can easily factor this number with lattice based attack (even if we dont know $A$)" ? That is exactly what the question is about, and I find that non-trivial.
Jan
24
comment Is there any more information on this RSA backdoor?
For one not knowing $A$, how would the key space be reduced to 256 bits? I count closer to 384+128+128 (minus comparatively little to account for the fact $A$, $P$, and $P'$ are prime).
Jan
24
revised Role of Fermat's little theorem in the proof of correctness of ElGamal signature
Beautify the formulas
Jan
24
comment Role of Fermat's little theorem in the proof of correctness of ElGamal signature
Hint: apply the definition of $H(m)\equiv xr+sk\pmod{p-1}$ so that you remove the modulo. You should then see how establishing $g^{H(m)}\equiv g^{xr}g^{ks}\pmod p$ involves Fermat's little theorem.
Jan
22
revised Status of Algebraic Eraser key exchange?
Polish argument on timing
Jan
22
awarded  Nice Answer
Jan
22
revised Status of Algebraic Eraser key exchange?
trim
Jan
21
revised Status of Algebraic Eraser key exchange?
edited body
Jan
21
awarded  Popular Question
Jan
20
revised Status of Algebraic Eraser key exchange?
polish
Jan
20
revised Status of Algebraic Eraser key exchange?
Do not mention N=10 in the final argument summary,
Jan
20
revised Status of Algebraic Eraser key exchange?
Quote the proposed standard's definition of public key, and other polish
Jan
20
revised Status of Algebraic Eraser key exchange?
polish
Jan
20
revised Status of Algebraic Eraser key exchange?
Add first bullet in the update