33,549 reputation
569131
bio website bolet.org/~pornin
location Quebec City, Canada
age 39
visits member for 3 years, 6 months
seen Jan 22 at 14:25

Cryptographer, programmer in several languages (C, Java, several assemblies, Pascal, Forth...). I also have a life.


Jan
15
awarded  Good Answer
Jan
6
awarded  Enlightened
Jan
6
awarded  Nice Answer
Dec
31
awarded  Enlightened
Dec
31
awarded  Nice Answer
Dec
6
comment When to use RSA and when ElGamal asymmetric encryption
Considering that RSA, the algorithm, was published and fully described in 1978, several years before RSA, the company, was actually founded (in 1982), your assertion is dubious. It would imply that not only NSA paid the company to modify the algorithm, but also gave them access to some time travel technology so that they may get back to 1978 to enact the said modification. (I guess I am in denial of the NSA time travelling powers. Shame on me.)
Dec
2
awarded  Nice Answer
Nov
29
awarded  Enlightened
Nov
29
awarded  Nice Answer
Nov
28
answered Is there an alternative AES schedule?
Nov
26
comment What is the post-quantum cryptography alternative to Diffie-Hellman?
I am not saying that a "quantum-threatened" asymmetric encryption algorithm can be used safely for key agreement even in the presence of an attacker with a quantum computer. What I am saying is that any asymmetric encryption algorithm can be used for key agreement; so any quantum-safe asymmetric encryption algorithm is also a quantum-safe key agreement algorithm.
Nov
23
comment Three-way hash collision
When $n$ is large, $n^3/6$ and $n(n-1)(n-2)/6$ are almost the same thing. When talking about approximations (as is the case here), this kind of shortening is valid.
Nov
22
answered Addition / Multiplication modulo 13
Nov
14
answered How many of primitive point on the elliptic curve?
Nov
14
awarded  Enlightened
Nov
14
awarded  Nice Answer
Nov
13
awarded  Enlightened
Nov
13
awarded  Nice Answer
Nov
6
answered Zero Knowledge Example using discrete log
Nov
5
awarded  Enlightened