Advances in Applied Mathematics
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
Software Implementation of the NIST Elliptic Curves Over Prime Fields
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
ElectroMagnetic Analysis (EMA): Measures and Counter-Measures for Smart Cards
E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
CRYPTO '96 Proceedings of the 16th 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
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
ISC '01 Proceedings of the 4th International Conference on Information Security
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
Preventing SPA/DPA in ECC Systems Using the Jacobi Form
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
The Hessian Form of an Elliptic Curve
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Electromagnetic Analysis: Concrete Results
CHES '01 Proceedings of the Third 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
Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity
IEEE Transactions on Computers
Faults, Injection Methods, and Fault Attacks
IEEE Design & Test
Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
IEEE Transactions on Computers
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Fast Point Multiplication on Elliptic Curves without Precomputation
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
APCIP '09 Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02
Distinguishing Multiplications from Squaring Operations
Selected Areas in Cryptography
Delaying and merging operations in scalar multiplication: applications to curve-based cryptosystems
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
The Jacobi model of an elliptic curve and side-channel analysis
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
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
Faster addition and doubling on elliptic curves
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Coordinate blinding over large prime fields
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Efficient and secure elliptic curve point multiplication using double-base chains
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Using templates to distinguish multiplications from squaring operations
International Journal of Information Security
Energy-efficient software implementation of long integer modular arithmetic
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Curve25519: new diffie-hellman speed records
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
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
SPA resistant left-to-right integer recodings
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
In this paper we improve the safety aspects of previously published atomic blocks. We build new sets of atomic blocks designed to protect against both simple side-channel attacks and C-safe fault attacks for scalar multiplication for elliptic curves over prime fields. These atomic blocks are structured with the sequence of field operations (S,N, A, A, M, A), Squaring, Negation, Addition, Addition, Multiplication, Addition. We apply these atomic blocks to various operations in Jacobian coordinates: doubling, tripling, and quintupling, as well as mixed Jacobian-affine addition. We also give formulae for the general Jacobian addition for use in right-to-left scalar multiplication. Finally, we show how these techniques can be used to unify the Jacobian doubling formula with mixed Jacobian-affine addition, so they use the same number of atomic blocks. Like previous atomic blocks formulae, our group operations provide protection against simple side channel attacks by dividing the group operations into smaller sequences of field operations. One of the main differences with our formulae resides in their security against C-safe fault attacks. Unlike previous works, our formulae are designed to completely fill the atomic blocks with field operations that affect the final output (i.e. we avoid "dummy" operations) and are all distinct (none of the operations are repeated). They also have the added bonus of being slightly more "compact" than most previous atomic blocks, having fewer additions/negations for each multiplication/squaring, potentially giving a performance gain.