A generalized MSST algorithm for counting points of elliptic curves over F_p^n
From MaRDI portal
Publication:6595058
Recommendations
- 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
- scientific article; zbMATH DE number 2086893
- A \(p\)-adic point counting algorithm for elliptic curves on Legendre form
- scientific article; zbMATH DE number 2009967
Cites work
- scientific article; zbMATH DE number 1808207 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1210367 (Why is no real title available?)
- scientific article; zbMATH DE number 2086893 (Why is no real title available?)
- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Counting points on elliptic curves over finite fields
- Elliptic Curve Cryptosystems
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Elliptic Curves and Primality Proving
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Integer multiplication in time \(O(n\log n)\)
- Multiplikation großer Zahlen
- New directions in cryptography
- The AGM-\(X_0(N)\) Heegner point lifting algorithm and elliptic curve point counting
- The canonical lift of an ordinary elliptic curve over a finite field and its point counting
This page was built for publication: A generalized MSST algorithm for counting points of elliptic curves over \(\mathbb{F}_{p^n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595058)
