Pages that link to "Item:Q689067"
From MaRDI portal
The following pages link to The development of the number field sieve (Q689067):
Displaying 50 items.
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- Factoring multi-power RSA moduli with primes sharing least or most significant bits (Q285897) (← links)
- Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
- On reducing factorization to the discrete logarithm problem modulo a composite (Q445245) (← links)
- One approach to factorization of positive integers (Q647854) (← links)
- Reducing factorization of a semiprime number to the integration of highly oscillatory functions (Q712606) (← links)
- A new generalization of the KMOV cryptosystem (Q721553) (← links)
- A public key cryptosystem based on Diophantine equations of degree increasing type (Q740123) (← links)
- Montgomery's method of polynomial selection for the number field sieve (Q745185) (← links)
- Factoring multi power RSA moduli with a class of secret exponents (Q907002) (← links)
- Improving the exact security of digital signature schemes (Q1596365) (← links)
- Factoring RSA moduli with primes sharing bits in the middle (Q1647745) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA (Q1934238) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- A new public key cryptosystem based on Edwards curves (Q2008069) (← links)
- Factoring with hints (Q2027274) (← links)
- Faster cofactorization with ECM using mixed representations (Q2055704) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Certain sequence of arithmetic progressions and a new key sharing method (Q2202903) (← links)
- \(\mathbb F _2 \) Lanczos revisited (Q2469540) (← links)
- Index calculation attacks on RSA signature and encryption (Q2491257) (← links)
- Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\) (Q2580254) (← links)
- An Implementation of the Number Field Sieve (Q2785383) (← links)
- A Simple and Improved Algorithm for Integer Factorization with Implicit Hints (Q2790046) (← links)
- Better polynomials for GNFS (Q2792346) (← links)
- Quadratic sieving (Q2796022) (← links)
- New Attacks on RSA with Moduli N = p r q (Q2947095) (← links)
- Factoring RSA Moduli with Weak Prime Factors (Q2947096) (← links)
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic (Q3005589) (← links)
- Sufficient conditions for factoring a class of large integers (Q3078177) (← links)
- Quantum computation and quantum information† (Q3375535) (← links)
- Оценки количества чисел со специальным разложением на простые множители. II (Q3383123) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Quantum computing: beyond the limits of conventional computation† (Q3426225) (← links)
- Attacking (EC)DSA Given Only an Implicit Hint (Q3455504) (← links)
- The number field sieve for integers of low weight (Q3584792) (← links)
- VSH, an Efficient and Provable Collision-Resistant Hash Function (Q3593095) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- Factorization of the tenth Fermat number (Q4221993) (← links)
- Factoring with Two Large Primes (Q4317677) (← links)
- Factoring Integers with Large-Prime Variations of the Quadratic Sieve (Q4347264) (← links)
- Approximating the number of integers free of large prime factors (Q4372649) (← links)
- Detecting perfect powers in essentially linear time (Q4396462) (← links)
- The Elkies curve has rank 28 subject only to GRH (Q4561375) (← links)
- Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus (Q4707308) (← links)
- Iterating the Sum-of-Divisors Function (Q4717338) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
