Pages that link to "Item:Q3137447"
From MaRDI portal
The following pages link to Elliptic Curves and Primality Proving (Q3137447):
Displaying 50 items.
- Modularity of Galois traces of class invariants (Q422376) (← links)
- Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
- Improvements to RSA key generation and CRT on embedded devices (Q826302) (← links)
- A strategy for elliptic curve primality proving (Q907001) (← links)
- Computing the cardinality of CM elliptic curves using torsion points (Q933164) (← links)
- Ramanujan's class invariants and their use in elliptic curve cryptography (Q988264) (← links)
- Point counting on reductions of CM elliptic curves (Q1035582) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- Recent developments in primality proving (Q1297591) (← links)
- Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums (Q1358795) (← links)
- Explicit elliptic units. I (Q1376022) (← links)
- Pairing-based cryptography on elliptic curves (Q1616164) (← links)
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Towards practical key exchange from ordinary isogeny graphs (Q1710681) (← links)
- An elliptic curve analogue to the Fermat numbers (Q1731032) (← links)
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two (Q1751377) (← links)
- Fast group operations on elliptic curves in Maple (Q1806495) (← links)
- Prime-number algorithm for public-key systems (Q1816016) (← links)
- Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 (Q1826275) (← links)
- On counting and generating curves over small finite fields (Q1827569) (← links)
- Short effective intervals containing primes (Q1869779) (← links)
- Primality testing of large numbers in Maple (Q1903747) (← links)
- Counting points on elliptic curves over finite fields (Q1909875) (← links)
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
- On the representation of the number of integral points of an elliptic curve modulo a prime number (Q2017998) (← links)
- A variant of the large sieve inequality with explicit constants (Q2023311) (← links)
- Strong pseudoprimes to base 2 (Q2097530) (← links)
- Modular curves over number fields and ECM (Q2100579) (← links)
- On a conjecture of Yui and Zagier (Q2212119) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field (Q2430982) (← links)
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method (Q2430983) (← links)
- A CM construction for curves of genus 2 with \(p\)-rank 1 (Q2430990) (← links)
- Constructing pairing-friendly hyperelliptic curves using Weil restriction (Q2430992) (← links)
- Knottedness is in NP, modulo GRH (Q2445896) (← links)
- Constructing elliptic curves over finite fields using double eta-quotients (Q2483709) (← links)
- Some remarks on primality proving and elliptic curves (Q2513761) (← links)
- An exploration of Nathanson's \(g\)-adic representations of integers (Q2692973) (← links)
- Finding strong pseudoprimes to several bases (Q2701572) (← links)
- A framework for deterministic primality proving using elliptic curves with complex multiplication (Q2792372) (← links)
- Generalised Weber functions (Q2875425) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Computing Hilbert class polynomials with the Chinese remainder theorem (Q3081296) (← links)
- Note on families of pairing-friendly elliptic curves with small embedding degree (Q3121464) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- Ranks of elliptic curves (Q3148678) (← links)
- Compositeness test with nodal curves (Q3174870) (← links)
