Optimal extension fields for fast arithmetic in public-key algorithms
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 472-485
- https://doi.org/10.1007/bfb0055748
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Handbook of Applied CryptographyPublished by Taylor & Francis ,2018
- Public-Key Cryptosystems with Very Small Key LengthsPublished by Springer Nature ,2001
- Efficient algorithms for elliptic curve cryptosystemsPublished by Springer Nature ,1997
- A fast software implementation for arithmetic operations in GF(2n)Published by Springer Nature ,1996
- Fast Key Exchange with Elliptic Curve SystemsPublished by Springer Nature ,1995
- Elliptic Curve CryptosystemsMathematics of Computation, 1987