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

Jan
31
answered how to determine block size for decryption
Jan
31
answered Proving property of Modified Rabin Signature
Jan
29
comment How does one calculate a primitive root for Diffie-Hellman?
@Broseph: actually $q$ needs to be more than $2t$ bits long. The reason is that a discrete logarithm can be broken in two ways: either generically (based on the size of $q$), or with index calculus (based on the size of $p$). Index calculus is sub-exponential, meaning that you must make $p$ much bigger. In practice, to get "80-bit security", you need $q$ to be at least 160 bits, and $p$ should be at least 1000 bits. If you choose $p = 2q+1$, then the criterion on $p$ is the one that matters (for an 1000-bit $p$, a 999-bit $q$ is overkill, but you need a $p$ that big anyway).
Jan
28
awarded  Necromancer
Jan
23
comment ECDSA Compressed public key point back to uncompressed public key point
@Myath: in binary curves it is a bit more complex to explain, but a rather efficient compression method still exists. I have updated my answer with some extra explanations.
Jan
23
revised ECDSA Compressed public key point back to uncompressed public key point
Added explanations for binary curves.
Jan
22
answered How to split up $GF(2^{128})$ into smaller fields?
Jan
19
awarded  Nice Answer
Jan
12
answered Scrypt not “old enough” to be safe?
Jan
12
awarded  Good Answer
Jan
11
awarded  Enlightened
Jan
11
awarded  Nice Answer
Jan
11
awarded  Good Answer
Jan
11
reviewed Approve What is a white-box implementation of a cryptographic algorithm?
Jan
11
awarded  Good Answer
Jan
4
awarded  Good Answer
Jan
3
comment Can you explain Bleichenbacher's CCA attack on PKCS#1 v1.5?
@Myath: ah no, that's the tricky point. If the server proceeds with a random key in case of bad padding, an inconsistent Finished does NOT reveal that the padding was bad -- maybe the padding was good, and the server merely used whatever pre-master secret it thus obtained (and is unknown to the attacker).
Dec
31
awarded  Nice Answer
Dec
30
revised How can I implement the elliptic curve MOV attack myself?
added 36 characters in body
Dec
18
awarded  Nice Answer