Low complexity word-level sequential normal basis multipliers

IEEE Transactions on Computers

Volumn 54, Issue 2, 2005, Pages 98-110

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

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Finite field; Massey Omura multiplier; Optimal normal basis

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; CRYPTOGRAPHY; DIGITAL ARITHMETIC; LOGIC GATES; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

FINITE FIELD ARITHMETIC; MASSEY-OMURA MULTIPLIER; MULTIPLIERS; OPTIMAL NORMAL BASIS;

MULTIPLYING CIRCUITS;

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

References (31)

1. J.L. Massey and J.K. Omura, "Computational Method and Apparatus for Finite Field Arithmetic," US Patent No. 4,587,627, 1986.
2. m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709-716, Aug. 1985.
3. B. Sunar and Ç.K. Koç "An Efficient Optimal Normal Basis Type II Multiplier," IEEE Trans. Computers, vol. 50, no. 1, pp. 83-88, Jan. 2001.
4. m)," IEEE Trans. Computers, vol. 51, no. 5, pp. 511-520, May 2002.
5. E.R. Berlekamp, "Bit-Serial Reed-Solomon Encoders," IEEE Trans. Information Theory, vol. 28, no. 6, pp. 869-874, Nov. 1982.
6. 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.
7. E.D. Mastrovito, "VLSI Architectures for Computation in Galois Fields," PhD thesis, Linkoping Univ., Linkoping Sweden, 1991.
8. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. Cambridge Univ. Press, 1994.
9. IEEE Std 1363-2000, "IEEE Standard Specifications for Public-Key Cryptography," Jan. 2000.
10. n)," Discrete Applied Math., vol. 22, pp. 149-161, 1988/1989.
11. M) over Normal Bases," Proc. 13th Ann. IEEE Int'l ASIC/SOC Conf., pp. 97-101, 2000.
12. A. Reyhani-Masoleh and M.A. Hasan, "Efficient Digit-Serial Normal Basis Multipliers over GF(2m)," ACM Trans. Embedded Computing Systems (TECS), special issue on embedded systems and security, vol. 3, no. 3, pp. 575-592, Aug. 2004.
13. A. Reyhani-Masoleh and M.A. Hasan, "Efficient Multiplication beyond Optimal Normal Bases," IEEE Trans. Computers, special issue on cvryptographic hardware and embedded systems, vol. 52, no. 4, pp. 428-439, Apr. 2003.
14. T. Beth and D. Gollman, "Algorithm Engineering for Public Key Algorithms," IEEE J. Selected Areas in Comm., vol. 7, no. 4, pp. 458-465, May 1989.
15. W. Geiselmann and D. Gollmann, "Symmetry and Duality in Normal Basis Multiplication," Proc. Applied Algebra, Algebraic Algorithms, and Error Correcting Codes Symp. (AAECC-6), pp. 230-238, July 1988.
16. m)," IEEE Trans. Computers, vol. 38, no. 10, pp. 1383-1386, Oct. 1989.
17. Nat'l Inst. of Standards and Technology, Digital Signature Standard FIPS Publication 186-2, Jan. 2000.
18. D.W. Ash, I.F. Blake, and S.A. Vanstone, "Low Complexity Normal Bases," Discrete Applied Math., vol. 25, pp. 191-210, 1989.
19. B. Sunar, E. Savas, and C.K. Koc, "Constructing Composite Field Representations for Efficient Conversion," IEEE Trans. Computers, vol. 52, no. 11, pp. 1391-1398, Nov. 2003.
20. 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.
21. 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.
22. R.C. Mullin, "Multiple Bit Multiplier," US Patent No. 5,787,028, July 1998.
23. S.D. Galbraith and N.P. Smart, "A Cryptographic Application of Weil Descent," Proc. Seventh IMA Conf. Cryptography and Coding, pp. 191-200, 1999.
24. N.P. Smart, "How Secure Are Elliptic Curves over Composite Extension Fields?" Proc. Eurocrypt 2001, pp. 30-39, 2001.
25. 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," LMS J. Computation and Math., vol. 5, pp. 127-174, 2002.
26. 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.
27. m)," IEEE Trans. Computers, vol. 53, no. 8, pp. 945-959, Aug. 2004.
28. C. Paar, "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields," IEEE Trans. Computers, vol. 45, no. 7, pp. 856-861, July 1996.
29. Am. Bankers Assoc., X9.62 American National Standards Institute Standard, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1999.
30. 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.
31. m)," Proc. 16th IEEE Symp. Computer Arithmetic 2003, pp. 188-195 June 2003.