An improved Monte Carlo factorization algorithm
- 284 Downloads
Pollard's Monte Carlo factorization algorithm usually finds a factor of a composite integerN inO(N1/4) arithmetic operations. The algorithm is based on a cycle-finding algorithm of Floyd. We describe a cycle-finding algorithm which is about 36 percent faster than Floyd's (on the average), and apply it to give a Monte Carlo factorization algorithm which is similar to Pollard's but about 24 percent faster.
KeywordsComputational Mathematic Arithmetic Operation Factorization Algorithm
Unable to display preview. Download preview PDF.
- 1.M. Beeler, R. W. Gosper and R. Schroeppel,Hakmem, M.I.T. Artificial Intelligence Lab. Memo No. 239, Feb. 1972, item 132, pg. 64.Google Scholar
- 3.D. E. Knuth,The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, Mass., 1969.Google Scholar
- 4.G. L. Miller,Riemann's hypothesis and a test for primality, Proc. Seventh Annual ACM Symposium on Theory of Computing, ACM, New York, 1975, 234–239.Google Scholar
- 5.M. A. Morrison and J. Brillhart,A method of factoring and the factorization of F 7, Math. Comp. 29 (1975), 183–208.Google Scholar
- 6.J. M. Pollard,Theorems on factorization and primality testing, Proc. Camb. Phil. Soc. 76 (1974), 521–528.Google Scholar
- 8.J. M. Pollard,Monte Carlo methods for index computation (mod p), Math. Comp. 32 (1978), 918–924. MR52#13611.Google Scholar
- 9.M. Rabin,Probabilistic algorithms, inAlgorithms and Complexity (J. F. Traub, ed.), Academic Press, New York, 1976, 31–40.Google Scholar
- 11.R. Sedgewick and T. G. Szymanski,The complexity of finding periods, Proc. Eleventh Annual ACM Symposium on Theory of Computing, ACM, New York, 1979, 74–80.Google Scholar
- 12.D. Shanks,Class number, a theory of factorization, and genera, Proc. Sympos. Pure Math., vol. 20, Amer. Math. Soc., Providence, Rhode Island, 1970, 415–440. MR47#4932.Google Scholar
- 15.Anonymous,ML-15,Random number generator, TI Programmable 58/59 Master Library, Texas Instruments Inc., 1977, 52–54.Google Scholar