Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Optimal Left-to-Right Binary Signed-Digit Recoding
IEEE Transactions on Computers - Special issue on computer arithmetic
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
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
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
ISC '01 Proceedings of the 4th International Conference on Information Security
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
Hessian Elliptic Curves and Side-Channel Attacks
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Protections against Differential Analysis for Elliptic Curve Cryptography
CHES '01 Proceedings of the Third 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 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
Countermeasures for preventing comb method against SCA attacks
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Flexible exponentiation with resistance to side channel attacks
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
DPA attack on the improved ha-moon algorithm
WISA'05 Proceedings of the 6th international conference on Information Security Applications
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 |
Vuillaume-Okeya presented unsigned recoding methods for protecting modular exponentiations against side channel attacks, which are suitable for tamper-resistant implementations of RSA or DSA which does not benefit from cheap inversions. This paper describes new recoding methods for producing SPA-resistant unsigned representations which are scanned from left to right (i.e., from the most significant digit to the least significant digit) contrary to the previous ones. Our contributions are as follows; (1) SPAresistant unsigned left-to-right recoding with general width-w, (2) special case when w = 1, i.e., unsigned binary representation using the digit set {1, 2}. These methods reduce the memory required to perform the modular exponentiation gk.