Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications
- 28 February 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 158-175
- https://doi.org/10.1007/3-540-36563-x_11
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A low-complexity combinatorial RNS multiplierIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2001
- A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m)Lecture Notes in Computer Science, 2000
- Elliptic Curve Cryptosystems over Small Fields of Odd CharacteristicJournal of Cryptology, 1999
- GF(p/sup m/) multiplication using polynomial residue number systemsIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1995
- Fast combinatorial RNS processors for DSP applicationsIEEE Transactions on Computers, 1995
- Hyperelliptic cryptosystemsJournal of Cryptology, 1989
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- On xn + x + 1 over GF(2)Information and Control, 1970
- On primitive trinomials (mod 2), IIInformation and Control, 1969
- On primitive trinomials (Mod 2)Information and Control, 1968