Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs

DOI10.1007/978-3-642-33027-8_29zbMath1294.94071OpenAlexW124286720MaRDI QIDQ4649794

Chester Rebeiro, Sujoy Sinha Roy, Debdeep Mukhopadhyay

Publication date: 13 November 2012

Published in: Cryptographic Hardware and Embedded Systems – CHES 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33027-8_29

zbMATH Keywords

FPGAMontgomery ladderElliptic curve scalar multiplicationhigh-speed implementation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (1)

Secure Message Authentication Against Related-Key Attack

This page was built for publication: Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs