Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inform. Theory 22(6), 644–654 (1976)
Brent, R.P.: Some parallel algorithms for integer factorization. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 1–22. Springer, Heidelberg (1999)
Schoof, R.J.: Quadratic fields and factorization. In: van de Lune, J. (ed.) Studieweek Getaltheorie en Computers, Amsterdam. Math. Centrum, pp. 165–206 (1980)
Shanks, D.: Class number, a theory of factorization, and genera. In: Proc. Symp. Pure Math. 20, American Math. Soc., pp. 415–440 (1971)
Morrison, M.A., Brillhart, J.: A method of factorization and the factorization of F7. Mathematics of Computation 29, 183–205 (1975)
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)
Pollard, J.M.: A Monte Carlo method for factorization. BIT 15, 331–334 (1975)
Lehman, R.S.: Factoring large integers. Mathematics of Computation 28, 637–646 (1974)
Voorhoeve, M.: Factorization. In: van de Lune, J. (ed.) Studieweek Getaltheorie en Computers, Amsterdam. Math. Centrum, pp. 61–68 (1980)
Junod, P.: Cryptographic Secure Pseudo-Random Bits Generation: The Blum-Blum-Shub Generator (August 1999), http://www.win.tue.nl/~henkvt/boneh-bbs.pdf
Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. of Math. 126(2), 649–673 (1987)
General number field sieve. From Wikipedia, an online encyclopedia, http://en.wikipedia.org/wiki/GNFS
Wesstein, E.W.: RSA Encryption. From Mathworld, an online encyclopedia, http://mathworld.wolfram.com/RSAEncryption.html
Brent, R.P.: Some integer factorization algorithms using elliptic curves. Australian Computer Science Communications 8, 149–163 (1986)
Housley, et al.: RFC 2459: Internet X.509 Public Key Infrastructure Certificate and CRL Profile, http://www.faqs.org/rfcs/rfc2459.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noureldien, N.A., Awadelkariem, M., Ahmed, D.M. (2011). A Detrministic Factorization and Primality Testing Algorithm for Integers of the Form Z Mod 6 = -1. In: Kim, Th., Adeli, H., Robles, R.J., Balitanas, M. (eds) Information Security and Assurance. ISA 2011. Communications in Computer and Information Science, vol 200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23141-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-23141-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23140-7
Online ISBN: 978-3-642-23141-4
eBook Packages: Computer ScienceComputer Science (R0)