Fast normal basis multiplication using general purpose processors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 230-244

  Reyhani Masoleh, Arash ^a   Hasan, M Anwar ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Composite fields; ECDSA; Finite field multiplication; Normal basis; Software algorithms

Indexed keywords

GENERAL PURPOSE COMPUTERS;

COMPOSITE FIELDS; ECDSA; FINITE FIELD MULTIPLICATION; NORMAL BASIS; SOFTWARE ALGORITHMS;

CRYPTOGRAPHY;

EID: 1642368314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_18     Document Type: Conference Paper

References (20)

1. G. B. Agnew, R. C. Mullin, I. M. Onyszchuk, and S. A. Vanstone. “An Implementation for a Fast Public-Key Cryptosystem”. Journal of Cryptology, 3:63-79, 1991.
2. 2155”. IEEE J. Selected Areas in Communications, 11(5):804-813, June 1993.
3. D. W. Ash, I. F. Blake, and S. A. Vanstone. “Low Complexity Normal Bases”. Discrete Applied Mathematics, 25:191-210, 1989.
4. S. D. Galbraith and N. Smart. A Cryptographic Application of Weil Descent. In Proceedings of the Seventh IMA Conf. on Cryptography and Coding, LNCS 1764, pages 191-200. Springer-Verlag, 1999.
5. S. Gao and H. W. Lenstra Jr.. “Optimal Normal Bases”. Designs, Codes and Cryptography, 2:315-323, 1992.
6. M. A. Hasan. Look-up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. IEEE Transactions on Computers, 49:749-758, July 2000.
7. M. A. Hasan, M. Z. Wang, and V. K. Bhargava. “A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields”. IEEE Transactions on Computers, 42(10):1278-1280, Oct. 1993.
8. D. Johnson and A. Menezes. “The Elliptic Curve Digital Signature Algorithm (ECDSA)”. Technical Report CORR 99-34, Dept. of C & O, University of Waterloo, Canada, August 231999. Updated: Feb. 24, 2000.
9. J. Lopez and R. Dahab. High Speed Software Multiplication in F2m. In Proceedings of Indocrypt 2000, pages 203-212. LNCS 1977, Springer, 2000.
10. Chung-Chin Lu. “A Search of Minimal Key Functions for Normal Basis Multipliers”. IEEE Transactions on Computers, 46(5):588-592, May 1997.
11. A. J. Menezes, I. F. Blake, X. Gao, R. C. Mullin, S. A. Vanstone, and T. Yaghoobian. Applications of Finite Fields. Kluwer Academic Publishers, 1993.
12. n)”. Discrete Applied Mathematics, 22:149-161, 1988/89.
13. National Institute of Standards and Technology. Digital Signature Standard. FIPS Publication 186-2, February 2000.
14. S. Oh, C. H. Kim, J. Lim, and D. H. Cheon. “Efficient Normal Basis Multipliers in Composite Fields”. IEEE Transactions on Computers, 49(10):1133-1138, Oct. 2000.
15. C. Paar, P. Fleishmann, and P. Soria-Rodriguez. “Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents”. IEEE Transactions on Computers, 48(10):1025-1034, Oct. 1999.
16. m)”. In 20th Biennial Symposium on Communications, pages 308-312, Kingston, Ontario, Canada, May 2000.
17. A. Reyhani-Masoleh and M. A. Hasan. “On Efficient Normal Basis Multiplication”. In LNCS 1977 as Proceedings of Indocrypt 2000, pages 213-224, Calcutta, India, December 2000. Springer Verlag.
18. A. Reyhani-Masoleh and M. A. Hasan. “Fast Normal Basis Multiplication Using General Purpose Processors”. Technical Report CORR 2001-25, Dept. of C & O, University of Waterloo, Canada, April 2001.
19. M. Rosing. Implementing Elliptic Curve Cryptography. Manning Publications Company, 1999.
20. B. Sunar and C. K. Koc. “An Efficient Optimal Normal Basis Type II Multiplier”. IEEE Transactions on Computers, 50(1):83-88, Jan. 2001.