A generalized MSST algorithm for counting points of elliptic curves over F_p^n

DOI10.1007/S11424-024-2452-5zbMATH Open1546.94089MaRDI QIDQ6595058FDOQ6595058

Authors: Xiao Li, Chang Lv, Zhizhong Pan 

Publication date: 29 August 2024

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

zbMATH Keywords

elliptic curvegeneralized AGM algorithmgeneralized MSST algorithmSST algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Title not available (Why is that?)
• Elliptic Curve Cryptosystems
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Multiplikation großer Zahlen
• Title not available (Why is that?)
• Counting points on elliptic curves over finite fields
• The canonical lift of an ordinary elliptic curve over a finite field and its point counting
• Elliptic Curves and Primality Proving
• Title not available (Why is that?)
• Fast computation of canonical lifts of elliptic curves and its application to point counting.
• Title not available (Why is that?)
• The AGM-\(X_0(N)\) Heegner point lifting algorithm and elliptic curve point counting
• Integer multiplication in time \(O(n\log n)\)
• A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2

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)