A new construction of Massey-Omura parallel multiplier over GF(2 m)

IEEE Transactions on Computers

Volumn 51, Issue 5, 2002, Pages 511-520

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

^a IEEE   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

All one polynomial; Finite field; Massey Omura multiplier; Optimal normal bases

Indexed keywords

ALL-ONE POLYNOMIAL; FINITE FIELD; MASSEY-OMURA PARALLEL MULTIPLIER; OPTIMAL NORMAL BASES;

COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; POLYNOMIALS; REDUNDANCY;

PARALLEL PROCESSING SYSTEMS;

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

References (27)

1. m)
2. Low complexity normal bases
3. m) yielding small complexity arithmetic circuits
4. k + 1
5. m) multiplication and division over the dual basis
6. Optimal normal bases
7. m)
8. Mastrovito multiplier for general irreducible polynomials
9. m)
10. A modified massey-omura parallel multiplier for a class of finite fields
11. A comparison of VLSI architectures of finite field multipliers using dual, normal or standard bases
12. m)
13. Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
14. m)
15. VLSI architectures for computation in galois fields
16. n)
17. A new architecture for a parallel finite field multiplier with low complexity based on composite fields
18. 4n)
19. m)
20. Mastrovito multiplier for all trinomials
21. m)
22. m)
23. Low complexity bit-parallel multipliers for a class of finite fields
24. New low-complexity bit-parallel finite field multipliers using weakly dual bases