9,824 reputation
12450
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 3 months
seen 1 hour ago

Oct
29
suggested suggested edit on
Oct
29
wiki
Oct
29
suggested suggested edit on
Oct
29
revised Can a proof be constructed to show there is no distinguisher?
edited tags
Oct
29
revised Counter mode secure hash algorithm
edited tags
Oct
29
revised How does the energy consumption of the SHA-3 finalists compare?
edited tags
Oct
29
revised Tree hash and multithreading for parallelism
deleted 4 characters in body; edited tags
Oct
29
wiki created skein excerpt
Oct
29
suggested suggested edit on skein tag wiki excerpt
Oct
29
reviewed Approve suggested edit on Does chaining random number generators lead to loss of randomness?
Oct
29
revised Can two different pairs of RSA key have the same modulus?
added 7 characters in body
Oct
28
revised Why is an Encrypt-and-MAC scheme with deterministic MAC not IND-CPA secure?
deleted 16 characters in body; edited title
Oct
27
revised Why do we need in RSA the modulus to be product of 2 primes?
added 2 characters in body
Oct
27
revised Why do we need in RSA the modulus to be product of 2 primes?
added 297 characters in body
Oct
27
revised Why do we need in RSA the modulus to be product of 2 primes?
added 297 characters in body
Oct
27
revised Why do we need in RSA the modulus to be product of 2 primes?
deleted 75 characters in body
Oct
27
answered Why do we need in RSA the modulus to be product of 2 primes?
Oct
27
reviewed Approve suggested edit on Subgroups generators with respect to group generators of composite order
Oct
26
comment How weak/strong is this hand cipher? (updated)
The attack does not require any key guessing. The key is simply the ciphertext of the previous block. Any data after 3*n chars where n is the length of each key can be trivially decrypted without knowing any of the keys.
Oct
26
comment How weak/strong is this hand cipher? (updated)
The attack from before still works, except you need to run it three times.