Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- More Generalized Mersenne NumbersLecture Notes in Computer Science, 2004
- XTR Extended to GF(p 6m)Lecture Notes in Computer Science, 2001
- Faster Point Multiplication on Elliptic Curves with Efficient EndomorphismsLecture Notes in Computer Science, 2001
- Comparison of three modular reduction functionsPublished by Springer Nature ,2001
- A Subexponential Algorithm for Discrete Logarithms over All Finite FieldsPublished by Springer Nature ,2001
- CM-Curves with Good Cryptographic PropertiesPublished by Springer Nature ,2001
- Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fieldsPublished by Springer Nature ,1997
- Hyperelliptic cryptosystemsJournal of Cryptology, 1989
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Modular multiplication without trial divisionMathematics of Computation, 1985