Reputation
14,028
Next tag badge:
129/100 score
18/20 answers
Badges
3 36 75
Newest
 Deputy
Impact
~344k people reached

Oct
12
revised How to attack a classical cipher using known partial plaintext?
line breaks for the cipher text
Oct
12
comment Strength of multiple hash iterations?
Some more discussion is here: Webapp password storage: Salting a hash vs multiple hashes?
Oct
12
revised Is it feasible to build a stream cipher from a cryptographic hash function?
adding disclaimer
Oct
12
answered Strength of multiple hash iterations?
Oct
12
revised RIPEMD versus SHA-x, what are the main pros and cons?
tag, wording
Oct
12
revised Is there an algorithm or hardware that can sign/verify natural time?
word order
Oct
12
awarded  Civic Duty
Oct
12
revised Are there reference implementations of ECQV implicit certificates?
inline the link
Oct
12
revised What are the benefits of the two permutation tables in DES?
formatting, mentioning end of algorithm
Oct
11
revised Why has the RSA factoring challenge been withdrawn?
edited tags
Oct
10
comment How well does scrypt perform on different architectures / OSes?
Any measurements for specific CPUs will depend quite hard on the memory/CPU factor $N$. If all the hashes needed still fit in some cache, this will be quite than if they don't fit.
Oct
10
revised Encrypt-then-MAC Confidentiality, Integrity and Authenticity
add missing first hash function call in the HMAC scheme, fix RFC link
Oct
10
revised Generating non-repeating N-bit IVs, which are indistinguishable from randomness
formatting
Oct
10
revised How well does scrypt perform on different architectures / OSes?
tags, add link
Oct
10
comment How do other, non-RSA algorithms, compare to the PKCS #1 standard?
a patent [...] leaves time for cryptanalysts to do their job: On the other hand, there might be less cryptanalists inclined to do research on a patented algorithm (if not paid by the patent holder).
Oct
10
comment Generating non-repeating N-bit IVs, which are indistinguishable from randomness
While the whole sequence of outputs of a PRNG will not repeat early, individual output numbers (128-bit blocks) as well as any 64-bit blocks derived from this will have duplicates earlier.
Oct
10
comment Generating non-repeating N-bit IVs, which are indistinguishable from randomness
@fgrieu I can imaging that if using some steganography scheme, which hides the whole protocol data inside the noise of other data (e.g. low bits of images).
Oct
10
comment When is an asymmetric scheme considered broken?
Actually, the quote given in the question is also in the same document (page 20).
Oct
10
comment Encrypt-then-MAC Confidentiality, Integrity and Authenticity
Did you read Should we MAC-then-encrypt or encrypt-then-MAC? Thomas' answer explains how to do it right.
Oct
10
comment How do other, non-RSA algorithms, compare to the PKCS #1 standard?
Thanks, looks better now. (I adapted the tags to fit.)