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