An alternative class of irreducible polynomials for optimal extension fields

DOI10.1007/s10623-010-9424-6zbMath1246.12004OpenAlexW2004202980MaRDI QIDQ543428

Yin Li, Gong-Liang Chen, Jian Hua Li

Publication date: 17 June 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-010-9424-6

zbMATH Keywords

cryptographyelliptic curveirreducible polynomialmodular multiplicationoptimal extension fields

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20) Special polynomials in general fields (12E10)

Cites Work

• Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
• Elliptic Curve Cryptosystems
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An alternative class of irreducible polynomials for optimal extension fields