Reputation
18,516
Top tag
Next privilege 20,000 Rep.
Access 'trusted user' tools
Badges
1 28 75
Impact
~445k people reached

May
9
reviewed Close Diffie Hellman Exponentiation Implementation Problem
May
9
comment Diffie Hellman Exponentiation Implementation Problem
Yeah, it's a dupe, but the original could really use a better answer. Of the three answers so far, one is buggy, one is (mostly) irrelevant and one takes way too long to get to the point.
May
8
comment Discrete logarithm over prime modulo: small input, large exponent, larger prime
Terminology nitpick: HMAC is a specific MAC algorithm (or, rather, a method of constructing a MAC from a cryptographic hash), of which this method is not an instance of. It's not really meaningful to ask whether something is "an HMAC", since only HMAC is an HMAC. You could ask whether this algorithm is a MAC (i.e. whether it satisfies the relevant unforgeability properties), though.
May
8
revised Missing public exponent
fix broken link
May
7
revised Is encryption time greater than decryption time?
fix typo, use http: for internal links so that they're detected as internal
May
7
revised Information-theoretic bound on leakage by timing measurement
added 53 characters in body
May
7
comment Information-theoretic bound on leakage by timing measurement
For a worst-case scenario, I guess you could just assume that the attacker can leak data at the full Shannon capacity of the channel, even if you don't have an explicit coding scheme approaching that capacity at hand. (Actually calculating the capacity from the noise distribution and the available timing range is beyond what I can do off the top of my head, though, even if I'm confident that, in principle, it should be doable.)
May
6
answered Information-theoretic bound on leakage by timing measurement
May
6
revised Is encryption time greater than decryption time?
added 45 characters in body
May
6
revised Is encryption time greater than decryption time?
add links and note about RSA performance
May
6
answered Is encryption time greater than decryption time?
May
5
comment Encrypt file name
If it's OK for the encrypted file names to (always) be longer than the originals, it would probably be easiest and safest to just encode the encrypted names in Base36 or Base32. If you wish to support any filenames that the underlying filesystem allows, things get trickier. (For filesystems like NTFS that are case-preserving but not case-sensitive, it might not even be possible.)
May
5
revised How to calculate if probability is negligible or not
added 602 characters in body
May
5
revised How to calculate if probability is negligible or not
edited tags
May
5
comment How to calculate if probability is negligible or not
@henry: See this post on meta.math.SE, and the linked posts in the sidebar, for some information about that message. However, I'm actually retracting my close vote, since, on a closer look, your question does contain a key term ("negligible probability") that is used in a somewhat specialized manner in crypto. (I've also posted an answer below that hopefully clarifies the meaning somewhat.)
May
5
answered How to calculate if probability is negligible or not
May
5
revised What does ⊕ mean in cryptography?
edited tags
Apr
30
comment What does ⊕ mean in cryptography?
BTW, questions like this are probably better suited for Cryptography Stack Exchange than for Stack Overflow. I've flagged this one for moderator attention, and asked them to migrate it there.
Apr
30
reviewed Reviewed Discrete logarithm over prime modulo: small input, large exponent, larger prime
Apr
30
comment What do $0^n$ and $1^n$ mean in cryptography?
Related (but, despite what I first assumed, probably not really duplicate) question: What does the expression $1^n$ mean as a function argument?