Low complexity bit-parallel polynomial basis multipliers over binary fields for special irreducible pentanomials

Integration ◽

10.1016/j.vlsi.2011.12.006 ◽

2013 ◽

Vol 46 (2) ◽

pp. 197-210 ◽

Author(s):

José L. Imaña ◽

Román Hermida ◽

Francisco Tirado

Keyword(s):

Low Complexity ◽

Polynomial Basis ◽

Download Full-text

A low complexity bit parallel polynomial basis systolic multiplier for general irreducible polynomials and trinomials

Microelectronics Journal ◽

10.1016/j.mejo.2021.105163 ◽

2021 ◽

pp. 105163

Author(s):

Sakshi Devi ◽

Rita Mahajan ◽

Deepak Bagai

Keyword(s):

Low Complexity ◽

Polynomial Basis ◽

Irreducible Polynomials ◽

Systolic Multiplier

Download Full-text

Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)

IEEE Transactions on Computers ◽

10.1109/tc.2004.47 ◽

2004 ◽

Vol 53 (8) ◽

pp. 945-959 ◽

Author(s):

A. Reyhani-Masoleh ◽

M.A. Hasan

Keyword(s):

Low Complexity ◽

Parallel Architectures ◽

Polynomial Basis

Download Full-text

Multiplexer implementation of low-complexity polynomial basis multiplier in using all one polynomial

Information Processing Letters ◽

10.1016/j.ipl.2011.08.004 ◽

2011 ◽

Vol 111 (21-22) ◽

pp. 1044-1047 ◽

Author(s):

Che Wun Chiou ◽

Chiou-Yng Lee ◽

Yun-Chi Yeh

Keyword(s):

Low Complexity ◽

Polynomial Basis

Download Full-text

Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis

IEEE Transactions on Computers ◽

10.1109/tc.2011.37 ◽

2011 ◽

Author(s):

Omran Ahmadi ◽

Francisco Rodriguez Henriquez

Keyword(s):

Low Complexity ◽

Polynomial Basis ◽

Download Full-text

Low-complexity bit-serial sequential polynomial basis finite field GF(2m) Montgomery multipliers

Microprocessors and Microsystems ◽

10.1016/j.micpro.2021.104053 ◽

2021 ◽

Vol 84 ◽

pp. 104053

Author(s):

Siva Ramakrishna Pillutla ◽

Lakshmi Boppana

Keyword(s):

Finite Field ◽

Low Complexity ◽

Polynomial Basis ◽

Download Full-text

Low complexity design of bit parallel polynomial basis systolic multiplier using irreducible polynomials

Egyptian Informatics Journal ◽

10.1016/j.eij.2021.07.003 ◽

2021 ◽

Author(s):

Sakshi Devi ◽

Rita Mahajan ◽

Deepak Bagai

Keyword(s):

Low Complexity ◽

Polynomial Basis ◽

Irreducible Polynomials ◽

Systolic Multiplier

Download Full-text

Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis

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

10.1007/3-540-48059-5_24 ◽

1999 ◽

pp. 280-291 ◽

Author(s):

Huapeng Wu

Keyword(s):

Finite Field ◽

Low Complexity ◽

Polynomial Basis ◽

Finite Field Arithmetic

Download Full-text

On Low Complexity Bit Parallel Polynomial Basis Multipliers

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

10.1007/978-3-540-45238-6_16 ◽

2003 ◽

pp. 189-202 ◽

Author(s):

Arash Reyhani-Masoleh ◽

M. Anwar Hasan

Keyword(s):

Low Complexity ◽

Polynomial Basis

Download Full-text

Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis

IEEE Transactions on Computers ◽

10.1109/tc.2009.183 ◽

2010 ◽

Vol 59 (10) ◽

pp. 1297-1308 ◽

Author(s):

O Ahmadi ◽

F R Henríquez

Keyword(s):

Low Complexity ◽

Polynomial Basis ◽

Download Full-text

Low-complexity synthesis of incompletely specified multiple-output mod-2 sums

IEE Proceedings E Computers and Digital Techniques ◽

10.1049/ip-e.1992.0051 ◽

1992 ◽

Vol 139 (4) ◽

pp. 355 ◽

Author(s):

M.W. Riege ◽

Ph.W. Besslich

Keyword(s):

Download Full-text