Reputation
37,670
Next tag badge:
99/100 score
25/20 answers
Badges
1 35 80
Newest
 Nice Answer
Impact
~553k people reached

Feb
17
reviewed Close How to store and use a Cryptographic Seed in a database
Feb
16
answered Equivalent key size between HMAC and AES?
Feb
16
revised Questions about updating the secret key of RSA?
added 14 characters in body
Feb
16
comment Questions about updating the secret key of RSA?
@Pierre: actually, knowing $e_1, d_1$ is enough to allow a quick factorization of $N$, even if $e_1$ is large.
Feb
16
revised Questions about updating the secret key of RSA?
added 232 characters in body
Feb
16
revised Questions about updating the secret key of RSA?
Corrected answer
Feb
16
answered Questions about updating the secret key of RSA?
Feb
16
comment SHA-512 Length Field - What is it?
@InkSlob: Actually, the length field is encoded as a 128-bit big endian integer. For a 1919 bit message, the length field would be 0x0000000000000000000000000000077F (that is, the first 14 bytes are 0x00, and the last two are 0x07 and 0x7F); that is the value 1919. It goes in the last 16 bytes of the final block.
Feb
15
reviewed Close Requirement for the exponent generation during DH protocol
Feb
13
reviewed No Action Needed How to prove Security of Onion Layers of encryption?
Feb
13
reviewed Reviewed Is there a security analysis of CryptDB?
Feb
13
comment Is there a security analysis of CryptDB?
You should include a summary of the article (in case the link breaks)
Feb
13
reviewed No Action Needed Hashing - Digital Signing and Trivial Stretching
Feb
13
reviewed No Action Needed Symmetric mutual authentication with client using a derived secret
Feb
13
comment Can we say that if $P=NP$ there is no CPA secure public key encryption?
@Bush: no, it doesn't; read what Thomas wrote. A polynomial algorithm means it doesn't slow down that much as the problem becomes larger; a polytime algorithm can take large multiples of the lifetime of the universe on any input (as long as the number of multiples doesn't increase that fast as we scale the size of the problem upwards).
Feb
13
comment Which characters to take into account when calculating unicity distance?
@GeorgeG: are you saying that you forbid the attacker from using a dictionary of English words? That's the point CodesInChaos is making. A plaintext of "cKwpTzuQ" is not English, while "I believe" is; a model that accepts both doesn't account for the redundancy within English text.
Feb
13
comment Which characters to take into account when calculating unicity distance?
This is wrong: Unicity distance is the amount of ciphertext you need before there is likely to be one key that decrypts it into a plausible plaintext. Are you really saying that, with 4 bytes of ciphertext, there is likely to be only one 128 bit key that decrypts it into a plausible English plaintext? I believe you'd find the answer (using your Entropy model, which isn't really that accurate for short texts) to be closer to 20 characters.
Feb
13
reviewed No Action Needed Which characters to take into account when calculating unicity distance?
Feb
13
revised Explanation of each of the parameters used in ECC
Fixed the equation
Feb
12
reviewed Reviewed How easily could this be cracked?