30,981 reputation
557114
bio website bolet.org/~pornin
location Quebec City, Canada
age 39
visits member for 3 years
seen Jul 26 at 16:57

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


Jan
22
comment Can I use my random IV (for AES) as a salt for PBKDF2?
The problem with the IV in TLS 1.0 (demonstrated a few years ago "in the wild", i.e. as a Youtube video of a Javascript-based attack, under the name "BEAST") was not that the attacker knew the IV, but that the attacker knew the IV before choosing the data which gets encrypted (in a chosen-plaintext attack context). In TLS 1.1 a new IV is generated for each record, and it is in the record, so the attacker can see it all right, but only after having chosen the data, which disables the attack.
Jan
21
awarded  Revival
Jan
20
answered How can I implement the elliptic curve MOV attack myself?
Jan
18
answered What was the problem in the SSL version 2.0?
Jan
17
answered Implementation of modular arithmetic?
Jan
16
comment Password hashing in /etc/shadow
It is in the original article, and is not explained. They might have described the source orally, during the presentation (I was not there).
Jan
16
answered Password hashing in /etc/shadow
Jan
15
awarded  Nice Answer
Jan
14
answered Is there a feasible method by which NIST ECC curves over prime fields could be intentionally rigged?
Jan
4
answered Can a salt for a password hash be public?
Jan
3
answered Can you explain Bleichenbacher's CCA attack on PKCS#1 v1.5?
Jan
2
reviewed Approve suggested edit on congruence tag wiki excerpt
Dec
29
awarded  Enlightened
Dec
29
awarded  Nice Answer
Dec
27
revised Why is public-key encryption so much less efficient than secret-key encryption?
edited body
Dec
26
answered EC ElGamal versus static+ephemeral ECDH
Dec
26
reviewed Approve suggested edit on accumulators tag wiki excerpt
Dec
26
reviewed Approve suggested edit on accumulators tag wiki
Dec
24
awarded  Good Answer
Dec
23
comment Solve a Modular Exponentiation
This solving method would take an awful lot of time, because the size of $k$ is several thousands of bits (the correct value of $k$ exists, but finding it that way would take billions of times the age of the Universe).