2,049 reputation
2829
bio website stackexchange.com/users/…
location
age
visits member for 2 years, 11 months
seen 28 mins ago

Moderator♦ pro tempore on French Language, Computer Science and Software Recommendations. I'm also a unix amateur, and a developer with a computer science background and security leanings by trade.

Interested in embedded systems? Join the Embedded Programming and Design proposal!

Programmeurs francophones : participez à Stack Overflow en français.

Avatar picture slightly adapted from a photo by Luridiformis (Zonda Grattus).


Feb
15
reviewed Leave Open ML/NN Cryptanalysis
Feb
15
reviewed Close Example of second preimage attack
Feb
15
reviewed Leave Open Encrypting firmware with AES and no IV
Feb
12
reviewed Reopen Complexity class of an idealised version of Bitcoin's proof-of-work (hashcash)?
Feb
12
reviewed Reviewed Certificate signature with SHA-1 and RSA: where do 1888 bits come from?
Feb
12
comment Certificate signature with SHA-1 and RSA: where do 1888 bits come from?
I don't understand the question (this may be a language problem). What do you mean by “a combination of 2048 bits”? Why are you subtracting 160 from 2048, or where does 1888 come from?
Feb
12
revised Certificate signature with SHA-1 and RSA: where do 1888 bits come from?
English
Feb
11
reviewed Edit Hash function that is efficient on GPU and poorly suited to ASIC
Feb
11
revised Hash function that is efficient on GPU and poorly suited to ASIC
added information from comments
Feb
11
awarded  Fanatic
Feb
7
reviewed Leave Closed Why does a one-time-pad key have to be at least as long as a message?
Feb
5
reviewed Leave Open Reverse engineering a hash?
Feb
5
reviewed Reopen Homomorphic Encryption Notation Question
Feb
3
answered Public-Key Deterministic Encryption : Why does not provide perfect security?
Feb
3
reviewed Leave Open Is 80 bits of key size considered safe against brute force attacks?
Feb
3
comment Avoiding overflow when encrypting with RSA
@Gretty $\mathbb{Z}/n\mathbb{Z}$ is arithmetic modulo $n$. It's the basic math in which RSA works. A machine word is the basic unit that computers perform operations on, typically 32-bit or 64-bit numbers; operations on crypto-size numbers have to be decomposed in terms of these operations in order to perform them on a computer.
Jan
31
reviewed Reviewed Computationaly hard detokenization algorithm for credit card numbers
Jan
31
revised Computationaly hard detokenization algorithm for credit card numbers
formatting; resolved contradiction in requirement 1
Jan
30
reviewed Close Why is there a strong distinction between stream and block ciphers?
Jan
30
reviewed Leave Open ElGamal Homomorphic Encryption Formula Question