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

Sep
20
answered Accelerating SHA-1
Sep
20
comment Accelerating SHA-1
@fgrieu: I'm hashing 128KiB at a time via SHA_Update (OpenSSL) in a tight read loop. I need a hash for the entire file, so I cannot run hash invocations in parallel (since SHA1 needs the previous chaining value to start computing the next).
Sep
20
comment Accelerating SHA-1
I have some latitude with the protocol... you're thinking to hash separately on multiple cores?
Sep
20
asked Accelerating SHA-1
Sep
19
accepted How to forge Schnorr signatures if you can guess the challenge
Sep
19
comment Converting a stream cipher into a block cipher
I'm asking out of general interest; to me it's interesting if one primitive can be efficiently converted to the other.
Sep
18
accepted What is Identity-Based Encryption (IBE) and why is it “better”?
Sep
18
answered How do I apply differential cryptanalysis to a block cipher?
Sep
18
asked Converting a stream cipher into a block cipher
Sep
18
asked How to forge Schnorr signatures if you can guess the challenge
Sep
16
answered Understanding CRC
Sep
16
asked What is Identity-Based Encryption (IBE) and why is it “better”?
Sep
16
accepted Can I select a large random prime using this procedure?
Sep
15
asked Can I select a large random prime using this procedure?
Sep
15
answered UMAC: to what extent is it in use today?
Sep
10
answered How do I construct a 256-bit hash function from 128-bit AES?
Sep
6
awarded  Teacher
Sep
4
comment Is modern encryption needlessly complicated?
Modern crypto is needlessly complicated; but not because of the (simple) primitives like RSA, DES, and AES. It's universality composability and ZKPs that are the problem.
Sep
4
answered Is modern encryption needlessly complicated?
Sep
2
comment What is the sign bit for in Feige-Fiat-Shamir?
In HAC, 10.26 step b (p. 410) the authors claim that the sign is required to avoid leaking information. I can only guess that this information is the fact that $I_j$ is a square, which seems to not really be very useful (after all, you can't take the square root!). A simulator could produce this same distribution, right? Just generate a random square.