A Detrministic Factorization and Primality Testing Algorithm for Integers of the Form Z Mod 6 = -1
Prime numbers are known to be in one of two series; P mod 6 = ±1. In this paper, we introduce the concept of Integer Absolute Position in prime series, and we use the concept to develop a structure for composite integer numbers in the prime series P mod 6 = -1.
We use the developed structure to state theorems and to develop a deterministic algorithm that can test simultaneously for primality and prime factors of integers of the form Z mod 6 = -1.
The developed algorithm is compared with some of the well known factorization algorithms. The results show that the developed algorithm performs well when the two factors are close to each other.
Although the current version of the algorithm is of complexity ((N/62) ½ /2), but the facts that, the algorithm has a parallel characteristics and its performance is dependent on a matrix search algorithm, makes the algorithm competent for achieving better performance.
KeywordsFactorization Primality Testing Prime Series Absolute Position Relative Position
Unable to display preview. Download preview PDF.
- 3.Schoof, R.J.: Quadratic fields and factorization. In: van de Lune, J. (ed.) Studieweek Getaltheorie en Computers, Amsterdam. Math. Centrum, pp. 165–206 (1980)Google Scholar
- 4.Shanks, D.: Class number, a theory of factorization, and genera. In: Proc. Symp. Pure Math. 20, American Math. Soc., pp. 415–440 (1971)Google Scholar
- 6.Pomerance, C.: Analysis and comparison of some integer factoring algorithms. In: Lenstra Jr., H.W., Tijdeman, R. (eds.) Computational Methods in Number Theory, Amsterdam. Math. Centrum Tract, vol. 154, pp. 89–139 (1982)Google Scholar
- 9.Voorhoeve, M.: Factorization. In: van de Lune, J. (ed.) Studieweek Getaltheorie en Computers, Amsterdam. Math. Centrum, pp. 61–68 (1980)Google Scholar
- 10.Junod, P.: Cryptographic Secure Pseudo-Random Bits Generation: The Blum-Blum-Shub Generator (August 1999), http://www.win.tue.nl/~henkvt/boneh-bbs.pdf
- 12.General number field sieve. From Wikipedia, an online encyclopedia, http://en.wikipedia.org/wiki/GNFS
- 13.Wesstein, E.W.: RSA Encryption. From Mathworld, an online encyclopedia, http://mathworld.wolfram.com/RSAEncryption.html
- 14.Brent, R.P.: Some integer factorization algorithms using elliptic curves. Australian Computer Science Communications 8, 149–163 (1986)Google Scholar
- 15.Housley, et al.: RFC 2459: Internet X.509 Public Key Infrastructure Certificate and CRL Profile, http://www.faqs.org/rfcs/rfc2459.html