Reputation
15,033
Top tag
Next privilege 20,000 Rep.
Access 'trusted user' tools
Badges
3 41 86
Impact
~445k people reached

Jun
6
comment Share two secrets between two parties
Welcome to Cryptography Stack Exchange. We actually prefer answers which contain the information itself, not just referring to information elsewhere. Could you add a summary of the information to the answer? Otherwise we will convert your answer to a comment.
May
29
revised Is it practical to use a stream cipher in a block cipher mode?
added 4 characters in body
May
29
revised Is it practical to use a stream cipher in a block cipher mode?
make clear which answer is meant to be wrong (it was the accepted answer when this was written).
May
28
revised Is it practical to use a stream cipher in a block cipher mode?
add disclaimer to the top
May
28
comment Is it practical to use a stream cipher in a block cipher mode?
Actually, my answer didn't say "you can't convert a stream cipher into a block cipher", but "the way of converting which was proposed in the question doesn't work". I'll try to edit it.
May
28
revised Is it practical to use a stream cipher in a block cipher mode?
formatting
May
27
comment Effective security of block cipher – equal the key size, or half the key size?
@Dillinur If I remember right, there is a generic quantum algorithm which finds preimages to functions in $O(\sqrt{N})$ time, where $N$ is the number of possible candidates (i.e. $O(\sqrt{2^n}) = O(2^{n/2})$ for $N = 2^n$). Of course, for this to actually work, you need a quite large quantum computer (about $n$ qbits, I think), and also fast enough. Then it depends on the constant factor to see if it is faster than regular brute-force.
May
27
comment Effective security of block cipher – equal the key size, or half the key size?
Also, this only seems to work with a fixed initialization vector (or if you somehow manage to query the block cipher itself), right? (I guess a "chosen-IV-fixed-known-plaintext" attack on CBC allows this.)
May
27
comment Effective security of block cipher – equal the key size, or half the key size?
Maybe the algorithm would be clearer if the first loop used $X$ instead of $T$ as a variable name? (Also, the hash table access is likely not O(1), but $O(\log(2^{n/2})) = O(n)$. Still almost negligible compared to $O(2^{n/2})$.)
May
26
comment Effective security of block cipher – equal the key size, or half the key size?
@J.D. Please add this as an answer (with some details of how this attack works and a reference to a paper or similar).
May
25
comment Is it practical to use a stream cipher in a block cipher mode?
@J.D. consider adding an answer to the question linked in my previous comment, if that is not already covered by one of the answers there.
May
25
comment Can you make a hash out of a stream cipher?
If you have a PRF, why can't we use that directly as the compression function? It looks like unnecessary overhead to first build a PRP from a PRF, and then use Davies-Meyer to remove the P aspect from it?
May
25
revised Can you make a hash out of a stream cipher?
Fiestel → Feistel
May
25
comment Is it practical to use a stream cipher in a block cipher mode?
In Converting a stream cipher into a block cipher, this is discussed in a more general way – it looks like there is no way to build a block cipher from just a stream cipher, though if you additionally can use a keyed hash function, it might work. (You'll get a block cipher for much larger blocks, though.)
May
25
answered Is it practical to use a stream cipher in a block cipher mode?
May
25
comment Is it possible to have identical public keys for different ciphers?
@Nayef it looks like you misunderstood the question ... it is about public keys from different schemes colliding, not about collisions within one scheme (RSA and DSA in your example).
May
19
comment How do we know one-way functions can be iterated?
@fkraiem in a general mathematical point of view, both "input" and "output" of a function can elements of some arbitrary sets. Nothing stringy here. The set of (finite) bit-strings and its subsets are important examples, but not really exclusive ones.
May
19
revised How do we know one-way functions can be iterated?
recursion would be g(n) = g(h(n)) or similar. Using the output of a function as its input is named iterating it.
May
1
comment PGP digital signature vs SHA256 HMAC Comparison
keylength.com has some comparisons of key sizes for algorithms.
May
1
revised PGP digital signature vs SHA256 HMAC Comparison
adding some paragraph breaks