An elliptic curve implementation of the finite field digital signature algorithm
Author:
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 327-337
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone AlgorithmJournal of Cryptology, 1998
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝Mathematics of Computation, 1998
- Algebraic Aspects of Cryptography1998
- A Course in Number Theory and Cryptography1994
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- Elliptic curve cryptosystems and their implementationJournal of Cryptology, 1993
- Optimal normal basesDesigns, Codes and Cryptography, 1992
- A Classical Introduction to Modern Number Theory1990
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1988
- Elliptic Curve CryptosystemsMathematics of Computation, 1987