Skip to main content Accessibility help
×
Home
Hostname: page-component-684899dbb8-gblv7 Total loading time: 0.339 Render date: 2022-05-28T05:42:52.724Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }

Theorems on factorization and primality testing

Published online by Cambridge University Press:  24 October 2008

J. M. Pollard
Affiliation:
(Mathematics Department, Plessey Telecommunications Research, Taplow Court, Taplow, Maidenhead, Berkshire)

Extract

1. Introduction. This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n or test it for primality. One way of making these problems precise uses a multi-tape Turing machine (e.g. (1), although we require a version with an input tape). At the start of the calculation n is written in radix notation on one of the tapes, and the machine is to stop after writing out the factors in radix notation or after writing one of two symbols denoting ‘prime’ or ‘composite’. There are, of course, other definitions which could be used; but the differences between these are unimportant for our purpose.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

(1)Hartmanis, J. and Stearns, R. E.On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965), 285306.CrossRefGoogle Scholar
(2)Lehmer, D. H. Computer technology applied to the theory of numbers. Studies in Number Theory (LeVeque, W. J., Editor) (Prentice-Hall, Englewood Cliffs N.J. 1969), 117151.Google Scholar
(3)Burgess, D. A.On character sums and primitive roots. Proc. London Math. Soc. 12 (1962), 179192.CrossRefGoogle Scholar
(4)Berlekamp, E. R.Factoring polynomials over large finite fields. Math. Comp. 24 (1970), 713735.CrossRefGoogle Scholar
(5)Shanks, D. Class number, a theory of factorisation, and genera. 1969 Number Theory Institute, Proc. Sympos. Pure Math. 20, Amer. Math. Soc., Providence, Rhode Island (1970), 415440.Google Scholar
(6)Lehman, R. S. Factoring large integers. To appear in Math. Comp.Google Scholar
(7)Pollard, J. M.An algorithm for testing the primality of any integer. Bull. London Math. Soc. 3 (1971), 337340.CrossRefGoogle Scholar
(8)Good, I. J.The interaction algorithm and practical Fourier analysis. J. Roy. Statist. Soc. Ser. B 20 (1958), 361372.Google Scholar
(9)Cooley, J. W. and Tukey, J. W.An algorithm for the machine computation of complex Fourier series. Math. Comp. 19 (1965), 297301.CrossRefGoogle Scholar
(10)Schonnage, A. and Strassen, V.Schnelle Multiplikation grosser Zahlen. Computing(Arch. Elektron Rechnen), 7 (1971), 281292.CrossRefGoogle Scholar
(11)Pollard, J. M.The fast Fourier transform in a finite field. Math. Comp. 25 (1971), 365374.CrossRefGoogle Scholar
(12)Knuth, D. E.The art of computer programming, Volume 2 (revised edition 1971), Semi-numerical algorithms. Addison-Wesley, New York, 1971.Google Scholar
(13)Norton, Karl K. Numbers with small prime factors and the least kth power non-residue. Memoirs of the Amer. Math. Soc. 106, Amer. Math. Soc., Providence, Rhode Island, 1971.Google Scholar
(14)Brillhart, John and Selfridge, J. L.Some factorizations of n ± 1 and related results. Math. Comp. 21 (1967), 8796.Google Scholar
(15)Borning, Alan. Some results for k! ± 1 and 2.3.5 … xp + 1. Math. Comp. 26 (1972), 567570.Google Scholar
199
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Theorems on factorization and primality testing
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Theorems on factorization and primality testing
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Theorems on factorization and primality testing
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *