Asymptotically Fast Factorization of Integers
From MaRDI portal
Cites work
- 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
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3460351 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- scientific article; zbMATH DE number 3226335 (Why is no real title available?)
- scientific article; zbMATH DE number 3091928 (Why is no real title available?)
- On Integers All of Whose Prime Factors are Small
- Riemann's hypothesis and tests for primality
Cited in
(45)- On the distribution in short intervals of integers having no large prime factor
- Modern factorization methods
- Reductions among number theoretic problems
- Recent developments in primality testing
- The influence of computers in the development of number theory
- Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel
- Polylog depth circuits for integer factoring and discrete logarithms
- The sharp threshold for making squares
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- Rigorous analysis of a randomised number field sieve
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- On the oracle complexity of factoring integers
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Non-malleable codes for bounded parallel-time tampering
- Sieve algorithms for perfect power testing
- An improved computational algorithm for finding the factorial
- On the distribution of running times of certain integer factoring algorithms
- Sufficient conditions for factoring a class of large integers
- A babystep-giantstep method for faster deterministic integer factorization
- Short Notes: Factoring Medium-Sized Integers
- Running Time Predictions for Factoring Algorithms
- Efficient Factoring Based on Partial Information
- scientific article; zbMATH DE number 3970826 (Why is no real title available?)
- scientific article; zbMATH DE number 4095549 (Why is no real title available?)
- A Rigorous Time Bound for Factoring Integers
- On sharp transitions in making squares
- scientific article; zbMATH DE number 2068209 (Why is no real title available?)
- Large sieve, Miller-Rabin compositeness witnesses and integer factoring problem
- Primality testing and factorization by using Fourier spectrum of the Riemann zeta function
- scientific article; zbMATH DE number 849975 (Why is no real title available?)
- A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- Analogue algorithm for parallel factorization of an exponential number of large integers. I: Theoretical description
- The South Caicos factoring algorithm
- Optimal factorizations of rational numbers using factorization trees
- Computing prime divisors in an interval
- Differential Factoring for Integers
- Analysis of some elementary algorithms for prime factorization
- Finding normal binary floating-point factors efficiently
- CryptAttackTester: high-assurance attack analysis
- Smooth subsum search a heuristic for practical integer factorization
- The structured generic-group model
- Computing the Ramanujan tau function
- Parity check matrices and product representations of squares
- Efficient verification of Tunnell's criterion
This page was built for publication: Asymptotically Fast Factorization of Integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898556)
