Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
From MaRDI portal
Publication:3701545
algorithmfactorizationfinite fieldspolynomialssquare roottheoryfieldFrobeniuscomputational numbernumber of points on elliptic curves over finite
Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Finite ground fields in algebraic geometry (14G15) Special algebraic curves and curves of low genus (14H45) Elliptic curves (14H52) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Software, source code, etc. for problems pertaining to field theory (12-04)
Recommendations
- Counting points on elliptic curves over finite fields
- Counting Points on Elliptic Curves Over F 2 m
- scientific article; zbMATH DE number 1273657
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
Cited in
(only showing first 100 items - show all)- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
- Diffie-Hellman Oracles
- Quantum algorithms for algebraic problems
- Computing Fourier Coefficients of Level One Modular Forms
- Factoring polynomials over special finite fields
- Modular equations for hyperelliptic curves
- On the product of small Elkies primes
- Computing zeta functions of algebraic curves using Harvey's trace formula
- Finding the group structure of elliptic curves over finite fields
- Remarks on the Schoof-Elkies-Atkin algorithm
- Pseudorandom vector generation using elliptic curves and applications to Wiener processes
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- Computational Number Theory and Cryptography
- Sato-Tate distributions
- On the representation of primes by binary quadratic forms
- Generating random factored Gaussian integers, easily
- Analysis of the fault attack ECDLP over prime field
- The Distribution of Lucas and Elliptic Pseudoprimes
- Rational isogenies from irrational endomorphisms
- Fast cryptography in genus 2
- Reprint of: Endomorphism rings of reductions of Drinfeld modules
- Weak instances of class group action based cryptography via self-pairings
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- Modular composition modulo triangular sets and applications
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
- Counting curves and their projections
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Representation of primes as the sums of two squares in the golden section quadratic field
- Plectic \(p\)-adic invariants
- Elliptic Gauss sums and applications to point counting
- Super-Golden-Gates for \(PU(2)\)
- Primality of the number of points on an elliptic curve over a finite field
- Computational Number Theory, Past, Present, and Future
- Improved complexity bounds for counting points on hyperelliptic curves
- Elliptic curve implementation of zero-knowledge blobs
- Counting points on elliptic curves over finite fields
- Counting points on curves and Abelian varieties over finite fields
- Counting points on hyperelliptic curves in average polynomial time
- Two kinds of division polynomials for twisted Edwards curves
- On division polynomial PIT and supersingularity
- A Recursive Method for Computing Zeta Functions of Varieties
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Algebraic curves and cryptography
- Counting points on smooth plane quartics
- On the representation of the number of integral points of an elliptic curve modulo a prime number
- A new generalization of the KMOV cryptosystem
- Nonlinearities in elliptic curve authentication
- Algorithms for black-box fields and their application to cryptography
- ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
- Deterministic encoding into twisted Edwards curves
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
- A generalized MSST algorithm for counting points of elliptic curves over \(\mathbb{F}_{p^n}\)
- Deterministic root finding over finite fields using Graeffe transforms
- Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves
- scientific article; zbMATH DE number 7559413 (Why is no real title available?)
- On the computation of square roots in finite fields
- Recent developments in primality proving
- The Pohlig-Hellman method generalized for group structure computation
- Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication
- An Algorithm for Modular Elliptic Curves over Real Quadratic Fields
- Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
- Zeta functions, one-way functions, and pseudorandom number generators.
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- Computations of Galois representations associated to modular forms of level one
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- The existence of infinitely many supersingular primes for every elliptic curve over \(\mathbb Q\).
- Endomorphism rings of reductions of Drinfeld modules
- \(L\)-functions of elliptic curves modulo integers
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- On splitting sets in block designs and finding roots of polynomials
- The Q-curve construction for endomorphism-accelerated elliptic curves
- Factoring polynomials over finite fields: A survey
- Factoring polynomials modulo special primes
- Taking cube roots in \(\mathbb Z_{m}\)
- An algorithm to compute the number of points on elliptic curves of j-invariant 0 or 1728 over a finite field
- On the existence and non-existence of elliptic pseudoprimes
- Computing zeta functions of arithmetic schemes
- Factoring polynomials and primitive elements for special primes
- Rigid cohomology and \(p\)-adic point counting
- Using zeta functions to factor polynomials over finite fields
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001
- Elliptic curve cryptosystems and their implementation
- Constructive and destructive facets of Weil descent on elliptic curves
- Group structure of elliptic curves over \(\mathbb{Z}/N\mathbb{Z}\)
- On elliptic curve $L$-functions integrated encryption scheme
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
- On the independence of Heegner points associated to distinct quadratic imaginary fields
- Computing rational cohomology and Hecke eigenvalues for Bianchi groups
- Point counting on reductions of CM elliptic curves
- Computing zeta functions of cyclic covers in large characteristic
- Finding the four squares in Lagrange's theorem
- Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
- A simple point counting algorithm for Hessian elliptic curves in characteristic three
- Some computational problems of cryptographic significance concerning elliptic curves over rings
This page was built for publication: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701545)
