Reputation
15,014
Next tag badge:
320/400 score
61/80 answers
Badges
1 21 67
Newest
 Enlightened
Impact
~331k people reached

May
9
reviewed Approve How to break AES/CBC/PKCS5 when key and IV are reused?
May
9
revised Optimal bandwidth cost for Oblivious RAM
better title
May
9
answered How do institutions like banks do RSA with big primes?
May
9
revised Definition of the term “key”
added 76 characters in body
May
9
revised Definition of the term “key”
added 76 characters in body
May
9
revised Definition of the term “key”
added 76 characters in body
May
9
answered Definition of the term “key”
May
9
reviewed Edit How to create a PEM file for storing an RSA key?
May
9
revised How to create a PEM file for storing an RSA key?
added 8 characters in body; edited tags; edited title
May
9
comment How to create a PEM file for storing an RSA key?
@poncho: Technically, this question is about implementing a standard storage format for cryptographic keys. The mention of OpenSSL is really a red herring. I think it's on topic here, if perhaps marginally. (And there's certainly some overlap with Stack Overflow here; not that there's necessarily anything wrong with that.)
May
9
reviewed Close If someone had a list of all primes, would it be possible for them to factor any integer in polynomial time?
May
9
reviewed Close Understanding Diffie-Hellman Key Exchange
May
9
comment Definition of the term “key”
Note that a key (in the sense of "thing used to open a lock") is also a key (in the sense of "essential to make something work"). Without a matching key, a lock is little more than a useless lump of metal.
May
9
revised Definition of the term “key”
edited tags; edited tags
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