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)- Constructing isogenies on extended Jacobi quartic curves
- Arithmetic progressions in certain subsets of finite fields
- Recovering Fourier coefficients of some functions and factorization of integer numbers
- Some remarks on primality proving and 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
- An algorithm to compute volcanoes of 2-isogenies of elliptic curves over finite fields
- Counting points on hyperelliptic curves of genus 2 with real models
- Interpolation of the Double Discrete Logarithm
- Division polynomials on the Hessian model of elliptic curves
- Finding elliptic curves with a subgroup of prescribed size
- Uniform encodings to elliptic curves and indistinguishable point representation
- Computing zeta functions of Artin-Schreier curves over finite fields. II
- Efficient CM-constructions of elliptic curves over finite fields
- Deterministic irreducibility testing of polynomials over large finite fields
- On the discrete logarithm problem in class groups of curves
- Algorithms in Algebraic Number Theory
- A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure
- Isogeny formulas for Jacobi intersection and twisted Hessian curves
- On the Number of Elliptic Pseudoprimes
- Computing the Brauer group of the product of two elliptic curves over a finite field
- Fault-based attack on Montgomery's ladder algorithm
- Realistic analysis of some randomized algorithms
- The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace
- Computing isogenies from modular equations in genus two
- Elliptic Curves and Primality Proving
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- Fast computation of special resultants
- Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields
- The arithmetic geometry of resonant Rossby wave triads
- The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
- Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology
- Circles and squares modulo \(p\)
- On the analogue of the division polynomials for hyperelliptic curves.
- Frobenius elements in Galois representations with \(\mathrm{SL}_{n}\) image
- Satoh's algorithm in characteristic 2
- Injective encodings to binary ordinary elliptic curves
- One-way permutations on elliptic curves
- \(\ell\)-adic images of Galois for elliptic curves over \(\mathbb{Q}\)(and an appendix with John Voight)
- Computing \(L\)-polynomials of Picard curves from Cartier-Manin matrices
- Cryptographic pairings based on elliptic nets
- \(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
- 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?)
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)
