21,465 reputation
12990
bio website
location Paris, France
age
visits member for 3 years, 3 months
seen 7 hours ago

I'm an engineer with experience in applied cryptography, in particular in Smart Card systems.


Nov
14
revised How to perform frequency analysis of a substitution cipher using a Base64 alphabet
There are more guesses possible for R?NF?R
Nov
14
revised How to perform frequency analysis of a substitution cipher using a Base64 alphabet
Remove pedantic and wrong use of surjective
Nov
14
revised How to perform frequency analysis of a substitution cipher using a Base64 alphabet
added 5 characters in body
Nov
14
answered How to perform frequency analysis of a substitution cipher using a Base64 alphabet
Nov
14
revised Small Prime Difference in RSA
Explain against which variant of trial division we compare Fermat
Nov
14
comment How can CBC-MAC be secure when message length is fixed?
The title of the question looks wrong to me; nearest logical substitute: How can CBC-MAC be secure only when message length is fixed?
Nov
14
revised What is the most computationally efficient way of generating pseudo-random permutations?
fastperm3, with revised number of rounds for small N; more precise (and easier) challenge
Nov
13
revised Strange MAC algorithm
Discuss what if we used something more secure than MD5
Nov
13
revised Strange MAC algorithm
Polish
Nov
13
revised What is the most computationally efficient way of generating pseudo-random permutations?
Add missing )
Nov
13
revised What is the most computationally efficient way of generating pseudo-random permutations?
Expand the attack on the 4-rounds construct in the question. Polish.
Nov
13
revised What is the most computationally efficient way of generating pseudo-random permutations?
Expand the attack on the 4-rounds construct in the question. Polish.
Nov
13
revised Strange MAC algorithm
Clearer intro
Nov
13
answered Strange MAC algorithm
Nov
13
comment Strange MAC algorithm
Somewhat related to this question. $\;$ Independently: knowing MD5(k||m) allows computing MD5(k||m||m'||m") for m' a certain known function of m and the length of k (with m' at least 9 bytes or 65 bits), and freely chosen m".
Nov
13
comment AES with weak keys
Yes. An easy statistical calculation shows that if for $j$ increasing from $0$ to $13$ we try the $128!/(128-j)!/j!$ keys with $j$ zero bits and $128-j$ one bits (using encryption of some known plaintext), we'll find a key with odds about $59.6\%$, and less than $2^{57.8}$ AES encryptions. With $j$ up to $8$, our chances to find a key are still a fair $9.7\%$, with effort less than $2^{40.5}$ encryptions. With $j$ up to $5$, $0.93\%$, with effort less than $2^{28.1}$.
Nov
13
revised What is the most computationally efficient way of generating pseudo-random permutations?
describe fastperm2
Nov
12
revised Permutation parity after cycle-walking
The probability asked is now decreasing smoothly when m decreases or n increases; avoid odds, use probability
Nov
12
revised What is the most computationally efficient way of generating pseudo-random permutations?
Fix statement on parity; polish
Nov
12
comment Permutation parity after cycle-walking
@poncho: You are absolutely right! I misinterpreted the argument given in that answer into the (incorrect): any reversible transformation leaving at least 1 bit of the state unchanged is even. What's correct is: any transformation leaving at least 1 bit of the state unchanged and without influence on the other bits is even.