Rigorous analysis of a randomised number field sieve
From MaRDI portal
Publication:1747213
DOI10.1016/j.jnt.2017.10.019zbMath1430.11166arXiv1805.08873OpenAlexW2774819681MaRDI QIDQ1747213
Ramarathnam Venkatesan, Jonathan D. Lee
Publication date: 4 May 2018
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.08873
Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Factorization (11Y05)
Related Items (2)
Level of distribution of quadratic polynomials and an upper bound sieve for friable integers ⋮ On oracle factoring of integers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sharp transitions in making squares
- On a paper of K. Soundararajan on smooth numbers in arithmetic progressions
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
- Factoring integers with elliptic curves
- Quelques applications du théorème de densité de Chebotarev
- Integers, without large prime factors, in arithmetic progressions. I
- Modifications to the number field sieve
- Integers without large prime factors
- Some effective cases of the Brauer-Siegel theorem
- PRIMES is in P
- Bounded gaps between primes
- Approximate formulas for some functions of prime numbers
- Large character sums
- Propriétés multiplicatives des entiers friables translatés
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Square Root Algorithms for the Number Field Sieve
- On polynomial selection for the general number field sieve
- The distribution of smooth numbers in arithmetic progressions
- On Integers Free of Large Prime Factors
- Asymptotically Fast Factorization of Integers
- Algorithms in Algebraic Number Theory
- A Rigorous Time Bound for Factoring Integers
- Integers, without large prime factors, in arithmetic progressions. II
- Cribler les entiers sans grand facteur premier
- A hyperelliptic smoothness test. I
- Factoring with Two Large Primes
- Problems in Algebraic Number Theory
- INTEGERS FREE OF LARGE PRIME DIVISORS IN SHORT INTERVALS
- Théorèmes de type Fouvry–Iwaniec pour les entiers friables
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Non-Degeneracy of Pollard Rho Collisions
- ERROR TERMS IN ADDITIVE PRIME NUMBER THEORY
- Algorithmic Number Theory
- Factoring polynomials over finite fields: A survey
This page was built for publication: Rigorous analysis of a randomised number field sieve
