Two efficient algorithms for arithmetic of elliptic curves using Frobenius map

DOI10.1007/BFB0054025MaRDI QIDQ3840094zbMATH OpenFDO

Authors Jung Hee Cheon, Sung Mo Park, Dae Ho Kim, Sang Woo Park

Publication date 29 June 1999

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

Full work available at URL https://doi.org/10.1007/BFB0054025

zbMATH Keywords

cryptographyelliptic curvesFrobenius mapmultiplication on elliptic curves

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Cryptography (94A60)

Review text

In this paper the authors look at the technique of applying the Frobenius map to speed up point multiplication on elliptic curves defined over a small finite field but whose group of points is defined over a larger finite field. This is a standard technique dating back to Koblitz's original work in the area. The authors look at a \(k\)-ary and window version of the standard Frobenius expansion method. The interested reader should also consult the article by \textit{V. Müller} [J. Cryptology 11, No. 4, 219-234 (1998)] which contains implementation details and timings of various Frobenius expansion based methods. For the entire collection see [Zbl 0892.00053].

Recommendations

• scientific article; zbMATH DE number 2085439
• Efficient arithmetic on Koblitz curves
• scientific article; zbMATH DE number 1950618

Cited in

(4)

• New fast algorithms for elliptic curve arithmetic in affine coordinates
• scientific article; zbMATH DE number 2085439 (Why is no real title available?)
• scientific article; zbMATH DE number 1950618 (Why is no real title available?)
• Power of Frobenius endomorphism and its performance on pseudoTNAF system

This page was built for publication: Two efficient algorithms for arithmetic of elliptic curves using Frobenius map

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