Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
From MaRDI portal
Publication:497571
DOI10.1016/J.INS.2013.05.009zbMath1336.94040OpenAlexW2057812890MaRDI QIDQ497571
Seog Chung Seo, Sung Min Cho, 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
elliptic curvecomposite formulasMontgomery ladder algorithmside-channel atomicitysimple power analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient arithmetic on Koblitz curves
- Trading inversions for multiplications in elliptic curve cryptography
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
- Elliptic curve scalar multiplication with x-coordinate
- Elliptic Curve Cryptosystems
- Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
This page was built for publication: Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis