Reputation
14,398
Next tag badge:
104/100 score
19/20 answers
Badges
3 38 77
Newest
 Enlightened
Impact
~368k people reached

Dec
7
comment Random oracle model proofs and programmability
Have a look at this blog series What is the Random Oracle Model and why should you care? - it explains in some more detail how a random oracle can be used in security proofs for cryptographic algorithms. (I'm thinking of adding a bit about the programmability as an answer, but it might need some time.)
Dec
6
comment Are there two-way encryption algorithms that include a work factor?
Take care to take the hash part of the output, not the part which contains the salt and work factor, though :-)
Dec
4
revised Is HMAC-DRBG or Hash-DRBG stronger?
mention pseudorandomness
Dec
4
revised Is HMAC-DRBG or Hash-DRBG stronger?
typo
Dec
4
answered Is HMAC-DRBG or Hash-DRBG stronger?
Dec
4
revised Is HMAC-DRBG or Hash-DRBG stronger?
tags, rewording/reordering, referring the right sections
Dec
4
revised Is a using salt important when creating a hash data validator?
tag
Dec
4
revised What is the appropriate public key encryption for secure coin flipping?
add encryption tag
Dec
4
revised What is the property of RSA where N=e?
add tag
Dec
3
comment Generalizing the conversion of Diffie-Hellman to El Gamal
I suppose this depends on what you understand with "two-round key-exchange protocol". Diffie-Hellman is actually only one round, since the message from Alice to Bob and the one from Bob to Alice are completely independent from each other. We need a KE protocol which is secure against repetitions of the first message (as this is Alice's public key).
Dec
2
revised Why is MixColumns omitted from the last round of AES?
why is this combination efficiently implemented together?
Dec
2
revised A mathematical explanation of the DES encryption system
formatting, adding some links
Dec
2
comment How much would it cost in U.S. dollars to brute force a 256 bit key in a year?
Factoring 256-bit numbers is not really a big problem nowadays, and is much faster than brute-forcing a similar-size key. The RSA key sizes where factoring needs a quantum computer are much larger. (Welcome to Cryptography Stack Exchange, by the way.)
Dec
2
comment How do we find the last two correspondences in an otherwise known even permutation?
@jug: a \over b results in $a \over b$. You can get a binomial coefficient by \binom{a}{b} = $\binom{a}{b}$. (I was so free to edit your comment.)
Nov
30
comment How to generate a list of unique random strings?
Welcome to Cryptography Stack Exchange. Sorry, your question is not clear. Do you want to know how to use the output of a random number generator to generate such a list? (Then this would be off-topic here, and might be better on Stack Overflow.) Or do you want to create a random number generator? (Then it still lacks information ... or it simply gets a list of known RNG algorithms, and list-questions are off-topic here.)
Nov
30
comment Software implementation of a commutative cipher?
Do you have a reference for Pohlig-Hellman? A very short googling finds only an algorithm for calculating discrete logarithms, and I don't see how this would apply here.
Nov
30
revised Software implementation of a commutative cipher?
It doesn't work this way - thanks to poncho for pointing this out.
Nov
30
comment Is it a good idea to use bitwise XOR on a set of MD5 sums?
@fgrieu: Thanks for the note. Such occasions are when I wish I could downvote my own answer.
Nov
30
revised Is it a good idea to use bitwise XOR on a set of MD5 sums?
added 530 characters in body
Nov
30
revised How can I make my cipher show the avalanche effect?
spelling (sorry, cypher looks just wrong).