639 reputation
411
bio website
location
age
visits member for 2 years
seen yesterday

1d
awarded  Yearling
Jul
15
comment Is RSA of a random nonce with no padding safe?
Out of curiosity: Will this scheme also work without the final step $k = H(x)$, e.g. by simply taking the $n$ left- or rightmost bits of $x$?
Jul
2
awarded  Curious
Apr
21
awarded  Critic
Apr
21
accepted Relation between key size and PRNG state size
Apr
21
awarded  Notable Question
Mar
6
accepted Name for identical operations for encryption and decryption
Mar
6
accepted Is semantic security important in a hybrid cryptosystem?
Mar
6
accepted What exactly could be accomplished with a backdoor in Dual_EC_DRBG?
Mar
6
asked Will non-ECC algorithms like RSA eventually become too inefficient?
Mar
5
comment Why is “multiplying” $g^x$ and $g^y$ not possible?
Back to my highschool math textbooks it is then. Thank you!
Mar
5
accepted Why is “multiplying” $g^x$ and $g^y$ not possible?
Mar
5
asked Why is “multiplying” $g^x$ and $g^y$ not possible?
Mar
3
revised How does TLS generate the shared secret?
structured the answer
Mar
3
revised How does TLS generate the shared secret?
added 475 characters in body
Mar
3
answered How does TLS generate the shared secret?
Jan
3
awarded  Enlightened
Jan
2
awarded  Nice Answer
Sep
17
comment Could RDRAND (Intel) compromise entropy?
I agree - if properly done, hashing it into the pool would make any kind of backdoor much more difficult to implement. Maybe it will be changed again - RdRand has been moved around in random.c quite a lot already.
Sep
17
revised Could RDRAND (Intel) compromise entropy?
added 730 characters in body