Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 126-138
- https://doi.org/10.1007/bfb0027920
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Subexponential Algorithm for Discrete Logarithms over All Finite FieldsPublished by Springer Nature ,2001
- Discrete logarithms: The effectiveness of the index calculus methodPublished by Springer Nature ,1996
- Optimal normal basesDesigns, Codes and Cryptography, 1992
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- An implementation for a fast public-key cryptosystemJournal of Cryptology, 1991
- Algorithms in Number TheoryPublished by Elsevier ,1990
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1989
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Prime Numbers and Computer Methods for FactorizationPublished by Springer Nature ,1985
- Modular multiplication without trial divisionMathematics of Computation, 1985