On efficient normal basis multiplication

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

Volumn 1977, Issue , 2000, Pages 213-224

  Reyhani Masoleh, A ^a   Hasana, M A ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIT-LEVEL OPERATIONS; CRYPTOGRAPHIC APPLICATIONS; CRYPTOGRAPHIC FUNCTIONS; CRYPTOGRAPHIC SYSTEMS; FIELD OPERATION; HARDWARE IMPLEMENTATIONS; MULTIPLICATION ALGORITHMS; SPACE COMPLEXITY;

CRYPTOGRAPHY;

EID: 1642340631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44495-5_19     Document Type: Conference Paper

References (11)

1. 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, vol. 42, no. 10, pp. 1278–1280, Oct. 1993. 213, 213, 215, 219, 219
2. C. K. Koc and B. Sunar, “Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields,” IEEE Transactions on Computers, vol. 47, no. 3, pp. 353–356, March 1998. 219, 219
3. Chung-Chin Lu, “A Search of Minimal Key Functions for Normal Basis Multipliers,” IEEE Transactions on Computers, vol. 46, no. 5, pp. 588–592, May 1997. 213, 222
4. S. D. Galbraith and N. P. Smart, “A Cryptographic Application of Weil Descent,” in Proceedings of Cryptography and Coding, LNCS 1764, pp. 191–200, Springer-Verlag, 1999. 220
5. J. L. Massey and J. K. Omura, “Computational Method and Apparatus for Finite Field Arithmetic,” US Patent No. 4,587,627, 1986. 213
6. 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. 218
7. R. C. Mullin, I. M. Onyszchuk, S. A. Vanstone, and R. M. Wilson, “Optimal normal bases in GF(pn),” Discrete Applied Mathematics, vol. 22, pp. 149–161, 1988. 213, 213, 215, 218, 222
8. A. Reyhani-Masoleh and M. A. Hasan, “A Reduced Redundancy Massey-Omura Parallel Multiplier over GF(2m),” in Proceedings of the 20th Biennial Symposium on Communications, pp. 308–312, Kingston, Ontario, Canada, May 2000. 213, 213, 217, 217, 217, 217, 217, 219, 219, 223, 223
9. J. E. Seguin, “Low complexity normal bases,” Discrete Applied Mathematics, vol. 28, pp. 309–312, 1990. 220
10. P. K. S. Wah and M. Z. Wang, “Realization and application of the Massey-Omura lock,” Presented at the IEEE Int. Zurich Seminar on Digital Communications, pp. 175–182, 1984. 213, 213, 218
11. C. C. Wang, T. K. Truong, H. M. Shao, L. J. Deutsch, J. K. Omura and I. S. Reed, “VLSI Architectures for Computing Multiplications and Inverses in GF(2m),” IEEE Transactions on Computers, vol. 34, no. 8, pp. 709–716, Aug. 1985. 213, 217, 217, 217, 219, 219, 223, 223