Reputation
14,430
Next tag badge:
102/100 score
17/20 answers
Badges
1 36 76
Newest
 Nice Answer
Impact
~288k people reached

Jun
25
reviewed No Action Needed Why in Android kernel CSPRNG state is saved?
Jun
25
reviewed Reviewed If you have a file and XOR every bit with a random bit, can you extract any information?
Jun
25
comment Why is HMAC-SHA1 still considered secure?
Should we close this as a duplicate of Is HMAC-MD5 considered secure for authenticating encrypted data?? While this question is about SHA1, not MD5, the answer is nearly the same.
Jun
25
answered Why is HMAC-SHA1 still considered secure?
Jun
25
awarded  Constituent
Jun
24
awarded  Reviewer
Jun
24
reviewed Approve Are factorization algorithms parallelizable?
Jun
24
reviewed Approve What prime lengths are used for RSA?
Jun
24
reviewed Approve How does knowing the factorization of N help to obtain the secret?
Jun
24
reviewed Leave Open what are the most common stream ciphers algorithms?
Jun
23
comment what are the most common stream ciphers algorithms?
Salsa20 is relatively common as well, due to its use in NaCl and its derivatives.
Jun
23
reviewed Close What is the danger if a non-prime is chosen for RSA?
Jun
23
comment what are the most common stream ciphers algorithms?
AES in CTR mode.
Jun
23
revised On Proving That a Primitive Does Not Exist
edited tags
Jun
22
reviewed Leave Open Attack for RSA 1024 bit with Low Public Exponent
Jun
22
reviewed Close Which symmetric cipher is best for studying?
Jun
22
reviewed Approve ECC vs RSA: how to compare key sizes?
Jun
22
reviewed No Action Needed How is wpa2 authentication structured
Jun
22
reviewed No Action Needed Attack for RSA 1024 bit with Low Public Exponent
Jun
22
comment RSA: How effective is this keypair-trash attack
In the duplicate I already wrote that there are $2^{500}$ primes relevant for 1024 bit RSA which has a security of about 80 bits against GNFS. What more do you want? An illustration of how unimaginably huge $2^{500}$ is?