Reputation
36,475
Next tag badge:
399/400 score
85/80 answers
Badges
1 32 77
Newest
 Enlightened
Impact
~525k people reached

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.
Jan
3
answered Finding discrete logarithm with baby-step-giant-step algorithm
Jan
3
comment Post processing of AAD and len A||C in a hardware AES GCM implementation
@MaartenBodewes-owlstead: in $GF(2^{128})$, $+$ is the same as xor, so Rods has that part correct.
Jan
3
answered Attack an stream cypher using 2 XORed LFSRs
Jan
2
answered Plaintext XOR'd with keylength-shifted plaintext
Jan
2
reviewed Approve How exactly to extract information base 10 from a PGP RSA key pair?
Jan
2
reviewed Reviewed How much extra information is in an RSA public key?
Jan
2
answered Is AES_CMAC specified to double ciphered zeroes during initialization?
Jan
2
reviewed Approve Asymmetric sign in public enviroment
Jan
2
reviewed No Action Needed Is BBS used for generation of keys for any modem cryptosystem?
Jan
2
reviewed Leave Open can anyone give the java code to encrypt files using paillier
Jan
1
comment Discrete logarithm modulo a smooth number
@Ding: just ignore it then; if it is true of every possible $x$, it needn't be a constraint for selecting an $x$
Jan
1
comment Discrete logarithm modulo a smooth number
@Ding: $y=0$ is absolutely not a problem. If you are worried that there might not be any other solutions, well, $y=k(p-1)$ (for any integer $k$) will also be a solution.