An implementation of elliptic curve cryptosystems over F/sub 2/155
- 1 June 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 11 (5) , 804-813
- https://doi.org/10.1109/49.223883
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Constructing Elliptic Curve Cryptosystems in Characteristic 2Published by Springer Nature ,2001
- Use of Elliptic Curves in CryptographyPublished by Springer Nature ,2000
- Reducing elliptic curve logarithms to logarithms in a finite fieldPublished by Association for Computing Machinery (ACM) ,1991
- The discrete logarithm problemPublished by American Mathematical Society (AMS) ,1991
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1989
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod pMathematics of Computation, 1985
- Monte Carlo Methods for Index Computation (mod p)Mathematics of Computation, 1978