A cyclic window algorithm for ECC defined over extension fields

DOI10.1007/3-540-45600-7_8MaRDI QIDQ4473573zbMATH OpenFDO

Authors Kazumaro Aoki, Fumitaka Hoshino, Tetsutaro Kobayashi

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2229/22290062.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Speeding up the computations of elliptic curves cryptoschemes
• Efficient algorithms for elliptic curve cryptosystems
• Efficient point multiplication for elliptic curves over special optimal extension fields
• scientific article; zbMATH DE number 2219248
• Fast multiplication on elliptic curves over GF(2ᵐ) without precomputation

Cited in

(1)

• Метод адаптивного «окна» операций в эллиптических кривых

This page was built for publication: A cyclic window algorithm for ECC defined over extension fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473573)