Reputation
36,340
Next tag badge:
score
answers
Badges
1 31 76
Impact
~521k people reached

Jan
7
reviewed Reviewed Public key encryption
Jan
6
reviewed No Action Needed How to roll my own hardware RNG?
Jan
6
reviewed No Action Needed Interested in learning cryptography
Jan
6
reviewed Close Interested in learning cryptography
Jan
6
reviewed Close Camellia or AES - which should I use?
Jan
6
reviewed Close Difference between statistical PRNG and cryptographic PRNG?
Jan
6
reviewed Leave Open (Re-)Using deterministic IV in CTR mode / How to: deterministic AES
Jan
5
awarded  Enlightened
Jan
5
awarded  Nice Answer
Jan
5
reviewed No Action Needed Is there a hash function which has no collisions?
Jan
5
reviewed No Action Needed Are there any Secp256k1 ECDSA test examples available?
Jan
5
reviewed No Action Needed What is the keyspace of ROT-13?
Jan
5
reviewed Close Why hash or salt when signing?
Jan
5
reviewed Close Is a Combined Linear Congruential Generator secure for cryptography?
Jan
5
awarded  Enlightened
Jan
5
awarded  Nice Answer
Jan
3
answered How are calculated numbers in AES S-box?
Jan
3
reviewed Close RSA - Why should we sign hash rather than raw content?
Jan
3
comment Relations between RSA and DLOG, factoring and DLOG
@cpast: however, that reduction is the wrong direction; if you have a black box that solves the RSA problem, there is no known way to use it to efficiently factor. This leaves open the possibility that the RSA problem is easier than factoring.
Jan
3
comment Finding discrete logarithm with baby-step-giant-step algorithm
@usry: no, what I wrote works just fine; just because you compute $a^j$ and $B \cdot a^{-im}$ modulo $p$ doesn't mess anything up.