ECPP
From MaRDI portal
Software:18970
swMATH6903MaRDI QIDQ18970FDOQ18970
Author name not available (Why is that?)
Cited In (78)
- 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?)
- A Brief History of Pairings
- 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
- Building Cyclic Elliptic Curves Modulo Large Primes
- 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
- Title not available (Why is that?)
- 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
- Class invariants by Shimura's reciprocity law
- 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
- 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
- On the heuristic of approximating polynomials over finite fields by random mappings
- 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
- On the Evaluation of Singular Invariants for Canonical Generators of Certain Genus One Arithmetic Groups
- 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\)
- On the efficient generation of prime-order elliptic curves
- Compression on the Twisted Jacobi Intersection
- Introduction to Cryptography with Maple
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$
- Title not available (Why is that?)
- Hidden multiscale order in the primes
- Compositeness test with nodal curves
- An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
- Numerical and Statistical Analysis of Aliquot Sequences
This page was built for software: ECPP