Reputation
14,601
Next tag badge:
62/100 score
18/20 answers
Badges
1 17 64
Newest
 Necromancer
Impact
~306k people reached

Feb
20
revised Increased security weaknesses when truncating SHA1
edited tags
Feb
20
revised Why can't hashes be reversed with toffoli gates?
edited tags
Feb
18
revised ElGamal in private set intersection: how to handle negative numbers?
(x-1)(x-2) = x^2-3x+2
Feb
18
reviewed Close Private Set Intersection Polynomial Computation
Feb
18
reviewed Leave Open Block Cipher vs Stream Cipher in Web Application
Feb
14
awarded  Nice Answer
Feb
13
comment Can someone explain the ECB Penguin?
@JoshBond: The "pattern" arises because pixels and cipher blocks don't line up exactly: an uncompressed true-color pixel takes up three bytes, while most common block ciphers encrypt blocks of either 8 or 16 bytes (64 or 128 bits).
Feb
13
answered Can someone explain the ECB Penguin?
Feb
11
awarded  Nice Question
Jan
30
reviewed Close PKC McEliece + $S$ + $P$
Jan
30
reviewed Leave Open Is the Couvreur et al. polynomial time attack on McEliece practical?
Jan
30
comment Is the Couvreur et al. polynomial time attack on McEliece practical?
Hi, fractal, and welcome to Cryptography Stack Exchange! I've edited your question to add some detail and make it a better fit to our site. Please don't hesitate to correct any mistakes or omissions I may have introduced while doing so.
Jan
30
revised Is the Couvreur et al. polynomial time attack on McEliece practical?
copyedit
Jan
30
reviewed Leave Open Efficient Robust Private Set Intersection Questions
Jan
30
answered Efficient Robust Private Set Intersection Questions
Jan
30
reviewed Leave Open Efficiently computing the neutral element in a ring isomorphic to Z/NZ?
Jan
30
awarded  Custodian
Jan
30
reviewed Close ElGamal Homomorphic Encryption Formula Question
Jan
29
comment Avoiding overflow when encrypting with RSA
Also, just to clarify your last sentence above, the "flaws" for small $e$ (like Coppersmith's attack) only appear if one does not use a secure padding scheme (e.g. OAEP). With proper padding, RSA is secure even for $e=3$; without proper padding, it may not be secure for any $e$.
Jan
29
comment Efficient Robust Private Set Intersection Additive ElGamal
I just approved this edit suggestion from an anonymous user. (It still needs someone else to approve it.) I assume that was you? You might want to register an account here, so that you'll be able to edit your posts more easily.