The development of the number field sieve
From MaRDI portal
Publication:689067
DOI10.1007/BFb0091534zbMath0777.00017OpenAlexW2179025976WikidataQ56139872 ScholiaQ56139872MaRDI QIDQ689067
No author found.
Publication date: 2 November 1993
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0091534
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to number theory (11-06) Algebraic number theory computations (11Y40) Factorization (11Y05)
Related Items (65)
The space complexity analysis in the general number field sieve integer factorization ⋮ Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Attacking (EC)DSA Given Only an Implicit Hint ⋮ Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ The Elkies curve has rank 28 subject only to GRH ⋮ SOME ARITHMETICAL PROPERTIES ON HYPERBOLA ⋮ New Attacks on RSA with Moduli N = p r q ⋮ Factoring RSA Moduli with Weak Prime Factors ⋮ Cryptanalytic results on `Dual CRT' and `Common Prime' RSA ⋮ Computational Number Theory, Past, Present, and Future ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Factoring multi power RSA moduli with a class of secret exponents ⋮ Certain sequence of arithmetic progressions and a new key sharing method ⋮ A new quantum algorithm for computing RSA ciphertext period ⋮ On reducing factorization to the discrete logarithm problem modulo a composite ⋮ One approach to factorization of positive integers ⋮ Factoring Integers with Large-Prime Variations of the Quadratic Sieve ⋮ A Kilobit Special Number Field Sieve Factorization ⋮ Predicting the Sieving Effort for the Number Field Sieve ⋮ Finding smooth integers in short intervals using CRT decoding ⋮ An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic ⋮ Approximating the number of integers free of large prime factors ⋮ \(\mathbb F _2 \) Lanczos revisited ⋮ On finding Fermat’s pairs ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Detecting perfect powers in essentially linear time ⋮ A new public key cryptosystem based on Edwards curves ⋮ The number field sieve for integers of low weight ⋮ Index calculation attacks on RSA signature and encryption ⋮ VSH, an Efficient and Provable Collision-Resistant Hash Function ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Reducing factorization of a semiprime number to the integration of highly oscillatory functions ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ An Implementation of the Number Field Sieve ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ A Simple and Improved Algorithm for Integer Factorization with Implicit Hints ⋮ A new generalization of the KMOV cryptosystem ⋮ Factoring with hints ⋮ Better polynomials for GNFS ⋮ Factoring with Two Large Primes ⋮ Quadratic sieving ⋮ Using number fields to compute logarithms in finite fields ⋮ A public key cryptosystem based on Diophantine equations of degree increasing type ⋮ An Average Case NP-complete Graph Colouring Problem ⋮ Quantum computation and quantum information† ⋮ Sufficient conditions for factoring a class of large integers ⋮ Montgomery's method of polynomial selection for the number field sieve ⋮ Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus ⋮ Оценки количества чисел со специальным разложением на простые множители. II ⋮ Faster cofactorization with ECM using mixed representations ⋮ Iterating the Sum-of-Divisors Function ⋮ Computing endomorphism rings of abelian varieties of dimension two ⋮ Modular exponentiation via the explicit Chinese remainder theorem ⋮ Factorization of the tenth Fermat number ⋮ Quantum computing: beyond the limits of conventional computation† ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment ⋮ Function field sieve method for discrete logarithms over finite fields ⋮ Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x\)] ⋮ Improving the exact security of digital signature schemes ⋮ Supersingular j-invariants and the class number of ℚ(−p) ⋮ Root optimization of polynomials in the number field sieve
This page was built for publication: The development of the number field sieve
