A dual basis bit-serial systolic multiplier for GF(2m)
References (18)
Theory and Practice of Error Control Codes
(1983)- et al.
New directions in cryptography
IEEE Trans. Inform. Theory
(1978) - et al.
A method for obtaining digital signatures and public-key cryptosystems
Comm. ACM
(1978) Bit-serial Reed-Solomon Encoders
IEEE Trans. Inform. Theory
(1982)- J.L. Masseyo and J.K. Omura, Computational method and apparatus for finite field arithmetic. U.S. Patent Application,...
- et al.
A fast VLSI multiplier for GF(2m)
IEEE J. Sel. Areas Comms.
(1986) - et al.
Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)
IEEE Trans. Comput.
(1992) - et al.
Efficient bit-serial multiplication and the discrete-time Wiener-Hopft equation over finite fields
IEEE Trans. Inform. Theory
(1989) - et al.
Bit-serial systolic divider and multiplier for finite fields GF(2m)
IEEE Trans. Comput.
(1992)
There are more references available in the full text version of this article.
Cited by (11)
Low-complexity systolic array structure for field multiplication in resource-constrained IoT nodes
2023, Ain Shams Engineering JournalLow-space bit-serial systolic array architecture for interleaved multiplication over GF(2<sup>m</sup>)
2021, IET Computers and Digital TechniquesCompact Bit-Parallel Systolic Multiplier Over GF(2<sup>m</sup>)
2021, IEEE Canadian Journal of Electrical and Computer EngineeringLow-latency digit-serial systolic double basis multiplier over GF(2 <sup>m</sup>) using subquadratic toeplitz matrix-vector product approach
2014, IEEE Transactions on ComputersVLSI architecture for bit parallel systolic multipliers for special class of GF(2 <sup>m</sup>) using dual bases
2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1995 Published by Elsevier B.V.