Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis

DOI10.1016/J.INS.2013.05.009zbMATH Open1336.94040OpenAlexW2057812890MaRDI QIDQ497571FDOQ497571

Authors: Sungmin Cho, Seog Chung Seo, Tae Hyun Kim, Young-Ho Park, Seokhie Hong 

Publication date: 24 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.05.009

Recommendations

• A secure and parallel Montgomery ladder algorithm of ECC
• Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
• Faster side-channel resistant elliptic curve scalar multiplication
• Fault-based attack on Montgomery's ladder algorithm
• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains

zbMATH Keywords

elliptic curvecomposite formulasMontgomery ladder algorithmside-channel atomicitysimple power analysis

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Cites Work

• Title not available (Why is that?)
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Title not available (Why is that?)
• Elliptic Curve Cryptosystems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Efficient arithmetic on Koblitz curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• Title not available (Why is that?)
• Trading inversions for multiplications in elliptic curve cryptography
• Title not available (Why is that?)
• Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
• Elliptic curve scalar multiplication with x-coordinate
• Title not available (Why is that?)
• Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic

Cited In (2)

• A secure and parallel Montgomery ladder algorithm of ECC
• Public Key Cryptography – PKC 2004

This page was built for publication: Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis

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