z-logo
open-access-imgOpen Access
Advances in Cryptology — ASIACRYPT’98
Author(s) -
Kazuo Ohta,
Dingyi Pei
Publication year - 1998
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/3-540-49649-1
Subject(s) - computer science , cryptography , theoretical computer science , algorithm
Elliptic curve cryptosystems, proposed by Koblitz ([12]) and Miller ([16]), can be constructed over a smaller field of definition than the ElGamal cryptosystems ([6]) or the RSA cryptosystems ([20]). This is why elliptic curve cryptosystems have begun to attract notice. In this paper, we investigate efficient elliptic curve exponentiation. We propose a new coordinate system and a new mixed coordinates strategy, which significantly improves on the number of basic operations needed for elliptic curve exponentiation.Advances in cryptology, ASIACRYPT '98 : International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, October 18-22, 1998 : proceedings / Kazuo Ohta, Dingyi Pei (eds.)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom