Development of Fast Multiplier Structures with Cryptographic Applications

DOI10.1007/978-1-4615-2694-0_1MaRDI QIDQ4857223zbMATH OpenOpenAlexFDO

Authors G. B. Agnew

Publication date 26 November 1995

Published in Communications and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4615-2694-0_1

zbMATH Keywords

high-speed multiplier structuresoptimal normal bases

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
• scientific article; zbMATH DE number 2080690
• Efficient hardware implementation of elliptic curve cryptosystems
• scientific article; zbMATH DE number 922659
• scientific article; zbMATH DE number 2118995

Cited in

(2)

• Designing efficient dyadic operations for cryptographic applications
• Fast Computation of Large Distributions and Its Cryptographic Applications

This page was built for publication: Development of Fast Multiplier Structures with Cryptographic Applications

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