31,043 reputation
12463
bio website
location
age
visits member for 3 years, 2 months
seen 51 mins ago

Mar
10
reviewed Reject suggested edit on Breaking Double Encryption
Mar
10
reviewed Approve suggested edit on Understanding multiplication in the AES specification
Mar
9
comment How secure is this use of Ziv-Lempel encoding?
Actually, I believe that the patent does try to set up the Ziv-Lempel compressor in a key-dependent state (I believe by feeding it key-depending text before starting the real compression), and so it isn't quite so simple; still, it doesn't look at all difficult.
Mar
9
comment Is $H(x) = x^2 \bmod p$ pre-image resistant, second pre-image resistant and/or collision resistant
@Azeem: If $p=65537$, then $H(7) = H(65530)$
Mar
9
revised Is $H(x) = x^2 \bmod p$ pre-image resistant, second pre-image resistant and/or collision resistant
added 96 characters in body
Mar
9
answered Is $H(x) = x^2 \bmod p$ pre-image resistant, second pre-image resistant and/or collision resistant
Mar
8
answered Attack of an RSA signature scheme using PKCS#1 v1.5 encryption padding
Mar
7
answered SHA-256 Partial Collision of initial 36 bits and more
Mar
7
comment Adding “salt” to “doHash” function in Java
Is this homework? If it is, you might want to recheck the requirements; true "pre-image resistance" (in the cryptographical sense) is actually fairly difficult (and unless you copy a primitive designed by someone else, it is seriously more advanced than where you are right now). And, no, salt does not particularly help with preimage resistance.
Mar
7
answered Is this a pseudo random function (PRF)? F(k,x) = f(k,x) - f(k,x-1)
Mar
7
reviewed Approve suggested edit on What is the difference between PKCS#5 padding and PKCS#7 padding
Mar
5
revised SHA-256 Wrong registers
added 27 characters in body
Mar
5
answered SHA-256 Wrong registers
Mar
5
comment What key exchange protocols give Forward-Secrecy resisting future progress?
@user54609: no, it doesn't, or rather, it doesn't in the specific scenario that fgrieu is talking about: what if someone later obtains the ability to solve the asymmetric problem (which is, in this case, the DH problem). This question came up during a discussion of "what happens if the adversary gets a Quantum computer; can they go back and decrypt old transcripts of encrypted traffic"
Mar
5
comment Long-term data protection, storage of old encrypted traffic and quantum cryptocalipse
One minor nit: the standard implementation of forward secrecy within protocols (DHE in TLS, PFS in IPSec) doesn't help against a future adversary with a working quantuum computer. Where protocols achieve forward secrecy by performing a DH exchange (using fresh random secrets); this gives us PFS against someone who learns the long term keys... as long as the DH problem is hard. With a Quantum Computer, the cDH problem is easy, hence we're not actually secure against such a future potential adversary.
Mar
5
revised Fast modular reduction
Made it a bit more explicit
Mar
5
answered Fast modular reduction
Mar
4
comment Is Dropbox's hashing method cryptographically secure?
Two hints (if you want any more, submit a question): you can create a $2^{33}$-way collision with the effort of finding 33 MD5 collisions, and you can use the linearity properties of CRC so you don't have to evaluate the CRC's of all $2^{33}$ messages.
Mar
4
comment Is Dropbox's hashing method cryptographically secure?
Actually, you can find a collision for $CRC32(M)||MD5(M)$ with effort of only 33 times an $MD5$ collision, or about $2^{23}$ compression function evaluations.
Mar
3
comment What RC4 key value will completely invert $S$ after initial permutation?
In case you're wondering why no one is stepping up to give you the answer, well, the whole point of homework is for you to learn. If someone would just give you the answer, well, that might mean that you can hand in your homework, but you won't learn from it.