Fast Normal Basis Multiplication Using General Purpose Processors

IEEE Transactions on Computers

Volumn 52, Issue 11, 2003, Pages 1379-1390

  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

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER HARDWARE; COMPUTER SOFTWARE; PROGRAM PROCESSORS; VECTORS;

COMPOSITE FIELDS; DYNAMIC INSTRUCTION;

CRYPTOGRAPHY;

EID: 0242493840     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1244936     Document Type: Article

References (35)

1. G.B. Agnew, R.C. Mullin, I.M. Onyszchuk, and S.A. Vanstone, "An Implementation for a Fast Public-Key Cryptosystem," J. Cryptology, vol. 3, pp. 63-79, 1991.
2. 2155," IFEE J. Selected Areas in Comm., vol. 11, no. 5, pp. 804-813, June 1993.
3. 2 for Software Implementation," Proc. Fourth Ann. Workshop Selected Areas in Cryptography (SAC 97), 1997.
4. D.W. Ash, I.F. Blake, and S.A. Vanstone, "Low Complexity Normal Bases," Discrete Applied Math., vol. 25, pp. 191-210, 1989.
5. M. Ciet and J.-J. Quisquater, F. Sica, "A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography," Proc. Indocrypt 2001, pp. 108-116, Dec. 2001.
6. S.D. Galbraith and N. Smart, "A Cryptographic Application of Well Descent," Proc. Seventh IMA Conf. Cryptography and Coding, pp. 191-200, 1999.
7. S. Gao and H.W. Lenstra Jr., "Optimal Normal Bases," Designs, Codes and Cryptography, vol. 2, pp. 315-323, 1992.
8. J. Guajardo and C. Paar, Efficient Algorithms for Elliptic Curve Cryptosystems, pp. 342-356, Springer-Verlag, 1997.
9. M.A. Hasan, "Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems," IEEE Trans. Computers, vol. 49, no. 7, pp. 749-758, July 2000.
10. M.A. Hasan, M.Z. Wang, and V.K. Bhargava, "A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields," IEEE Trans. Computers, vol. 42, no. 10, pp. 1278-1280, Oct. 1993.
11. IEEE Std 1363-2000, "IEEE Standard Specifications for Public-Key Cryptography," Jan. 2000.
12. D. Johnson, A. Menezes, and S. Vanstone, "The Elliptic Curve Digital Signature Algorithm (ECDSA)," Int'l J. Information Security, vol. 1, pp. 36-63, 2001.
13. E. Knudsen, "Elliptic Scalar Multiplication Using Point Halving," Proc. ASIACRYPT 1999, pp. 135-149, 1999.
14. N. Koblitz, "Elliptic Curve Cryptosystems," Math. Computation, vol. 48, pp. 203-209, 1987.
15. k)," Designs, Codes, and Cryptography, vol. 14, pp. 57-69, 1998.
16. C. Lee and J. Lim, "A New Aspect of Dual Basis for Efficient Field Arithmetic," Proc. Int'l Workshop Practice and Theory in Public Key Cryptography (PKC '99), pp. 12-28, 1999.
17. 2," Proc. Indocrypt 2000, pp. 203-212, 2000.
18. C.-C. Lu, "A Search of Minimal Key Functions for Normal Basis Multipliers," IEEE Trans. Computers, vol. 46, no. 5, pp. 588-592, May 1997.
19. J.L. Massey and J.K. Omura, "Computational Method and Apparatus for Finite Field Arithmetic," US Patent No. 4,587,627, 1986.
20. M. Maurer, A. Menezes, and E. Teske, "Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree," Proc. Indocrypt 2001, pp. 195-213, Dec. 2001.
21. A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields, Kluwer Academic, 1993.
22. V.S. Miller, "Use of Elliptic Curves in Cryptography," Proc. Crypto '85, pp. 417-426, 1986.
23. n)," Discrete Applied Math., vol. 22, pp. 149-161, 1988/1989.
24. P. Ning and Y.L. Yin, "Efficient Software Implementation for Finite Field Multiplication in Normal Basis," Proc. Information and Commu. Security (ICICS 2001), pp. 177-181, Nov. 2001.
25. Nat'l Inst. of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, 2000.
26. S. Oh, C.H. Kim, J. Lim, and D.H. Cheon, "Efficient Normal Basis Multipliers in Composite Fields," IEEE Trans. Computers, vol. 49, no. 10, pp. 1133-1138, Oct. 2000.
27. C. Paar, P. Fleishmann, and P. Soria-Rodriguez, "Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents," IEEE Trans. Computers, vol. 48, no. 10, pp. 1025-1034, Oct. 1999.
28. A. Reyhani-Masoleh and M.A. Hasan, "On Efficient Normal Basis Multiplication," Proc. Indocrypt 2000, pp. 213-224, Dec. 2000.
29. A. Reyhani-Masoleh and M.A. Hasan, "Fast Normal Basis Multiplication Using General Purpose Processors," Technical Report CORR 2001-25, Dept. of C & O, Univ. of Waterloo, Canada, Apr. 2001.
30. A. Reyhani-Masoleh and M.A. Hasan, "Fast Normal Basis Multiplication Using General Purpose Processors," Proc. Selected Areas in Cryptography (SAC 2001), pp. 230-244, Aug. 2001.
31. m)," IEEE Trans. Computers, vol. 51, no. 5, pp. 511-520, May 2002.
32. M. Rosing, Implementing Elliptic Curve Cryptography. Manning Publications, 1999.
33. R. Schroeppel, H. Orman, S.W. O'Malley, and O. Spatscheck, "Fast Key Exchange with Elliptic Curve Systems," Proc. CRYPTO '95, pp. 43-56, 1995.
34. N.P. Smart, "How Secure Are Elliptic Curves over Composite Extension Fields?" Proc. Eurocrypt 2001, pp. 30-39, 2001.
35. B. Sunar and C.K. Koc, "An Efficient Optimal Normal Basis Type II Multiplier," IEEE Trans. Computers, vol. 50, no. 1, pp. 83-88, Jan. 2001.