Fast normal basis multiplication using general purpose processors

DOI10.1007/3-540-45537-X_18MaRDI QIDQ4736435zbMATH OpenFDO

Authors Arash Reyhani-Masoleh, M. Anwar Hasan

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2259/22590230.htm

zbMATH Keywords

composite fieldsECDSAFinite field multiplicationnormal basissoftware algorithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Two normal basis multiplication algorithms for GF(2n)
• A new algorithm for multiplication in finite fields
• Optimal normal bases in \(GF(p^ n)\)
• Efficient normal basis multipliers in composite fields
• Efficient software-implementation of finite fields with applications to cryptography

Cited in

(3)

• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
• On a family of preimage-resistant functions
• Two normal basis multiplication algorithms for GF(2n)

This page was built for publication: Fast normal basis multiplication using general purpose processors

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