Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A survey of fast exponentiation methods
Journal of Algorithms
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Fast Elliptic Curve Multiplications with SIMD Operations
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th 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
Elliptic Curve Arithmetic Using SIMD
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
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
Hessian Elliptic Curves and Side-Channel Attacks
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity
IEEE Transactions on Computers
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems (Extended Version)
IEEE Transactions on Computers
Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
IEEE Transactions on Computers
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
| Hi-index | 0.00 |
To secure parallel systems in communication networks, in this paper, we propose a fast and scalable parallel scalar multiplication method over generic elliptic curves for elliptic curve cryptosystems, by means of our proposed scalar folding and unfolding techniques. In contrast to previous parallel scalar multiplication methods, our method can be implemented into scalable parallel computers. The optimal time complexity is k point doublings (D) plus log k point additions (A), denoted as kD + (log k)A, where k is the bit length of the scalar. If our method is applied to Koblitz curves, the optimal time complexity can be reduced to (log k)A. Furthermore, previous simple side-channel-protected scalar multiplication methods can be integrated into our method for resisting against simple side-channel attacks. Copyright © 2012 John Wiley & Sons, Ltd.