A Technique to Speed up the Modular Multiplicative Inversion over GF(P) Applicable to Elliptic Curve Cryptography
نویسندگان
چکیده
منابع مشابه
Platform Independent Elliptic Curve Cryptography over
Elliptic curve cryptography has long since moved into several wellknown standards like IEEE’s 1363, SEC and X9.62. With its small key sizes it is just right for many crypto applications, in particular for mobile computing and communication devices. To make ECC easily available for all these different applications, a highly efficient and platformindependent implementation of ECC is necessary. Th...
متن کاملTwisting an elliptic curve to speed up cryptographic algorithms
An elliptic curve y = x +ax+ b over the prime field Fp may be twisted by a change of variables into the curve y = x + a′x + b′, where a′ differs from a by a quartic residue. We show that most curves over Fp may be twisted to have a′ quite small, allowing one of the multiplications in the point doubling formula to be replaced by additions. This speeds up algorithms to solve the elliptic curve di...
متن کاملHigh-speed hardware implementations of Elliptic Curve Cryptography: A survey
For the last decade, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in the industry and the academic community and has been the subject of several standards. This interest is mainly due to the high level of security with relatively small keys provided by ECC. To sustain the high throughput required by applications like network servers, highspeed implementations of public-key...
متن کاملAn Introduction to Elliptic Curve Cryptography
After the discovery that secure encryption (of, for instance, a client’s confidential data at a bank) does not require previous contact (if the client wanted to join online without first coming in person), several algorithms were proposed to protect our communications. A beautiful example combines tools from Number Theory, Group Theory, and Planar Algebraic Geometry. In this talk we’ll explore ...
متن کاملAffine Precomputation with Sole Inversion in Elliptic Curve Cryptography
This paper presents a new approach to precompute all odd points [3]P, [5]P, . . . , [2k− 1]P , k ≥ 2 on an elliptic curve over Fp. Those points are required for the efficient evaluation of a scalar multiplication, the most important operation in elliptic curve cryptography. The proposed method precomputes the points in affine coordinates and needs only one single field inversion for the computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/7273-0412