An improved Monte Carlo factorization algorithm
From MaRDI portal
Publication:3881775
DOI10.1007/BF01933190zbMath0439.65001WikidataQ55953265 ScholiaQ55953265MaRDI QIDQ3881775
Publication date: 1980
Published in: BIT (Search for Journal in Brave)
Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10) Software, source code, etc. for problems pertaining to number theory (11-04) Factorization (11Y05) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items
Modern factorization methods, A new approach for finding low-weight polynomial multiples, Cycle detection using a stack, A systolic algorithm for extended GCD computation, Indivisibility of the class number of a real abelian field of prime conductor, Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions, Time-Memory Trade-Offs for Near-Collisions, Unnamed Item, Generic attack on duplex-based AEAD modes using random function statistics, Finding low-weight polynomial multiples using the rho method, An efficient collision detection method for computing discrete logarithms with Pollard's rho, Factorization of the Eighth Fermat Number, Accelerating Pollard's rho algorithm on finite fields, Analogues of the 3x+ 1 Problem in Polynomial Rings of Characteristic 2, Memoryless near-collisions via coding theory, A low-memory algorithm for finding short product representations in finite groups., Efficient verification of Tunnell's criterion, Birthday paradox, coupon collectors, caching algorithms and self- organizing search, Cycle detection algorithms and their applications, Probability, statistics and computation in dynamical systems, Cryptanalysis of MD2, Speeding Up the Pollard Rho Method on Prime Fields, New Cullen Primes, Improvement of FPPR method to solve ECDLP, Unnamed Item, Cryptanalysis of MDC-2, Optimal Covering Codes for Finding Near-Collisions, Toward a theory of Pollard's rho method, On the heuristic of approximating polynomials over finite fields by random mappings, Memory-Efficient Algorithms for Finding Needles in Haystacks, Solving discrete logarithm problems faster with the aid of pre-computation, A space efficient algorithm for group structure computation, Lower bounds for the cycle detection problem, Note on class number parity of an abelian field of prime conductor, Factorization of the tenth Fermat number, Improved lower bounds for the cycle detection problem, On the streaming indistinguishability of a random permutation and a random function
Cites Work
- Unnamed Item
- Unnamed Item
- New directions in cryptography
- A Method of Factoring and the Factorization of F 7
- A monte carlo method for factorization
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- Monte Carlo Methods for Index Computation (mod p)
- A design for a number theory package with an optimized trial division routine
