Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
From MaRDI portal
Publication:3701545
DOI10.2307/2007968zbMATH Open0579.14025OpenAlexW4242424230MaRDI QIDQ3701545FDOQ3701545
Authors: René Schoof 
Publication date: 1985
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2007968
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
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)
Cited In (only showing first 100 items - show all)
- On the product of small Elkies primes
- Remarks on the Schoof-Elkies-Atkin algorithm
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- On the representation of primes by binary quadratic forms
- Analysis of the fault attack ECDLP over prime field
- Fast cryptography in genus 2
- Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
- Modular composition modulo triangular sets and applications
- Plectic \(p\)-adic invariants
- Computational Number Theory, Past, Present, and Future
- Counting curves and their projections
- Elliptic Gauss sums and applications to point counting
- Super-Golden-Gates for \(PU(2)\)
- Counting points on curves and Abelian varieties over finite fields
- Primality of the number of points on an elliptic curve over a finite field
- Counting points on elliptic curves over finite fields
- Elliptic curve implementation of zero-knowledge blobs
- Counting points on hyperelliptic curves in average polynomial time
- Algebraic curves and cryptography
- A Recursive Method for Computing Zeta Functions of Varieties
- On division polynomial PIT and supersingularity
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Two kinds of division polynomials for twisted Edwards curves
- Counting points on smooth plane quartics
- Algorithms for black-box fields and their application to cryptography
- A new generalization of the KMOV cryptosystem
- Nonlinearities in elliptic curve authentication
- Deterministic root finding over finite fields using Graeffe transforms
- Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves
- An Algorithm for Modular Elliptic Curves over Real Quadratic Fields
- On the computation of square roots in finite fields
- Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- Zeta functions, one-way functions, and pseudorandom number generators.
- Computations of Galois representations associated to modular forms of level one
- 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\).
- Factoring polynomials over finite fields: A survey
- 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 \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
- Factoring polynomials modulo special primes
- Computing zeta functions of arithmetic schemes
- Taking cube roots in \(\mathbb Z_{m}\)
- Rigid cohomology and \(p\)-adic point counting
- Factoring polynomials and primitive elements for special primes
- 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
- 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
- Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\)
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- A generic approach to searching for Jacobians
- Modular Polynomials for Genus 2
- Counting points on hyperelliptic curves of genus 2 with real models
- An algorithm to compute volcanoes of 2-isogenies of elliptic curves over finite fields
- Interpolation of the Double Discrete Logarithm
- Uniform encodings to elliptic curves and indistinguishable point representation
- Computing zeta functions of Artin-Schreier curves over finite fields. II
- Algorithms in Algebraic Number Theory
- On the discrete logarithm problem in class groups of curves
- On the Number of Elliptic Pseudoprimes
- Fault-based attack on Montgomery's ladder algorithm
- The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace
- Elliptic Curves and Primality Proving
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- Fast computation of special resultants
- The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
- Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields
- On the analogue of the division polynomials for hyperelliptic curves.
- Satoh's algorithm in characteristic 2
- Injective encodings to binary ordinary elliptic curves
- One-way permutations on elliptic curves
- Diffie-Hellman Oracles
- Factoring polynomials over special finite fields
- \(p\)-adic properties of division polynomials and elliptic divisibility sequences
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
- Modular equations for hyperelliptic curves
- Quantum algorithms for algebraic problems
- Finding the group structure of elliptic curves over finite fields
- Computing zeta functions of algebraic curves using Harvey's trace formula
- Computational Number Theory and Cryptography
- Pseudorandom vector generation using elliptic curves and applications to Wiener processes
- Sato-Tate distributions
- Generating random factored Gaussian integers, easily
- Weak instances of class group action based cryptography via self-pairings
- Rational isogenies from irrational endomorphisms
- The Distribution of Lucas and Elliptic Pseudoprimes
- Reprint of: Endomorphism rings of reductions of Drinfeld modules
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- Representation of primes as the sums of two squares in the golden section quadratic field
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Improved complexity bounds for counting points on hyperelliptic curves
- On the representation of the number of integral points of an elliptic curve modulo a prime number
- A generalized MSST algorithm for counting points of elliptic curves over \(\mathbb{F}_{p^n}\)
- ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
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)
