Information Security and Cryptology - ICISC 2005

DOI10.1007/11734727zbMATH Open1185.94056OpenAlexW2493058093MaRDI QIDQ5899298FDOQ5899298

Taekyoung Kwon, Young-Ho Park, Soonhak Kwon

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

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)\)

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)

Cited In (2)

• Modified Serial Multipliers for Type-IV Gaussian Normal Bases
• 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)