Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
Factoring integers using SIMD sieves
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Elliptic curve cryptography on smart cards without coprocessors
Proceedings of the fourth working conference on smart card research and advanced applications on Smart card research and advanced applications
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
SAC '98 Proceedings of the Selected Areas in Cryptography
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
CRYPTO '92 Proceedings of the 12th 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
Selecting Cryptographic Key Sizes
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Hessian Form of an Elliptic Curve
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
A Fast New DES Implementation in Software
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
IDEA: A Cipher For Multimedia Architectures?
SAC '98 Proceedings of the Selected Areas in Cryptography
Fast Key Exchange with Elliptic Curve Systems
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Cyclic Window Algorithm for ECC Defined over Extension Fields
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Fast Elliptic Curve Multiplications with SIMD Operations
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Parallel Cryptographic Arithmetic Using a Redundant Montgomery Representation
IEEE Transactions on Computers
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems (Extended Version)
IEEE Transactions on Computers
Fast and scalable parallel processing of scalar multiplication in elliptic curve cryptosystems
Security and Communication Networks
| Hi-index | 0.01 |
Focusing on servers that process many signatures or ciphertexts, this paper proposes two techniques for parallel computing with SIMD, which significantly enhances the speed of elliptic curve scalar multiplication. We also evaluate one of them based on a real implementation on a Pentium III, which incorporates the SIMD architecture. The results show that the proposed method is about 4.4 times faster than the conventional method.