Reputation
36,667
Next tag badge:
119/100 score
19/20 answers
Badges
6 79 150
Impact
~792k people reached

2d
comment Can you explain Bleichenbacher's CCA attack on PKCS#1 v1.5?
@ddddavidee: thanks; I fixed the link in the answer.
2d
revised Can you explain Bleichenbacher's CCA attack on PKCS#1 v1.5?
Fixed link to Bleichenbacher's article
Jul
26
awarded  Stellar Question
Jul
23
answered Why is Rabin encryption equivalent to factoring?
Jul
16
awarded  Nice Answer
Jul
16
comment Unpredictability of X.509 serial numbers
Integers are integers -- they are not bounded, otherwise we call them modular integers. It so happens that modern computers are most comfortable with integers modulo 32 or 64 bits (i.e. "32-bit or 64-bit integers") but they can still handle larger integers, as they do for RSA. For backward compatibility, X.509 (RFC 5280) says that the serial number shall be positive and its encoded value should fit in 20 bytes, which means that you have 159 bits to play with (serial number shall be between 0 and 2^159-1, inclusive).
Jul
15
awarded  Enlightened
Jul
15
awarded  Nice Answer
Jul
14
answered Is there a multiple asymmetric encryption algorithm, which requires all private keys to reveal the secret?
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