Pages that link to "Item:Q3881775"

The following pages link to An improved Monte Carlo factorization algorithm (Q3881775):

Displaying 38 items.

• An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
• Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
• Memoryless near-collisions via coding theory (Q663464) (← links)
• A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
• Cycle detection algorithms and their applications (Q690565) (← links)
• Improvement of FPPR method to solve ECDLP (Q740119) (← links)
• Toward a theory of Pollard's rho method (Q752762) (← links)
• Efficient verification of Tunnell's criterion (Q957686) (← links)
• Improved lower bounds for the cycle detection problem (Q1058851) (← links)
• Modern factorization methods (Q1085192) (← links)
• A systolic algorithm for extended GCD computation (Q1110555) (← links)
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search (Q1201808) (← links)
• Lower bounds for the cycle detection problem (Q1838298) (← links)
• On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
• A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
• Cryptanalysis of MD2 (Q2267363) (← links)
• Solving discrete logarithm problems faster with the aid of pre-computation (Q2322875) (← links)
• Improvement of multidimensional randomized Monte Carlo algorithms with ``splitting'' (Q2332632) (← links)
• Cycle detection using a stack (Q2390239) (← links)
• On the heuristic of approximating polynomials over finite fields by random mappings (Q2828372) (← links)
• Memory-Efficient Algorithms for Finding Needles in Haystacks (Q2829215) (← links)
• Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions (Q2945385) (← links)
• Time-Memory Trade-Offs for Near-Collisions (Q2946879) (← links)
• Optimal Covering Codes for Finding Near-Collisions (Q3084254) (← links)
• Note on class number parity of an abelian field of prime conductor (Q3121977) (← links)
• Speeding Up the Pollard Rho Method on Prime Fields (Q3600392) (← links)
• Cryptanalysis of MDC-2 (Q3627430) (← links)
• Factorization of the Eighth Fermat Number (Q3933053) (← links)
• A monte carlo method for factorization (Q4071300) (← links)
• A space efficient algorithm for group structure computation (Q4210962) (← links)
• Factorization of the tenth Fermat number (Q4221993) (← links)
• New Cullen Primes (Q4878523) (← links)
• (Q4993347) (← links)
• Indivisibility of the class number of a real abelian field of prime conductor (Q5082458) (← links)
• (Q5114826) (← links)
• Analogues of the 3<i>x</i>+ 1 Problem in Polynomial Rings of Characteristic 2 (Q5374133) (← links)
• Probability, statistics and computation in dynamical systems (Q5740360) (← links)
• Finding low-weight polynomial multiples using the rho method (Q6103104) (← links)