Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Elliptic curves in cryptography
Elliptic curves in cryptography
Optimal Left-to-Right Binary Signed-Digit Recoding
IEEE Transactions on Computers - Special issue on computer arithmetic
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
More Flexible Exponentiation with Precomputation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
ISC '01 Proceedings of the 4th International Conference on Information Security
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
New Minimal Modified Radix-r Representation with Applications to Smart Cards
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Hardware Implementation of Finite Fields of Characteristic Three
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Left-to-Right Optimal Signed-Binary Representation of a Pair of Integers
IEEE Transactions on Computers
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Efficient GF(pm) arithmetic architectures for cryptographic applications
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
A note on the signed sliding window integer recoding and a left-to-right analogue
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Implementing cryptographic pairings on smartcards
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Efficient tate pairing computation for elliptic curves over binary fields
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
New minimal weight representations for left-to-right window methods
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Flexible exponentiation with resistance to side channel attacks
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Improving the randomized initial point countermeasure against DPA
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
SPA resistant left-to-right integer recodings
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
The advantages of elliptic curve cryptography for wireless security
IEEE Wireless Communications
| Hi-index | 0.00 |
This paper presents two recoding methods for a radix-r representation of a secret scalar which are resistant to SPA. These recoding methods are left-to-right so they can be interleaved with a left-to-right scalar multiplication, removing the need to store both a scalar and its recoding. Next, we show the ideas of left-to-right recoding for a radix-r representation lead to simplified recoding methods for a binary representation. In general our proposed algorithms asymptotically require additional (w + 1)-digit and w-bit of RAM in the case of width-w radix-r representation and a special case when r = 2, respectively, which is independent from the digit (bit) size n of the scalar and considerably reduces the required space comparing with previous methods which require n-digit (bit) of RAM additional memory to store the recoded scalar. Consequently, thanks to its left-to-right nature, the scalar multiplication based on it is by far more convenient with respect to memory consumption.