Information Security and Cryptology - ICISC 2005

DOI10.1007/11734727MaRDI QIDQ5899298zbMATHOpenAlexFDO

Authors Soonhak Kwon, Taekyoung Kwon, Young-Ho Park

Publication date 2 May 2007

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

Full work available at URL https://doi.org/10.1007/11734727

zbMATH Keywords

elliptic curve cryptographylinear multiplierNIST recommended binary fields

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Cryptographic Hardware and Embedded Systems - CHES 2004
• Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
• An area/performance trade-off analysis of a GF\((2^m)\) multiplier architecture for elliptic curve cryptography
• Two normal basis multiplication algorithms for GF(2n)
• Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)

Cited in

(3)

• Modified Serial Multipliers for Type-IV Gaussian Normal Bases
• A modified low complexity digit-level Gaussian normal basis multiplier
• Cryptographic Hardware and Embedded Systems - CHES 2004

This page was built for publication: Information Security and Cryptology - ICISC 2005

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