Advances in Applied Mathematics
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Checking Before Output May Not Be Enough Against Fault-Based Cryptanalysis
IEEE Transactions on Computers
A Countermeasure against One Physical Cryptanalysis May Benefit Another Attack
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Differential Fault Attacks on Elliptic Curve Cryptosystems
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Weierstraß Elliptic Curves and Side-Channel Attacks
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
The Montgomery Powering Ladder
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
New Point Addition Formulae for ECC Applications
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Fault Attack on Elliptic Curve Montgomery Ladder Implementation
FDTC '08 Proceedings of the 2008 5th Workshop on Fault Diagnosis and Tolerance in Cryptography
Novel Precomputation Schemes for Elliptic Curve Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate representation
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Efficient precomputation schemes of kP+lQ
Information Processing Letters
Elliptic curve cryptography on the WISP UHF RFID tag
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Low-Cost countermeasure against RPA
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
Fault attacks on projective-to-affine coordinates conversion
COSADE'13 Proceedings of the 4th international conference on Constructive Side-Channel Analysis and Secure Design
| Hi-index | 0.01 |
Meloni recently introduced a new type of arithmetic on elliptic curves when adding projective points sharing the same Z-coordinate. This paper presents further co-Z addition formulß for various point additions on Weierstraß elliptic curves. It explains how the use of conjugate point addition and other implementation tricks allow one to develop efficient scalar multiplication algorithms making use of co-Z arithmetic. Specifically, this paper describes efficient co-Z based versions of Montgomery ladder and Joye's double-add algorithm. Further, the resulting implementations are protected against a large variety of implementation attacks.