Reputation
40,500
Next tag badge:
130/100 score
19/20 answers
Badges
6 94 162
Newest
 Necromancer
Impact
~1.0m people reached

Jul
13
awarded  Nice Answer
Jul
12
awarded  Yearling
Jul
12
comment Is this commutative encryption protocol secure?
To my knowledge, nobody has found yet a way to do a secure key exchange with only symmetric cryptography algorithms. This does not prove that it is impossible, only that if it can be done then it is probably non-obvious and quite tricky.
Jul
12
awarded  Enlightened
Jul
12
answered Is this commutative encryption protocol secure?
Jul
12
awarded  Nice Answer
Jul
12
reviewed Approve Why Elliptic Curves?
Jul
11
answered Why Elliptic Curves?
Jul
3
awarded  Enlightened
Jul
3
awarded  Nice Answer
Jun
30
awarded  Guru
Jun
24
answered What prime lengths are used for RSA?
Jun
23
reviewed Approve How are timestamps verified?
Jun
20
awarded  Revival
Jun
20
answered Double-and-add/Montgomery VS blinding
Jun
14
awarded  Revival
Jun
14
comment Meaning of entropy of a bitstring in NIST SP 800 - 90A
If passing tests was enough, competitions like eSTREAM would be meaningless. Anyone can run some statistical tests on a PRNG; but it takes years and many cryptographers to assess the actual security.
Jun
14
comment Meaning of entropy of a bitstring in NIST SP 800 - 90A
What I mean is that while statistics can detect things that attackers also know, attackers may know things that statistics do not detect. E.g. for a purportedly "strong" PRNG, if a statistical test detects a bias, then the PRNG is weak; but if the test detects nothing, then one must not conclude that the PRNG is strong. In practice, even bad PRNG are "perfect" from a statistical point of view.
Jun
14
answered Meaning of entropy of a bitstring in NIST SP 800 - 90A
Jun
14
answered Inserting a backdoor into a cryptographic hash function