An improved Monte Carlo factorization algorithm
From MaRDI portal
Cites work
- A design for a number theory package with an optimized trial division routine
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- A Method of Factoring and the Factorization of F 7
- A monte carlo method for factorization
- scientific article; zbMATH DE number 3460351 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Monte Carlo Methods for Index Computation (mod p)
- New directions in cryptography
Cited in
(40)- Improved lower bounds for the cycle detection problem
- Modern factorization methods
- A systolic algorithm for extended GCD computation
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Lower bounds for the cycle detection problem
- On the streaming indistinguishability of a random permutation and a random function
- A new approach for finding low-weight polynomial multiples
- Cryptanalysis of MD2
- Solving discrete logarithm problems faster with the aid of pre-computation
- Improvement of multidimensional randomized Monte Carlo algorithms with ``splitting
- Cycle detection using a stack
- On the heuristic of approximating polynomials over finite fields by random mappings
- Memory-Efficient Algorithms for Finding Needles in Haystacks
- Using random error correcting codes in near-collision attacks on generic hash-functions
- Time-memory trade-offs for near-collisions
- Optimal covering codes for finding near-collisions
- Note on class number parity of an abelian field of prime conductor
- Speeding Up the Pollard Rho Method on Prime Fields
- Cryptanalysis of MDC-2
- Factorization of the Eighth Fermat Number
- A monte carlo method for factorization
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- A space efficient algorithm for group structure computation
- Factorization of the tenth Fermat number
- Accelerating Pollard's rho algorithm on finite fields
- New Cullen Primes
- On repetitive right application of \(B\)-terms
- Indivisibility of the class number of a real abelian field of prime conductor
- On properties of \(B\)-terms
- Analogues of the 3x+1 problem in polynomial rings of characteristic 2
- Probability, statistics and computation in dynamical systems
- Generic attack on duplex-based AEAD modes using random function statistics
- Finding low-weight polynomial multiples using the rho method
- Memoryless near-collisions via coding theory
- A low-memory algorithm for finding short product representations in finite groups.
- Cycle detection algorithms and their applications
- Choosing iteration maps for the parallel Pollard rho method
- Improvement of FPPR method to solve ECDLP
- Toward a theory of Pollard's rho method
- Efficient verification of Tunnell's criterion
This page was built for publication: An improved Monte Carlo factorization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3881775)
