Asymptotically Fast Factorization of Integers
From MaRDI portal
Publication:3898556
DOI10.2307/2007743zbMath0452.10010OpenAlexW4239096409WikidataQ56047904 ScholiaQ56047904MaRDI QIDQ3898556
Publication date: 1981
Full work available at URL: https://doi.org/10.2307/2007743
Related Items (20)
Non-malleable codes for bounded parallel-time tampering ⋮ On the distribution in short intervals of integers having no large prime factor ⋮ Sieve algorithms for perfect power testing ⋮ Reductions among number theoretic problems ⋮ The sharp threshold for making squares ⋮ Computing the Ramanujan tau function ⋮ Running Time Predictions for Factoring Algorithms ⋮ On sharp transitions in making squares ⋮ Recent developments in primality testing ⋮ The influence of computers in the development of number theory ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ Parity check matrices and product representations of squares ⋮ Rigorous analysis of a randomised number field sieve ⋮ Efficient verification of Tunnell's criterion ⋮ A Rigorous Time Bound for Factoring Integers ⋮ CryptAttackTester: high-assurance attack analysis ⋮ Smooth subsum search a heuristic for practical integer factorization ⋮ Sequences of numbers generated by addition in formal groups and new primality and factorization tests ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)
Cites Work
- Riemann's hypothesis and tests for primality
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- A note on monte carlo primality tests and algorithmic information theory
- Factoring Large Integers
- On Integers All of Whose Prime Factors are Small
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Asymptotically Fast Factorization of Integers
