The search functionality is under construction.

The search functionality is under construction.

A fast method for computing a multiple *mP* for a point *P* on elliptic curves is proposed. This new method is based on optimal addition sequences and the Frobenius map. The new method can be effectively applied to elliptic curves *E*(**F**_{qn}), where *q* is a prime power of medium size (e.g., *q**mP* over curves *E*(**F**_{qn}) with *q*^{n} of nearly 160-bits and 11*q*

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.1 pp.114-119

- Publication Date
- 2001/01/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)

- Category

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.

Copy

Yukio TSURUOKA, Kenji KOYAMA, "Fast Computation over Elliptic Curves E(Fqn) Based on Optimal Addition Sequences" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 1, pp. 114-119, January 2001, doi: .

Abstract: A fast method for computing a multiple *mP* for a point *P* on elliptic curves is proposed. This new method is based on optimal addition sequences and the Frobenius map. The new method can be effectively applied to elliptic curves *E*(**F**_{qn}), where *q* is a prime power of medium size (e.g., *q**mP* over curves *E*(**F**_{qn}) with *q*^{n} of nearly 160-bits and 11*q*

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_1_114/_p

Copy

@ARTICLE{e84-a_1_114,

author={Yukio TSURUOKA, Kenji KOYAMA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Fast Computation over Elliptic Curves E(Fqn) Based on Optimal Addition Sequences},

year={2001},

volume={E84-A},

number={1},

pages={114-119},

abstract={A fast method for computing a multiple *mP* for a point *P* on elliptic curves is proposed. This new method is based on optimal addition sequences and the Frobenius map. The new method can be effectively applied to elliptic curves *E*(**F**_{qn}), where *q* is a prime power of medium size (e.g., *q**mP* over curves *E*(**F**_{qn}) with *q*^{n} of nearly 160-bits and 11*q*

keywords={},

doi={},

ISSN={},

month={January},}

Copy

TY - JOUR

TI - Fast Computation over Elliptic Curves E(Fqn) Based on Optimal Addition Sequences

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 114

EP - 119

AU - Yukio TSURUOKA

AU - Kenji KOYAMA

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E84-A

IS - 1

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - January 2001

AB - A fast method for computing a multiple *mP* for a point *P* on elliptic curves is proposed. This new method is based on optimal addition sequences and the Frobenius map. The new method can be effectively applied to elliptic curves *E*(**F**_{qn}), where *q* is a prime power of medium size (e.g., *q**mP* over curves *E*(**F**_{qn}) with *q*^{n} of nearly 160-bits and 11*q*

ER -