Efficient elliptic curve scalar multiplication algorithms resistant to power analysis

DOI10.1016/j.ins.2006.12.016zbMath1111.94013OpenAlexW2052012720MaRDI QIDQ881859

N. E. Zubov

Publication date: 18 May 2007

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

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

zbMATH Keywords

cryptographyelliptic curve cryptosystemsscalar multiplicationpower analysishighest-weight binary form

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

First-order side channel attacks on Zhang's countermeasures ⋮ A novel elliptic curve scalar multiplication algorithm against power analysis ⋮ All-in-one group-oriented cryptosystem based on bilinear pairing ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulatability and security of certificateless threshold signatures
• Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
• Zero-Value Point Attacks on Elliptic Curve Cryptosystem
• Information and Communications Security
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Elliptic Curve Cryptosystems
• A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
• The Doubling Attack – Why Upwards Is Better than Downwards
• An Analysis of Goubin’s Refined Power Analysis Attack
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Information Security and Privacy

This page was built for publication: Efficient elliptic curve scalar multiplication algorithms resistant to power analysis