35,035 reputation
12974
bio website
location
age
visits member for 3 years, 7 months
seen 3 hours ago

Oct
30
answered Direct sum of Binary numbers In Mixcolumns
Oct
30
revised Direct sum of Binary numbers In Mixcolumns
edited tags
Oct
29
reviewed Approve The Boneh-DeMillo-Lipton fault attack (RSA CRT)
Oct
29
reviewed Approve Can you make a hash out of a stream cipher?
Oct
28
comment rsa public and private keys
Actually, we know algorithms that will generate provable primes of the same size, and with about the same efficiency (e.g. Shawe-Taylor)
Oct
28
reviewed Reviewed Why is the IV passed in the clear when it can be easily encrypted?
Oct
28
comment Why is the IV passed in the clear when it can be easily encrypted?
This really isn't why we believe it's safe to send the IV in the clear. It's not because the key protects us, but instead that a) the security proof of CBC mode shows us that knowledge of the the IV does not aid the attacker, assuming that the attacker can't choose the message after knowing about the IV, and b) the observation that each ciphertext block in the message effectively acts like the IV for the rest of the message, hence sending the IV in the clear is no riskier than sending the ciphertext itself.
Oct
28
reviewed No Action Needed rsa public and private keys
Oct
27
answered RSA prove $a^{\varphi(n)/g} \equiv 1 \pmod{n}$
Oct
27
reviewed No Action Needed Are there any many to one encryption frameworks available?
Oct
27
reviewed Reject encryption tag wiki
Oct
26
reviewed Approve Chosen plaintext attack on textbook RSA decryption
Oct
25
answered Use case of RSA CRT
Oct
25
revised What do you call one time pad where pseudo-random numbers are used?
edited tags
Oct
25
reviewed Close How are salt values more secure?
Oct
25
reviewed Reviewed Operation which needs much computing power to be created, but just a little to be solved?
Oct
25
reviewed No Action Needed What do you call one time pad where pseudo-random numbers are used?
Oct
25
comment Is there any probabilistic version of RSA?
@ddddavidee: actually, the PKCS #1.5 signature method is determanistic, and is in common use. However, I would agree that any encryption padding will be nondetermanistic (to prevent someone from verifying a guess on the plaintext, if nothing else).
Oct
24
revised DES-X , computation load and storage
added 351 characters in body
Oct
24
revised DES-X , computation load and storage
added 526 characters in body