Jerome A. Solinas. Improved algorithms for arithmetic on anomalous binary curves. In Advances in Cryptography, Crypto '97, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Elliptic Curve Digital Signature Algorithm (ECDSA) - Johnson, Menezes (1999) (1 citation) (Correct)
....also known as anomalous binary curves, were first proposed for cryptographic use by Koblitz [42] They are elliptic curves over F 2 m whose defining equations have coefficients in F 2 . Thus, there are 2 Koblitz curves over F 2 m : y 2 xy = x 3 1 and y 2 xy = x 3 x 2 1. Solinas [88, 90], building on earlier work of Meier and Staffelbach [53] showed how one can compute kP very efficiently for arbitrary k where P is a point on a Koblitz curve. Since performing such scalar multiplications is the dominant computational step in ECDSA signature generation and verification (see x7) ....
J. Solinas, "Improved algorithms for arithmetic on anomalous binary curves", Technical report CORR-46, Dept. of C&O, University of Waterloo, 1999. Available from http://www.cacr.math.uwaterloo.ca
High Performance Elliptic Curve Cryptographic Co-processor - Lutz (2003) (Correct)
No context found.
Jerome A. Solinas. Improved algorithms for arithmetic on anomalous binary curves. In Advances in Cryptography, Crypto '97, 1997.
Linear Recursive Sequences over Elliptic Curves - Gong, Lam (2001) (Correct)
No context found.
J. Solinas, Improved Algorithms for Arithmetic on Anomalous Binary Curves, CACR Technical Reports, CORR 99-46, University of Waterloo, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC