Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation

DOI10.1007/978-3-642-21969-6_11zbMath1280.94071OpenAlexW79711112MaRDI QIDQ3011912

Marc Joye, Yannick Sierra, Michael Hutter

Publication date: 29 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21969-6_11

zbMATH Keywords

elliptic curvesembedded systemspublic-key cryptographyMontgomery ladderco-\(Z\) coordinatesout-of-place formulæ

Mathematics Subject Classification ID

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

Related Items (2)

Online Template Attack on ECDSA: ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation

Uses Software

• EFD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Checking before output may not be enough against fault-based cryptanalysis
• Co-Z Addition Formulæ and Binary Ladders on Elliptic Curves
• A Computer Algorithm for Calculating the Product AB Modulo M
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• A method for obtaining digital signatures and public-key cryptosystems
• Elliptic-Curve-Based Security Processor for RFID
• Power Analysis Attacks
• New Point Addition Formulae for ECC Applications

This page was built for publication: Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation