Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Checking Before Output May Not Be Enough Against Fault-Based Cryptanalysis
IEEE Transactions on Computers
Handbook of Applied Cryptography
Handbook of Applied Cryptography
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Fast Implementation of Elliptic Curve Arithmetic in GF(pn)
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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
Dual-Field Arithmetic Unit for GF(p) and GF(2m)
CHES '02 Revised Papers from the 4th 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
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Comments on "A Computer Algorithm for Calculating the Product AB Modulo M"
IEEE Transactions on Computers
A Computer Algorithm for Calculating the Product AB Modulo M
IEEE Transactions on Computers
New Point Addition Formulae for ECC Applications
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Elliptic-Curve-Based Security Processor for RFID
IEEE Transactions on Computers
Fault Attack on Elliptic Curve Montgomery Ladder Implementation
FDTC '08 Proceedings of the 2008 5th Workshop on Fault Diagnosis and Tolerance in Cryptography
Securing the Elliptic Curve Montgomery Ladder against Fault Attacks
FDTC '09 Proceedings of the 2009 Workshop on Fault Diagnosis and Tolerance in Cryptography
Fast point multiplication on elliptic curves through isogenies
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
A compact architecture for montgomery elliptic curve scalar multiplication processor
WISA'07 Proceedings of the 8th international conference on Information security applications
Co-Z addition formulæ and binary ladders on elliptic curves
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Atomicity improvement for elliptic curve scalar multiplication
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
Elliptic curve cryptography on the WISP UHF RFID tag
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Evaluating 16-bit processors for elliptic curve cryptography
CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Exploring the design space of prime field vs. binary field ECC-Hardware implementations
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Low-Cost countermeasure against RPA
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
An 8-bit AVR-Based Elliptic Curve Cryptographic RISC Processor for the Internet of Things
MICROW '12 Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture Workshops
Low-energy encryption for medical devices: security adds an extra design dimension
Proceedings of the 50th Annual Design Automation Conference
Hardware architectures for MSP430-based wireless sensor nodes performing elliptic curve cryptography
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.02 |
It has been recently shown that sharing a common coordinate in elliptic curve cryptography implementations improves the performance of scalar multiplication. This paper presents new formulæ for elliptic curves over prime fields that provide efficient point addition and doubling using the Montgomery ladder. All computations are performed in a common projective Z-coordinate representation to reduce the memory requirements of low-resource implementations. In addition, all given formulæ make only use of out-of-place operations therefore insuring that it requires no additional memory for any implementation of the underlying finite-field operations whatsoever. Our results outperform existing solutions in terms of memory and speed and allow a fast and secure implementation suitable for low-resource devices and embedded systems.