25,983 reputation
11847
bio website
location
age
visits member for 2 years, 8 months
seen 7 hours ago

Sep
5
reviewed Approve suggested edit on backdoors tag wiki
Sep
5
reviewed Approve suggested edit on backdoors tag wiki excerpt
Sep
5
comment Can GCM be used in incremental mode?
@Shark: again, the issue is giving the authentication tag for two different encrypted messages (it doesn't matter if one is a prepend of the other); the fact that this is easy to compute isn't relevant.
Sep
4
revised Can GCM be used in incremental mode?
Minor text updates
Sep
4
answered Can GCM be used in incremental mode?
Sep
3
reviewed Approve suggested edit on Why the symmetric key layer in PGP?
Sep
3
comment Why the symmetric key layer in PGP?
Minor nit: asymmetric encryption algorithms are nondetermanistic (even RSA, which uses random padding), and hence encrypting the same message twice yields distinct messages. This doesn't change your main point.
Sep
2
revised Key Refresh in Diffie-Hellman
English correction: "oversee" == "be in charge of"; "overlook" == "fail to be aware of"
Sep
2
answered Key Refresh in Diffie-Hellman
Aug
31
reviewed Approve suggested edit on Feedback requested on a method of posting a message without revealing the author
Aug
30
comment Why is the complexity of RSA-1024 80 bit and not 86 bit?
@user129789: I'm sorry, but what's confusing about that statement? About a "2048" bit key with a 1024 bit modulus? I thought I made it clear that idea was silly...
Aug
30
reviewed Approve suggested edit on ed25519 tag wiki excerpt
Aug
30
reviewed Approve suggested edit on order-preserving tag wiki excerpt
Aug
30
reviewed Approve suggested edit on ed25519 tag wiki
Aug
30
reviewed Approve suggested edit on order-preserving tag wiki
Aug
30
reviewed Approve suggested edit on Why is the complexity of RSA-1024 80 bit and not 86 bit?
Aug
30
comment Why is the complexity of RSA-1024 80 bit and not 86 bit?
Actually, it's not that ambiguous; when we talk about the RSA key size, we always mean 'modulus size'. Imagine someone claiming to have a '2048 bit RSA key' that's made up of a 1024 bit modulus and a 1024 bit public exponent; people would (rightly) conclude that such an individual is completely clueless...
Aug
30
comment Why is the complexity of RSA-1024 80 bit and not 86 bit?
Actually, I believe it's included because no one knows what its form actually is; the exact value depends on the behavior of certain prime distributions, and no one knows exactly what that is. If it was known to be insignificant, we'd just omit it.
Aug
30
comment Why is the complexity of RSA-1024 80 bit and not 86 bit?
"in practice, we may generally assume it to be negligible"; actually, I do not believe that we know that, for the modulus sizes we are interested in practice, whether that $o(1)$ term is actually negligible. We do know that it tends toward 0 as $n \rightarrow \infty$, however that tells us nothing about the values of $n$ we are interested in.
Aug
30
revised Meet-in-the-middle with checking complexity
edited tags