Pages that link to "Item:Q1093665"
From MaRDI portal
The following pages link to Factoring integers with elliptic curves (Q1093665):
Displaying 50 items.
- On Group Structures Realized by Elliptic Curves over a Fixed Finite Field (Q2883919) (← links)
- Crypto Galore! (Q2908530) (← links)
- Corrigendum: ``Elliptic curves with a given number of points over finite fields'' (Q2921069) (← links)
- Computational Number Theory and Cryptography (Q2926150) (← links)
- Amicable pairs and aliquot cycles on average (Q2942540) (← links)
- Lang–Trotter and Sato–Tate distributions in single and double parametric families of elliptic curves (Q2945339) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- New Attacks on RSA with Moduli N = p r q (Q2947095) (← links)
- Factoring RSA Moduli with Weak Prime Factors (Q2947096) (← links)
- Small discriminants of complex multiplication fields of elliptic curves over finite fields (Q2947996) (← links)
- JKL-ECM: an implementation of ECM using Hessian curves (Q2971003) (← links)
- Average Frobenius distribution for elliptic curves defined over finite Galois extensions of the rationals (Q3002205) (← links)
- An exploration of affine group laws for elliptic curves (Q3015224) (← links)
- A $p$-adic algorithm to compute the Hilbert class polynomial (Q3055076) (← links)
- A generic approach to searching for Jacobians (Q3055104) (← links)
- On the asymptotic effectiveness of Weil descent attacks (Q3056341) (← links)
- Binary Huff Curves (Q3073716) (← links)
- Information and computation: Classical and quantum aspects (Q3077099) (← links)
- Sufficient conditions for factoring a class of large integers (Q3078177) (← links)
- Computing Hilbert class polynomials with the Chinese remainder theorem (Q3081296) (← links)
- Self-correctors for Cryptographic Modules (Q3104690) (← links)
- Computing canonical heights with little (or no) factorization (Q3127334) (← links)
- Traces of Hecke operators and refined weight enumerators of Reed-Solomon codes (Q3130777) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- A Practical Analysis of the Elliptic Curve Factoring Algorithm (Q3137481) (← links)
- Ranks of elliptic curves (Q3148678) (← links)
- Compositeness test with nodal curves (Q3174870) (← links)
- Finding elliptic curves with a subgroup of prescribed size (Q3179510) (← links)
- Evaluating Igusa functions (Q3189460) (← links)
- A Hyperelliptic Smoothness Test, II (Q3365309) (← links)
- Complexity of inverting the Euler function (Q3377006) (← links)
- Reliabilities of Double-Loop Networks (Q3416011) (← links)
- SMOOTH NUMBERS IN SHORT INTERVALS (Q3435267) (← links)
- New weak keys in RSA (Q3443210) (← links)
- Diffie-Hellman Oracles (Q3452357) (← links)
- Algorithms for Black-Box Fields and their Application to Cryptography (Q3452358) (← links)
- Attacking (EC)DSA Given Only an Implicit Hint (Q3455504) (← links)
- Another Generalization of Wiener’s Attack on RSA (Q3506378) (← links)
- Application of ECM to a class of RSA keys (Q3561507) (← links)
- A deterministic version of Pollard’s $p-1$ algorithm (Q3584788) (← links)
- Factorization with genus 2 curves (Q3584826) (← links)
- Another look at non-standard discrete log and Diffie-Hellman problems (Q3612242) (← links)
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis (Q3627439) (← links)
- ECM on Graphics Cards (Q3627453) (← links)
- Cryptanalysis of RSA Using the Ratio of the Primes (Q3637134) (← links)
- Algorithm for factoring some RSA and Rabin moduli (Q3637783) (← links)
- Tables of Fibonacci and Lucas factorizations (Q3772275) (← links)
- On the Number of Elliptic Pseudoprimes (Q3807278) (← links)
