1,273 reputation
721
bio website
location
age
visits member for 3 years, 3 months
seen Oct 9 at 20:45

Oct
9
awarded  Nice Question
Sep
30
accepted Converting a stream cipher into a block cipher
Sep
30
asked What is the “Random Oracle Model” and why is it controversial?
Sep
29
asked How did the Koblitz/Menezes papers affect the cryptography community?
Sep
28
comment For Diffie-Hellman, must g be a generator?
@Thomas: Improved attacks could also kill DH (or require parameter adjustments). I guess I'm trying to advocate that authors of cryptographic content stop saying (for example) "factoring large integers is impossible" and instead say "there is no publicly-known efficient factoring algorithm on conventional computers". Although I suppose it can get tiresome after a while. Nonetheless, I'm very careful to say the latter when teaching.
Sep
28
comment For Diffie-Hellman, must g be a generator?
Implied in all of the above is "according to current cryptanalysis". The parameters above are a function of (1) our current computing model and (2) our current state of knowledge.
Sep
27
answered Is Diffie-Hellman mathematically the same as RSA?
Sep
27
comment Is modern encryption needlessly complicated?
@Ivo: DES was regarded as "broken" upon release (due to key length); 3DES is still secure (but painfully slow); if you know an attack, please post it. 3DES has an effective key length of at least 110 bits. When I said that DES has never been broken, I mean the construction, not the parameter set.
Sep
27
awarded  Self-Learner
Sep
27
comment In RSA, do I calculate d from e or e from d?
In general, I would trust this site for crypto more than wikipedia since things are vetted here pretty much immediately after they're written.
Sep
27
comment How to fairly select a random number for a game without trusting a third party?
Another fix is to require the number of random bits be higher than (say) 256, and disallow repeated digests. Or better, to force the 2nd publisher of a repeated digest to reveal first (better because it allows you conclusively identify cheaters).
Sep
22
comment Accelerating SHA-1
@fgrieu: Is there a way to see if I'm having cache misses and how much they're costing me?
Sep
22
comment Accelerating SHA-1
@Thomas: reducing my buffer results in no difference in runtime; I'm not sure why you think L1 cache matters here since we process data exactly once (I'm running SHA1 over an 8GiB file).
Sep
22
accepted Accelerating SHA-1
Sep
22
comment Accelerating SHA-1
@jug: I've never heard this before (that Intel is quite a bit faster on a single core)... can you point me at a reference for this? I'd like to see if switching hardware would help.
Sep
21
comment Accelerating SHA-1
@jug: I did find that link, which is what led me to updating to the latest OpenSSL. Unfortunately, it was no faster.
Sep
21
comment Accelerating SHA-1
@Samuel: I'm processing a single incoming stream arriving at 5Gbps from the network and I'm currently bottlenecked by SHA-1 at 2.6Gbps; you're right that SIMD is useful: the XMM and YMM registers are part of the SSE(1-4) instructions which are already used in the OpenSSL code.
Sep
21
revised Accelerating SHA-1
added 245 characters in body
Sep
20
revised Accelerating SHA-1
added 4 characters in body
Sep
20
comment Accelerating SHA-1
Thomas: the authors of the paper I cite in my answer claim that a GPU does help. But they talk about "SSL flows" so perhaps they are inducing parallelism this way?!