The following pages link to (Q3491688):
Displaying 11 items.
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- Highly parallel computations modulo a number having only small prime factors (Q1184734) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms (Q3189989) (← links)
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines (Q3222908) (← links)
- Factoring with Cyclotomic Polynomials (Q3809851) (← links)
- (Q3840151) (← links)
- (Q4945812) (← links)
- Factoring Numbers on the Massively Parallel Computer (Q5019321) (← links)
- (Q5303288) (← links)