Reputation
13,978
Next tag badge:
129/100 score
18/20 answers
Badges
3 34 73
Newest
 Nice Answer
Impact
~330k people reached

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.)
Oct
10
revised How do other, non-RSA algorithms, compare to the PKCS #1 standard?
edited tags
Oct
10
revised How common are SEED certificates outside of Korea? When is support required?
link, tags
Oct
10
comment How do other, non-RSA algorithms, compare to the PKCS #1 standard?
This is a quite broad question, as there are quite a number of different types of algorithms defined here: public-key encryption, public-key signature, key-exchange, password-based key derivation (maybe more, I'm not sure). And also quite a number of data formats. Could you limit your question to one of these types, and maybe post separate questions for the other types (if necessary)?
Oct
10
revised Generating non-repeating N-bit IVs, which are indistinguishable from randomness
add easier way of nonce
Oct
10
comment Generating non-repeating N-bit IVs, which are indistinguishable from randomness
Ah, if you have that anyways, I think you can also use any cryptographic PRNG - the probability of repetitions is quite small before that. (You might shift the rekeying a bit earlier to be more on the safe side.)
Oct
10
answered Generating non-repeating N-bit IVs, which are indistinguishable from randomness
Oct
9
revised Does anyone have a KAT for 3DES KO-2?
edited tags, adding description of the algorithm, inlining links
Oct
9
revised Does anyone have a KAT for 3DES KO-2?
edited tags
Oct
9
comment Does anyone have a KAT for 3DES KO-2?
Note that the current recommendation is to use three distinct (independent) keys, so KO 2 is effectively deprecated. That said, you simply can generate those test vectors using any other implementation, as 3DES is deterministic.
Oct
8
comment What is the “Random Oracle Model” and why is it controversial?
@MatthewGreen: Just reading your blog article, it is a good one. Thanks for the link!
Oct
8
comment What is the “Random Oracle Model” and why is it controversial?
@MatthewGreen Welcome to Cryptography Stack Exchange. I converted your answer into a comment, since we don't want answers consisting of only a link. Feel free to post a new answer with the most important information extracted from your blog post.
Oct
8
revised Why choose an authenticated encryption mode instead of a separate MAC?
title, formatting, tag
Oct
7
revised How robust is discrete logarithm in $GF(2^n)$?
formatting, add link
Oct
6
answered How to calculate the time it'll take to crack RSA or DH?
Oct
4
answered What is the likely cause the RSA algorithm gives back plain text in this case?