A new architecture for a parallel finite field multiplier with low complexity based on composite fields

IEEE Transactions on Computers

Volumn 45, Issue 7, 1996, Pages 856-861

  Paar, Christof ^a  

^a Worcester Polytechnic Institute   (United States)

Author keywords

Bit parallel multiplication; Composite fields; Finite field multiplication; Karatsuba Ofman algorithm; Polynomial multiplication; Primitive polynomials; VLSI architecture

Indexed keywords

EID: 0000620374     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.508323     Document Type: Article

References (17)

1. A. Odlyzko, "Discrete Logarithms in Finite Fields and Their Cryptographic Significance," Lecture Notes in Computer Science 209, pp. 224-316. Berlin: Springer-Verlag, 1984.
2. R. Blahut, Theory and Practice of Error Control Codes. Reading, Mass.: Addison-Wesley, 1983.
3. m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709-717, Aug. 1985.
4. k)," Information and Computers, vol. 83, pp. 21-40, 1989.
5. m)," Lecture Notes in Computer Science 357, pp. 297-309. Berlin: Springer-Verlag, Mar. 1989.
6. m)," IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992.
7. V. Afanasyev, "Complexity of VLSI Implementation of Finite Field Arithmetic," Proc. II. Int'l Workshop Algebraic and Combinatorial Coding Theory, pp. 6-7, Leningrad, USSR, Sept. 1990.
8. V. Afanasyev, "On the Complexity of Finite Field Arithmetic," Proc. Fifth Joint Soviet-Swedish Int'l. Workshop Information Theory, pp. 9-12, Moscow, USSR, Jan. 1991.
9. A. Pincin, "A New Algorithm for Multiplication in Finite Fields," IEEE Trans. Computers, vol. 38, no. 7, pp. 1,045-1,049, July 1989.
10. D. Green and I. Taylor, "Irreducible Polynomials over Composite Galois Fields and Their Applications in Coding Techniques," Proc. IEE, vol. 121, pp. 935-939, Sept. 1974.
11. m)," IEEE Trans. Information Theory, vol. 39, pp. 643-647, Mar. 1993.
12. A. Karatsuba and Y. Ofman, "Multiplication of Multidigit Numbers on Automata," Sov. Phys.-Dokl. (Engl. transl.), vol. 7, no. 7, pp. 595-596, 1963.
13. D. Knuth, The Art of Computer Programming. Volume 2: Seminumerical Algorithms, second edition. Reading, Mass.: Addison-Wesley, 1981.
14. E. Mastrovito, "VLSI Architectures for Computation in Galois Fields," PhD thesis, Linköping Univ., Dept. of Electrical Eng., Linköping, Sweden, 1991.
15. R. Fateman, "Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments," SIAM J. Computing, vol. 7, pp. 196-21, Sept. 1974.
16. C. Paar, "Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields," PhD thesis, (English translation), Inst. for Experimental Mathematics, Univ. of Essen, Essen, Germany, June 1994.
17. 16) on a Digital Signal Processor with External Arithmetic Unit," Proc. Fourth Int'l ESA Workshop Digital Signal Processing Techniques Applied to Space Comm., King's College, London, Sept. 26-28 1994.