Reputation
43,930
Next tag badge:
149/100 score
18/20 answers
Badges
6 104 177
Newest
 Nice Answer
Impact
~1.1m people reached

Nov
1
comment Is it possible to reduce the size of an RSA key?
Since a 2048-bit RSA key is commonly said to be "112-bit equivalent", we could even lower the seed length to 112 bits with no loss in security. We may even scrape a few bits because each try in brute force attack would require, on average, a few hundreds of GCD with big integers, and that's not exactly cheap. On the other hand, take note that regenerating the key from the seed will be rather expensive, likely intolerably so in many embedded systems.
Oct
28
awarded  Nice Answer
Oct
28
revised Why do “nothing up my sleeve numbers” have low entropy?
added 316 characters in body
Oct
27
awarded  Good Answer
Oct
25
awarded  Enlightened
Oct
25
awarded  Nice Answer
Oct
22
awarded  Enlightened
Oct
22
awarded  Nice Answer
Oct
13
awarded  Necromancer
Oct
11
comment Weaknesses of RFC6628
We can add that for all password-based authentication protocols, what the server knows must allow for offline dictionary attacks, since an attacker who could get a complete snapshot of the server could simulate a client and a server on his own machines, and see when the simulated server is content with the password provided by the simulated client. This is rather unavoidable; thus, it is not a vulnerability of SRP specifically, but rather a vulnerability of authenticating clients with passwords.
Oct
10
answered Can an ephemeral RSA key give forward secrecy?
Oct
6
awarded  Nice Answer
Oct
5
answered How does RSA compute such enormous numbers?
Oct
3
answered Calculating $\mathbb F_{p^2}$-rational points of an elliptic curve defined over $\mathbb F_p$
Oct
3
answered Stream Ciphers and cycling questions
Sep
30
comment Need some understanding on RSA public key exponent
It should be noted that when you generate a RSA key pair, you need to invert $e$ modulo $p-1$ and $q-1$; the natural algorithm for that is the extended GCD (binary GCD is easiest to implement) so you end up computing the GCD anyway.
Sep
26
answered Shared modulus attack on RSA
Sep
15
answered ciphertext packing for bandwidth optimization
Sep
2
awarded  Guru
Aug
23
awarded  Nice Answer