Low complexity parallel multiplier in Fqn over Fq

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 49, Issue 7, 2002, Pages 1009-1013

  Wu, Huapeng ^a   Hasan, M Anwar ^a   Blake, Ian F ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Finite fields; Parallel multiplier; Weakly dual basis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

KNOCKER DELTA FUNCTION; PARALLEL MULTIPLIER; POLYNOMIAL BASIS; WEAKLY DUAL BASIS;

MULTIPLYING CIRCUITS;

EID: 0036647802     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2002.800836     Document Type: Article

References (11)

1. Development of fast multiplier structures with cryptographic applications
2. Bit-serial Reed-Solomon encoders
3. m) multiplication and division over the dual basis
4. m)
5. Computational method and apparatus for finite field arithmetic
6. VLSI architectures for computations in Galois fields
7. Efficient bit-serial multiplication and discrete-time Wiener-Hoph equation over finite fields
8. Efficient VLSI architectures for bit-parallel computation in Galois fields
9. Bit serial multiplication in finite fields
10. m)