Efficient multiplication beyond optimal normal bases

IEEE Transactions on Computers

Volumn 52, Issue 4, 2003, Pages 428-439

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

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Composite fields; Finite fields; Multiplication; Normal bases; Optimal bases

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; DIGITAL ARITHMETIC; MATRIX ALGEBRA; THEOREM PROVING;

COMPOSITE FIELDS; FINITE FIELDS; MULTIPLICATION; NORMAL BASES; OPTIMAL BASES;

CRYPTOGRAPHY;

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

References (25)

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. M. Ciet, J.-J. Quisquater, and 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.
3. m)," IEEE Trans. Computers, vol. 51, no. 3, pp. 346-351, Mar. 2002.
4. S.D. Galbraith and N. Smart, "A Cryptographic Application of Weil Descent," Proc. Seventh IMA Conf. Cryptography and Coding, pp. 191-200, 1999.
5. S. Gao and H.W. Lenstra Jr., "Optimal Normal Bases," Designs, Codes, and Cryptography, vol. 2, pp. 315-323, 1992.
6. 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.
7. C.K. Koc and B. Sunar, "Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields," IEEE Trans. Computers, vol. 47, no. 3, pp. 353-356, Mar. 1998.
8. M. Leone, "A New Low Complexity Parallel Multiplier for a Class of Finite Fields," Proc. Cryptographic Hardware and Embedded Systems (CHES 2001), pp. 160-170, 2001.
9. 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.
10. J.L. Massey and J.K. Omura, "Computational Method and Apparatus for Finite Field Arithmetic," US Patent No. 4,587,627, 1986.
11. 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.
12. A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields. Kluwer Academic, 1993.
13. n)," Discrete Applied Math., vol. 22, pp. 149-161, 1988/89.
14. Nat'l Inst. of Standards and Technology, "Digital Signature Standard," FIPS Publication 186-2, Feb. 2000.
15. 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.
16. 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.
17. A. Reyhani-Masoleh, "Low Complexity and Fault Tolerant Arithmetic in Binary Extended Finite Fields," PhD thesis, Dept. of Electrical and Computer Eng., Univ. of Waterloo, Canada, May 2001.
18. A. Reyhani-Masoleh and M.A. Hasan, "On Efficient Normal Basis Multiplication," Proc. Indocrypt 2000, pp. 213-224, Dec. 2000.
19. 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.
20. m)," IEEE Trans. Computers, vol. 51, no. 5, pp. 511-520, May 2002.
21. J.E. Seguin, "Low Complexity Normal Bases," Discrete Applied Math., vol. 28, pp. 309-312, 1990.
22. N.P. Smart, "How Secure Are Elliptic Curves over Composite Extension Fields?" Proc. Eurocrypt 2001, pp. 30-39, 2001.
23. 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.
24. P.K.S. Wah and M.Z. Wang, "Realization and Application of the Massey-Omura Lock," Proc. IEEE Int'l Zurich Seminar Digital Comm., pp. 175-182, 1984.
25. m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709-716, Aug. 1985.