A new addition formula for elliptic curves over GF(2/sup n/)
Tóm tắt
We propose an addition formula in projective coordinates for elliptic curves over GF(2/sup n/). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.
Từ khóa
#Elliptic curves #Galois fields #Elliptic curve cryptography #Arithmetic #Security #Licenses #Differential equationsTài liệu tham khảo
l�pez, 1999, Fast Multiplication on Elliptic Curves over without Precomputation, Proc Cryptographic Hardware and Embedded SystemsCHES '99, 316, 10.1007/3-540-48059-5_27
2001, Standard Specifications for Public Key Cryptography
2001
10.1017/CBO9781107360211
schroeppel, 1995, Fast Key Exchange with Elliptic Curve Systems, Advances in Cryptology - Crypto '95, 43, 10.1007/3-540-44750-4_4
de win, 1996, A Fast Software Implementation for Arithmetic Operations in, Advances in Cryptology Proc Asiacrypt '96, 65, 10.1007/BFb0034836
weimerskirch, 2001, Elliptic Curve Cryptography on a Palm OS Device, Proc Sixth Australasian Conf Information Security and Privacy (ACISP 2001), 502
10.1109/SCCC.1998.730787
10.1023/A:1008306223194
knudsen, 1999, Elliptic Scalar Multiplication Using Point Halving, Proc Advances in CryptologyAsiacrypt '99, 135
l�pez, 1998, Improved Algorithms for Elliptic Curve Arithmetic in, Proc Selected Areas in CryptographySAC '98, 201
hankerson, 2000, Software Implementation of Elliptic Curve Cryptography over Binary Fields, Proc Cryptographic Hardware and Embedded SystemsCHES 2000, 1, 10.1007/3-540-44499-8_1