Modifications to the number field sieve

DOI10.1007/BF00198464zbMath0806.11071MaRDI QIDQ1310453

Don Coppersmith

Publication date: 13 February 1995

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

cryptographyfactorization of integersnumber field sievefactoring algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (13)

Batch RSA ⋮ Computation of discrete logarithms in prime fields ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Rigorous analysis of a randomised number field sieve ⋮ Finding the group structure of elliptic curves over finite fields ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ A Rigorous Time Bound for Factoring Integers ⋮ Using number fields to compute logarithms in finite fields ⋮ Computation of a 30750-bit binary field discrete logarithm ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups ⋮ The multiple number field sieve for medium- and high-characteristic finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• Solving sparse linear equations over finite fields
• Refined analysis and improvements on some factoring algorithms

This page was built for publication: Modifications to the number field sieve