Reputation
1,207
Top tag
Next privilege 1,250 Rep.
Create tag synonyms
Badges
2 12 21
Newest
 Yearling
Impact
~38k people reached

Sep
7
awarded  Nice Answer
Aug
2
awarded  Beta
Jul
23
awarded  Nice Question
Jul
20
answered Should we MAC-then-encrypt or encrypt-then-MAC?
Jul
18
awarded  Nice Question
Jul
15
comment Is it possible to derive the encryption method from encrypted text?
Alternatively, if you determine with LESS than 1/2, you can also consider it broken. Simply pick the opposite of whatever your algorithm says.
Jul
15
accepted How can I use asymmetric encryption, such as RSA, to encrypt an arbitrary length of plaintext?
Jul
14
answered advances in usability for cryptography/authentication
Jul
14
answered Taking advantage of one-time pad key reuse?
Jul
13
awarded  Editor
Jul
13
comment How can I generate large prime numbers for RSA?
+1 for mentioning FIPS, which is different than what most implementations use.
Jul
13
awarded  Scholar
Jul
13
accepted What are the practical differences between 256-bit, 192-bit, and 128-bit AES encryption?
Jul
13
comment What are the practical differences between 256-bit, 192-bit, and 128-bit AES encryption?
There are actual several attacks against AES, reducing time below 2^length. The attacks can be done in 2^119, 2^176, and 2^200 respectively. schneier.com/blog/archives/2009/07/another_new_aes.html
Jul
13
accepted How were the DES S-box values determined?
Jul
13
awarded  Cleanup
Jul
13
awarded  Critic
Jul
13
revised How can I use asymmetric encryption, such as RSA, to encrypt an arbitrary length of plaintext?
rolled back to a previous revision
Jul
12
awarded  Self-Learner
Jul
12
awarded  Precognitive