A new class of irreducible pentanomials for polynomial-based multipliers in binary fields

Gustavo Banegas (Corresponding author), Ricardo Custódio, Daniel Panario

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
23 Downloads (Pure)

Abstract

We introduce a new class of irreducible pentanomials over F 2 of the form f(x) = x 2 b + c+ x b + c+ x b+ x c+ 1. Let m= 2 b+ c and use f to define the finite field extension of degree m. We give the exact number of operations required for computing the reduction modulo f. We also provide a multiplier based on Karatsuba algorithm in F 2[x] combined with our reduction process. We give the total cost of the multiplier and found that the bit-parallel multiplier defined by this new class of polynomials has improved XOR and AND complexity. Our multiplier has comparable time delay when compared to other multipliers based on Karatsuba algorithm.

Original languageEnglish
Pages (from-to)359–373
Number of pages15
JournalJournal of Cryptographic Engineering
Volume9
Issue number4
Early online date9 Nov 2018
DOIs
Publication statusPublished - 1 Nov 2019

Keywords

  • Finite fields
  • Irreducible pentanomials
  • Modular reduction
  • Polynomial multiplication

Fingerprint Dive into the research topics of 'A new class of irreducible pentanomials for polynomial-based multipliers in binary fields'. Together they form a unique fingerprint.

Cite this