Cited in
(91)- Introduction to cryptography with Maple
- Construction of metrics on the set of elliptic curves over a finite field
- Strong pseudoprimes to base 2
- On the singular values of Weber modular functions
- The complexity of class polynomial computation via floating point approximations
- Constructing hyperelliptic curves of genus 2 suitable for cryptography
- Knottedness is in NP, modulo GRH
- The structure factor of primes
- 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
- scientific article; zbMATH DE number 1263368 (Why is no real title available?)
- scientific article; zbMATH DE number 1186935 (Why is no real title available?)
- On the cyclicity of the rational points group of abelian varieties over finite fields
- Construction of CM Picard curves
- Constructing elliptic curves over finite fields using double eta-quotients
- Counting points on elliptic curves over finite fields
- Building Cyclic Elliptic Curves Modulo Large Primes
- Ramanujan's class invariants and their use in elliptic curve cryptography
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- An application of discrete algorithms in asymmetric cryptography
- Numerical and statistical analysis of aliquot sequences
- There are infinitely many Perrin pseudoprimes
- Checking the odd Goldbach conjecture up to 10²⁰
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- A variant of the large sieve inequality with explicit constants
- Elliptic periods and primality proving
- On counting and generating curves over small finite fields
- On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two
- Recent developments in primality proving
- 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\)
- Primality testing of large numbers in Maple
- Explicit elliptic units. I
- Generalised Weber functions
- Kronecker's and Newton's approaches to solving: a first comparison
- Generalized Repunit Primes
- Finding strong pseudoprimes to several bases
- Short effective intervals containing primes
- scientific article; zbMATH DE number 7310076 (Why is no real title available?)
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- LiDIA
- PARI/GP
- UBASIC
- Primo
- MPC
- GMP-ECM
- Echidna
- Polynomial generating pairing and its criterion for optimal pairing
- On the evaluation of singular invariants for canonical generators of certain genus one arithmetic groups
- ADSNARK
- Plutus
- SiRiUS
- genus3
- WhyMP
- A taxonomy of pairing-friendly elliptic curves
- A CM construction for curves of genus 2 with \(p\)-rank 1
- Factorization of the tenth Fermat number
- Class invariants by Shimura's reciprocity law
- On the efficient generation of prime-order elliptic curves
- A brief history of pairings
- Point counting on reductions of CM elliptic curves
- A strategy for elliptic curve primality proving
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Finding Suitable Curves for the Elliptic Curve Method of Factorization
- The Factorization of the Ninth Fermat Number
- scientific article; zbMATH DE number 7478711 (Why is no real title available?)
- Computing Hilbert class polynomials with the Chinese remainder theorem
- PariTwine
- 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
- Hidden multiscale order in the primes
- Compositeness test with nodal curves
- Scalable zero knowledge via cycles of elliptic curves
- On the heuristic of approximating polynomials over finite fields by random mappings
- Efficient CM-constructions of elliptic curves over finite fields
- Choosing the correct elliptic curve in the CM method
- Prime-number algorithm for public-key systems
- Elliptic Curves and Primality Proving
- scientific article; zbMATH DE number 65932 (Why is no real title available?)
- Computing the cardinality of CM elliptic curves using torsion points
- A framework for deterministic primality proving using elliptic curves with complex multiplication
- An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
- Odd prime values of the Ramanujan tau function
- Compression on the twisted Jacobi intersection
This page was built for software: ECPP
