Fast elliptic curve point counting using Gaussian normal basis

DOI10.1007/3-540-45455-1_24MaRDI QIDQ4737493zbMATH OpenFDO

Authors Hae-Young Kim, Jung Youl Park, Jung Hee Cheon, Je Hong Park, Jaeheon Kim, Sang Geun Hahn

Publication date 11 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/2369/23690292.htm

zbMATH Keywords

elliptic curveGaussian normal basisorder counting

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Elliptic curve point counting over finite fields with Gaussian normal basis
• Counting points on elliptic curves over finite fields of small characteristic in quasi quadratic time
• An extension of Satoh's algorithm and its implementation
• A memory efficient version of Satoh's algorithm
• A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2

Cited in

(8)

• Elliptic curve point counting over finite fields with Gaussian normal basis
• A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2
• Counting points on elliptic curves over finite fields of small characteristic in quasi quadratic time
• Some properties of classes of real self-reciprocal polynomials
• A generalized MSST algorithm for counting points of elliptic curves over \(\mathbb{F}_{p^n}\)
• A quasi quadratic time algorithm for hyperelliptic curve point counting
• Fast arithmetic in unramified \(p\)-adic fields
• Elliptic Gauss sums and applications to point counting

This page was built for publication: Fast elliptic curve point counting using Gaussian normal basis

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