A secure and parallel Montgomery ladder algorithm of ECC

MaRDI QIDQ2886853zbMATH OpenFDO

Authors Ping Zuo, Shichun Pang, Hongtu Hua, Shunchuan Gao, Shoudong Chen

Publication date 1 June 2012

Published in Journal of Jilin University. Science Edition (Search for Journal in Brave)

zbMATH Keywords

side channel attackMontgomery ladder algorithmelliptic curve scalar multiplication

Mathematics Subject Classification ID

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

Recommendations

• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• scientific article; zbMATH DE number 2085437
• Faster side-channel resistant elliptic curve scalar multiplication
• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
• scientific article; zbMATH DE number 1979291

Cited in

(9)

• An Integrated ECC-MAC Based on RS Code
• A new encoding algorithm for a multidimensional version of the Montgomery ladder
• scientific article; zbMATH DE number 1979291 (Why is no real title available?)
• Protecting the most significant bits in scalar multiplication algorithms
• Secure and compact elliptic curve LR scalar multiplication
• scientific article; zbMATH DE number 1878328 (Why is no real title available?)
• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
• Information Security and Cryptology

This page was built for publication: A secure and parallel Montgomery ladder algorithm of ECC

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