Computing Short Lucas Chains for Elliptic Curve Cryptosystems
Summary :
Elliptic curves Em: By2 = x3+Ax2+x are suitable for cryptographic use because fast addition operations can be defined over Em. In elliptic curve cryptosystems, encryption/decryption involves multiplying a point P on Em by a large integer n. In this paper, we propose a fast algorithm for computing such scalar multiplication over Em. The new algorithm requires fewer operations than previously proposed algorithms. As a result, elliptic curve cryptosystems based on Em can be speeded up by using the new algorithm.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.5 pp.1227-1233
- Publication Date
- 2001/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yukio TSURUOKA, "Computing Short Lucas Chains for Elliptic Curve Cryptosystems" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 5, pp. 1227-1233, May 2001, doi: .
Abstract: Elliptic curves Em: By2 = x3+Ax2+x are suitable for cryptographic use because fast addition operations can be defined over Em. In elliptic curve cryptosystems, encryption/decryption involves multiplying a point P on Em by a large integer n. In this paper, we propose a fast algorithm for computing such scalar multiplication over Em. The new algorithm requires fewer operations than previously proposed algorithms. As a result, elliptic curve cryptosystems based on Em can be speeded up by using the new algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_5_1227/_p
Copy
@ARTICLE{e84-a_5_1227,
author={Yukio TSURUOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computing Short Lucas Chains for Elliptic Curve Cryptosystems},
year={2001},
volume={E84-A},
number={5},
pages={1227-1233},
abstract={Elliptic curves Em: By2 = x3+Ax2+x are suitable for cryptographic use because fast addition operations can be defined over Em. In elliptic curve cryptosystems, encryption/decryption involves multiplying a point P on Em by a large integer n. In this paper, we propose a fast algorithm for computing such scalar multiplication over Em. The new algorithm requires fewer operations than previously proposed algorithms. As a result, elliptic curve cryptosystems based on Em can be speeded up by using the new algorithm.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Computing Short Lucas Chains for Elliptic Curve Cryptosystems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1227
EP - 1233
AU - Yukio TSURUOKA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2001
AB - Elliptic curves Em: By2 = x3+Ax2+x are suitable for cryptographic use because fast addition operations can be defined over Em. In elliptic curve cryptosystems, encryption/decryption involves multiplying a point P on Em by a large integer n. In this paper, we propose a fast algorithm for computing such scalar multiplication over Em. The new algorithm requires fewer operations than previously proposed algorithms. As a result, elliptic curve cryptosystems based on Em can be speeded up by using the new algorithm.
ER -
English
