ECPP

swMATH6903MaRDI QIDQ18970FDOQ18970

Author name not available (Why is that?)

Official website: http://www.lix.polytechnique.fr/~morain/Prgms/ecpp.english.html

Cited In (90)

• Strong pseudoprimes to base 2
• On the singular values of Weber modular functions
• Constructing hyperelliptic curves of genus 2 suitable for cryptography
• The complexity of class polynomial computation via floating point approximations
• The structure factor of primes
• Knottedness is in NP, modulo GRH
• Ranks of elliptic curves
• Arithmetic of the level four theta model of elliptic curves
• Modularity of Galois traces of class invariants
• Modular curves over number fields and ECM
• Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums
• Pairing-based cryptography on elliptic curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Construction of CM Picard curves
• On the cyclicity of the rational points group of abelian varieties over finite fields
• Constructing elliptic curves over finite fields using double eta-quotients
• Counting points on elliptic curves over finite fields
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Ramanujan's class invariants and their use in elliptic curve cryptography
• An application of discrete algorithms in asymmetric cryptography
• Checking the odd Goldbach conjecture up to 10²⁰
• There are infinitely many Perrin pseudoprimes
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• A variant of the large sieve inequality with explicit constants
• Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
• Elliptic periods and primality proving
• On counting and generating curves over small finite fields
• Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two
• Recent developments in primality proving
• Kronecker's and Newton's approaches to solving: a first comparison
• Primality testing of large numbers in Maple
• Generalized Repunit Primes
• Generalised Weber functions
• Explicit elliptic units. I
• Finding strong pseudoprimes to several bases
• Short effective intervals containing primes
• Constructing pairing-friendly hyperelliptic curves using Weil restriction
• Polynomial generating pairing and its criterion for optimal pairing
• Factorization of the tenth Fermat number
• A taxonomy of pairing-friendly elliptic curves
• A CM construction for curves of genus 2 with \(p\)-rank 1
• A brief history of pairings
• Class invariants by Shimura's reciprocity law
• LiDIA
• UBASIC
• Primo
• MPC
• GMP-ECM
• Echidna
• ADSNARK
• Plutus
• SiRiUS
• genus3
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• Finding Suitable Curves for the Elliptic Curve Method of Factorization
• Point counting on reductions of CM elliptic curves
• A strategy for elliptic curve primality proving
• The Factorization of the Ninth Fermat Number
• WhyMP
• Computing Hilbert class polynomials with the Chinese remainder theorem
• Fast group operations on elliptic curves in Maple
• Generalised Mersenne numbers revisited
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
• Efficient CM-constructions of elliptic curves over finite fields
• Scalable zero knowledge via cycles of elliptic curves
• Choosing the correct elliptic curve in the CM method
• Prime-number algorithm for public-key systems
• Title not available (Why is that?)
• Elliptic Curves and Primality Proving
• Computing the cardinality of CM elliptic curves using torsion points
• A framework for deterministic primality proving using elliptic curves with complex multiplication
• Odd prime values of the Ramanujan tau function
• Construction of metrics on the set of elliptic curves over a finite field
• PariTwine
• Building Cyclic Elliptic Curves Modulo Large Primes
• Numerical and statistical analysis of aliquot sequences
• On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
• Note on families of pairing-friendly elliptic curves with small embedding degree
• Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)
• Title not available (Why is that?)
• On the evaluation of singular invariants for canonical generators of certain genus one arithmetic groups
• On the efficient generation of prime-order elliptic curves
• Title not available (Why is that?)
• Hidden multiscale order in the primes
• Compositeness test with nodal curves
• On the heuristic of approximating polynomials over finite fields by random mappings
• An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
• Compression on the twisted Jacobi intersection
• Introduction to cryptography with Maple

This page was built for software: ECPP