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 ◽

Author(s):

Manuel Leone

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Parallel Multiplier

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 ◽

Author(s):

Huapeng Wu

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Parallel Multiplier

Download Full-text

A Low Complexity Bit-Parallel Multiplier over Finite Fields with ONBs

The Journal of the Korea institute of electronic communication sciences ◽

10.13067/jkiecs.2014.9.4.409 ◽

2014 ◽

Vol 9 (4) ◽

pp. 409-416

Author(s):

Yong-Tae Kim

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Parallel Multiplier

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 ◽

Author(s):

Leilei Song ◽

K.K. Parhi

Keyword(s):

Finite Fields ◽

Download Full-text

Low complexity parallel multiplier in F(q/sup n/) over F/sub q/

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

10.1109/tcsi.2002.800836 ◽

2002 ◽

Vol 49 (7) ◽

pp. 1009-1013 ◽

Author(s):

Huapeng Wu ◽

M. Anwar Hasan ◽

I.F. Blake

Keyword(s):

Low Complexity ◽

Parallel Multiplier

Download Full-text

Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation

IEEE Transactions on Computers ◽

10.1109/tc.2005.199 ◽

2005 ◽

Vol 54 (12) ◽

pp. 1628-1630 ◽

Author(s):

Ku-Young Chang ◽

Dowon Hong ◽

Hyun-Sook Cho

Keyword(s):

Low Complexity ◽

Parallel Multiplier ◽

Redundant Representation

Download Full-text

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 ◽

Author(s):

M.A. Hasan ◽

M. Wang ◽

V.K. Bhargava

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Modular Construction

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 ◽

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 ◽

Author(s):

C.K. Koc ◽

B. Sunar

Keyword(s):

Finite Fields ◽

Low Complexity ◽

Download Full-text

Design of High-Speed Parallel Multiplier with All Coefficients 1's of Primitive Polynomial over Finite Fields GF(2m)

Journal of the Korea Society of Computer and Information ◽

10.9708/jksci.2013.18.2.009 ◽

2013 ◽

Vol 18 (2) ◽

pp. 9-17

Author(s):

Hyeon-Kyeong Seong

Keyword(s):

Finite Fields ◽

Primitive Polynomial ◽

Parallel Multiplier

Download Full-text

Design of High-Speed Parallel Multiplier on Finite Fields GF(pm)

The Journal of Korean Institute of Information Technology ◽

10.14801/jkiit.2016.14.5.17 ◽

2016 ◽

Vol 14 (5) ◽

pp. 17

Author(s):

Hyeon-Kyeong Seong

Keyword(s):

Finite Fields ◽

Parallel Multiplier

Download Full-text