Protecting the most significant bits in scalar multiplication algorithms

DOI10.1007/978-3-031-22829-2_7zbMath1530.94018MaRDI QIDQ6112010

Estuardo Alpirez Bock, Łukasz Chmielewski, Konstantina Miteloudi

Publication date: 4 August 2023

Published in: Security, Privacy, and Applied Cryptography Engineering (Search for Journal in Brave)

zbMATH Keywords

side-channel analysisMontgomery ladderCurve25519ECCcomplete addition formulas

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
• Attacking embedded ECC implementations through CMOV side channels
• CSIDH: an efficient post-quantum commutative group action
• Complete systems of two addition laws for elliptic curves
• Location, location, location: revisiting modeling and exploitation for location-based side channel leakages
• Complete Addition Formulas for Prime Order Elliptic Curves
• Online Template Attacks
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• High-Speed High-Security Signatures
• Zero-Value Point Attacks on Elliptic Curve Cryptosystem
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Public Key Cryptography - PKC 2006

This page was built for publication: Protecting the most significant bits in scalar multiplication algorithms