Pages that link to "Item:Q1093665"
From MaRDI portal
The following pages link to Factoring integers with elliptic curves (Q1093665):
Displaying 50 items.
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices (Q1999896) (← links)
- A new public key cryptosystem based on Edwards curves (Q2008069) (← links)
- On the representation of the number of integral points of an elliptic curve modulo a prime number (Q2017998) (← links)
- New number-theoretic cryptographic primitives (Q2023304) (← links)
- Factoring with hints (Q2027274) (← links)
- Strongly nonzero points and elliptic pseudoprimes (Q2037248) (← links)
- Faster cofactorization with ECM using mixed representations (Q2055704) (← links)
- Arithmetic statistics and noncommutative Iwasawa theory (Q2078499) (← links)
- Strong pseudoprimes to base 2 (Q2097530) (← links)
- Modular curves over number fields and ECM (Q2100579) (← links)
- Variations in the distribution of principally polarized abelian varieties among isogeny classes (Q2165699) (← links)
- On the elliptic curve \(y^2= x^3-2rDx\) and factoring integers (Q2254820) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- One-way permutations on elliptic curves (Q2277234) (← links)
- An improved parallel block Lanczos algorithm over GF(2) for integer factorization (Q2292923) (← links)
- Refined analysis to the extended tower number field sieve (Q2304549) (← links)
- Sieve algorithms for perfect power testing (Q2366224) (← links)
- Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization (Q2392056) (← links)
- Sums of Euler products and statistics of elliptic curves (Q2396237) (← links)
- Computing the endomorphism ring of an ordinary abelian surface over a finite field (Q2420398) (← links)
- Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field (Q2430982) (← links)
- Cryptanalysis of ISO/IEC 9796-1 (Q2482334) (← links)
- Constructing elliptic curves over finite fields using double eta-quotients (Q2483709) (← links)
- Index calculation attacks on RSA signature and encryption (Q2491257) (← links)
- On RSA moduli with prescribed bit patterns (Q2491291) (← links)
- On computing ord\(_{N}(2)\) and its application (Q2500476) (← links)
- Recovering Fourier coefficients of some functions and factorization of integer numbers (Q2513158) (← links)
- Some remarks on primality proving and elliptic curves (Q2513761) (← links)
- Smoothness testing of polynomials over finite fields (Q2513763) (← links)
- Arithmetic of the level four theta model of elliptic curves (Q2516923) (← links)
- Statistics about elliptic curves over finite prime fields (Q2518879) (← links)
- The distribution of class groups of function fields (Q2576930) (← links)
- Distribution of elliptic twin primes in isogeny and isomorphism classes (Q2637447) (← links)
- Sato-Tate, cyclicity, and divisibility statistics on average for elliptic curves of small height (Q2655761) (← links)
- Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting) (Q2693015) (← links)
- On oracle factoring of integers (Q2693692) (← links)
- Elliptic curve factorization using a ``partially oblivious'' function (Q2708616) (← links)
- Special prime numbers and discrete logs in finite prime fields (Q2759106) (← links)
- A Simple and Improved Algorithm for Integer Factorization with Implicit Hints (Q2790046) (← links)
- Quadratic sieving (Q2796022) (← links)
- Large-order multiple recursive generators with modulus \(2^{31}-1\) (Q2815474) (← links)
- A New Attack on Three Variants of the RSA Cryptosystem (Q2817817) (← links)
- Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli (Q2829209) (← links)
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
- On the Sato-Tate conjecture on average for some families of elliptic curves (Q2836449) (← links)
- Average Frobenius distribution for the degree two primes of a number field (Q2842341) (← links)
- An integer factoring algorithm based on elliptic divisibility sequences (Q2843204) (← links)
- An efficient deterministic test for Kloosterman sum zeros (Q2862534) (← links)
