Faster ECC over F 2 521 − 1

@inproceedings{Granger2015FasterEO,
  title={Faster ECC over F 2 521 − 1},
  author={Robert Granger and Michael Scott},
  year={2015}
}
In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime 2 − 1. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires 1,073,000 cycles, while on the recently proposed Edwards curve E-521 it requires just 943,000 cycles. As a comparison, on the same architecture openSSL’s ECDH speed test for curve P-521 requires 1,319,000 cycles. Furthermore, our code was written… CONTINUE READING
6 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-6 of 6 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Safecurves: choosing safe curves for elliptic-curve cryptography

  • Daniel J. Bernstein, Tanja Lange
  • http: //safecurves.cr.yp.to, accessed
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…