Reputation
3,802
Top tag
Next privilege 4,000 Rep.
Access 'trusted user' tools
Badges
13 26
Newest
 Yearling
Impact
~45k people reached

  • 0 posts edited
  • 2 helpful flags
  • 568 votes cast
2d
answered Edwards / Montgomery ECC with Weierstrass Implementation?
Jul
22
answered Logjam-style attack on Factoring?
Jun
13
answered Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
Jun
8
answered RSA public key recovery from signatures
Jun
5
answered Why does anyone use elliptic curves for a CSPRNG?
May
23
answered Logjam on Elliptic Curves?
May
7
answered Encoding a message to a point of curve y^2=x^3+7 and Bitcoin Core
May
6
answered How is HMAC(message,key) more secure than Hash(key1+message+key2)
May
4
answered Factoring two RSA moduli $N_i=p_i\cdot q_i$ knowing that $p_2=p_1+2$?
Mar
28
answered What aspect of elliptic curve encryption paradigms makes them especially susceptible to quantum based attack algorithms?
Nov
19
answered Do data-dependent rotations have any advantage over fixed rotations?
Oct
29
answered Understanding Twist Security with respect to short Weierstrass curves
Aug
18
answered SRP-6 vulnerabilities when N is small
Jun
19
answered Parallelized Pollard's Rho algorithm for ECDLP + Jacobian coordinates
Jun
19
answered Fast hashing into elliptic curve
Jun
15
answered curve25519 weak points for contributory behaviour
May
6
answered Is knowing the private key of RSA equivalent to the factorization of $N$?
Feb
9
answered Safe elliptic curve point addition using projective coordinates: How do I tell if the points are the same?
Jan
19
answered Why is this authentication procedure using Rabin crypto not useful?
Jan
13
answered Time complexity to solve Discrete log problem