Type-II optimal polynomial bases

DOI10.1007/978-3-642-13797-6_4zbMATH Open1230.12001OpenAlexW1492069598MaRDI QIDQ3578464FDOQ3578464

Authors Daniel J. Bernstein, Tanja Lange

Publication date 20 July 2010

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13797-6_4

zbMATH Keywords

transformationpolynomial basiselliptic-curve cryptographyoptimal normal basis ONB

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Mathematical problems of computer architecture (68M07)

Recommendations

• Efficient Multiplication Using Type 2 Optimal Normal Bases
• Two normal basis multiplication algorithms for GF(2n)
• scientific article; zbMATH DE number 1941247
• Optimal normal bases in \(GF(p^ n)\)
• An efficient optimal normal basis type II multiplier

Cited in

(3)

• Complexity of computation in finite fields
• On a family of preimage-resistant functions
• Efficient Multiplication Using Type 2 Optimal Normal Bases

This page was built for publication: Type-II optimal polynomial bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578464)