Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
From MaRDI portal
(Redirected from Publication:3701545)
algorithmcomputational numberfactorizationfieldfinite fieldsFrobeniusnumber of points on elliptic curves over finitepolynomialssquare roottheory
Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Finite ground fields in algebraic geometry (14G15) Special algebraic curves and curves of low genus (14H45) Elliptic curves (14H52) Analysis of algorithms and problem complexity (68Q25)
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)- Point counting on reductions of CM elliptic curves
- Primality of the number of points on an elliptic curve over a finite field
- The existence of infinitely many supersingular primes for every elliptic curve over \(\mathbb Q\).
- Factoring polynomials and primitive elements for special primes
- Elliptic curve implementation of zero-knowledge blobs
- Computing rational cohomology and Hecke eigenvalues for Bianchi groups
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
- Recent developments in primality proving
- The Pohlig-Hellman method generalized for group structure computation
- Elliptic curve cryptosystems and their implementation
- An algorithm to compute the number of points on elliptic curves of j-invariant 0 or 1728 over a finite field
- Zeta functions, one-way functions, and pseudorandom number generators.
- Circles and squares modulo \(p\)
- Constructive and destructive facets of Weil descent on elliptic curves
- Taking cube roots in \(\mathbb Z_{m}\)
- On division polynomial PIT and supersingularity
- Super-Golden-Gates for PU(2)
- Frobenius elements in Galois representations with \(\mathrm{SL}_{n}\) image
- Injective encodings to binary ordinary elliptic curves
- \(p\)-adic properties of division polynomials and elliptic divisibility sequences
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Deterministic irreducibility testing of polynomials over large finite fields
- Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001
- Computing zeta functions of Artin-Schreier curves over finite fields. II
- Some computational problems of cryptographic significance concerning elliptic curves over rings
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- On the computation of square roots in finite fields
- Counting points on elliptic curves over finite fields
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- On the representation of the number of integral points of an elliptic curve modulo a prime number
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
- Reprint of: Endomorphism rings of reductions of Drinfeld modules
- Computing zeta functions of algebraic curves using Harvey's trace formula
- Counting points on smooth plane quartics
- Pseudorandom vector generation using elliptic curves and applications to Wiener processes
- Rational isogenies from irrational endomorphisms
- Plectic \(p\)-adic invariants
- Isogeny formulas for Jacobi intersection and twisted Hessian curves
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Realistic analysis of some randomized algorithms
- One-way permutations on elliptic curves
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Endomorphism rings of reductions of Drinfeld modules
- Rigid cohomology and \(p\)-adic point counting
- Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields
- Improved complexity bounds for counting points on hyperelliptic curves
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- A simple point counting algorithm for Hessian elliptic curves in characteristic three
- Counting points on hyperelliptic curves in average polynomial time
- Fast computation of special resultants
- On the independence of Heegner points associated to distinct quadratic imaginary fields
- An algorithm to compute volcanoes of 2-isogenies of elliptic curves over finite fields
- Recovering Fourier coefficients of some functions and factorization of integer numbers
- Some remarks on primality proving and elliptic curves
- The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace
- Division polynomials on the Hessian model of elliptic curves
- Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields
- ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
- Fast cryptography in genus 2
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves
- Deterministic encoding into twisted Edwards curves
- Computations of Galois representations associated to modular forms of level one
- Computational Number Theory and Cryptography
- Nonlinearities in elliptic curve authentication
- Constructing isogenies on extended Jacobi quartic curves
- Deterministic root finding over finite fields using Graeffe transforms
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- A generic approach to searching for Jacobians
- Quantum algorithms for algebraic problems
- On the discrete logarithm problem in class groups of curves
- Modular Polynomials for Genus 2
- Cryptographic pairings based on elliptic nets
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- Counting points on hyperelliptic curves of genus 2 with real models
- Elliptic Curves and Primality Proving
- Using partial smoothness of p-1 for factoring polynomials modulo p
- Finding elliptic curves with a subgroup of prescribed size
- The Q-curve construction for endomorphism-accelerated elliptic curves
- Sato-Tate distributions
- Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
- A Recursive Method for Computing Zeta Functions of Varieties
- Generating random factored Gaussian integers, easily
- Diffie-Hellman Oracles
- Algorithms for black-box fields and their application to cryptography
- Computing zeta functions of arithmetic schemes
- Interpolation of the Double Discrete Logarithm
- On the existence and non-existence of elliptic pseudoprimes
- Efficient CM-constructions of elliptic curves over finite fields
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
- Modular composition modulo triangular sets and applications
- On the Number of Elliptic Pseudoprimes
- The Distribution of Lucas and Elliptic Pseudoprimes
- Algorithms in Algebraic Number Theory
- Analysis of the fault attack ECDLP over prime field
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- On the analogue of the division polynomials for hyperelliptic curves.
- Two kinds of division polynomials for twisted Edwards curves
- Remarks on the Schoof-Elkies-Atkin 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)
