Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)

M.A. Hasan; M. Wang; V.K. Bhargava

doi:10.1109/12.156539

Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)

IEEE Transactions on Computers ◽

10.1109/12.156539 ◽

1992 ◽

Vol 41 (8) ◽

pp. 962-971 ◽

Cited By ~ 91

Author(s):

M.A. Hasan ◽

M. Wang ◽

V.K. Bhargava

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Modular Construction

Download Full-text

Low-complexity modified Mastrovito multipliers over finite fields GF(2/sup M/)

ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349) ◽

10.1109/iscas.1999.777940 ◽

2003 ◽

Cited By ~ 1

Author(s):

Leilei Song ◽

K.K. Parhi

Keyword(s):

Finite Fields ◽

Low Complexity

Download Full-text

Low Complexity Normal Elements over Finite Fields of Characteristic Two

IEEE Transactions on Computers ◽

10.1109/tc.2007.70845 ◽

2008 ◽

Vol 57 (7) ◽

pp. 990-1001 ◽

Cited By ~ 4

Author(s):

Ariane M. Masuda ◽

Lucia Moura ◽

Daniel Panario ◽

David Thomson

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Characteristic Two

Download Full-text

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

IEEE Transactions on Computers ◽

10.1109/12.660172 ◽

1998 ◽

Vol 47 (3) ◽

pp. 353-356 ◽

Cited By ~ 139

Author(s):

C.K. Koc ◽

B. Sunar

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Normal Basis

Download Full-text

Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields

Information and Communications Security - Lecture Notes in Computer Science ◽

10.1007/3-540-36159-6_18 ◽

2002 ◽

pp. 209-216 ◽

Cited By ~ 1

Author(s):

Soonhak Kwon

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Bit Serial

Download Full-text

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) ◽

10.1109/isit.1998.708899 ◽

2002 ◽

Author(s):

C.K. Koc ◽

B. Sunar

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Normal Basis

Download Full-text

A New Low Complexity Parallel Multiplier for a Class of Finite Fields

Cryptographic Hardware and Embedded Systems — CHES 2001 - Lecture Notes in Computer Science ◽

10.1007/3-540-44709-1_15 ◽

2001 ◽

pp. 160-170 ◽

Cited By ~ 11

Author(s):

Manuel Leone

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Parallel Multiplier

Download Full-text

Reconfigurable and Low-Complexity Accelerator for Convolutional and Generative Networks over Finite Fields

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ◽

10.1109/tcad.2020.2973355 ◽

2020 ◽

pp. 1-1 ◽

Cited By ~ 1

Author(s):

Weihong Xu ◽

Zaichen Zhang ◽

Xiaohu You ◽

Chuan Zhang

Keyword(s):

Finite Fields ◽

Low Complexity

Download Full-text

Low complexity bit-parallel multipliers for a class of finite fields

IEEE Transactions on Computers ◽

10.1109/12.707588 ◽

1998 ◽

Vol 47 (8) ◽

pp. 883-887 ◽

Cited By ~ 42

Author(s):

Huapeng Wu ◽

M.A. Hasan

Keyword(s):

Finite Fields ◽

Low Complexity

Download Full-text

On the arithmetic operations over finite fields of characteristic three with low complexity

Journal of Computational and Applied Mathematics ◽

10.1016/j.cam.2013.08.011 ◽

2014 ◽

Vol 259 ◽

pp. 546-554 ◽

Cited By ~ 2

Author(s):

S. Akleylek ◽

F. Özbudak ◽

C. Özel

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Arithmetic Operations

Download Full-text

Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields

2006 International Conference on Communications, Circuits and Systems ◽

10.1109/icccas.2006.285197 ◽

2006 ◽

Cited By ~ 10

Author(s):

Huapeng Wu

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Parallel Multiplier

Download Full-text