A secure and parallel Montgomery ladder algorithm of ECC
From MaRDI portal
Publication:2886853
zbMATH Open1249.94044MaRDI QIDQ2886853FDOQ2886853
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)
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
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cited In (9)
- An Integrated ECC-MAC Based on RS Code
- A new encoding algorithm for a multidimensional version of the Montgomery ladder
- Title not available (Why is that?)
- Protecting the most significant bits in scalar multiplication algorithms
- Secure and compact elliptic curve LR scalar multiplication
- Title not available (Why is that?)
- Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
- Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
- 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)
