Skip to main content

2018 | OriginalPaper | Buchkapitel

Factorization of Odd Integers as Lattice Search Procedure

verfasst von : Xingbo Wang

Erschienen in: Computational Intelligence and Intelligent Systems

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The article puts forward a 3-dimensional searching approach that can factorize odd composite integers. The article first proves that, an odd composite number can be expressed by a trivariate function, then demonstrates that factorization of an odd integer can be turned into a problem of searching a point in a 3-dimensional cube whose points can be searched rapidly via octree search algorithm or other 3-dimensional searching algorithm. Mathematical principles with their proofs are presented in detail, and an algorithm that reaches square of logarithm time-complexity is proposed with numerical examples. The proposed algorithm can be applied both in sequential computation and parallel computation.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Surhone, L.M., Tennoe, M.T., Henssonow, S.F.: RSA Factoring Challenge. Springer, USA (2011) Surhone, L.M., Tennoe, M.T., Henssonow, S.F.: RSA Factoring Challenge. Springer, USA (2011)
3.
Zurück zum Zitat Wanambisi, A.W., Aywa, S., Maende, C., et al.: Advances in composite integer factorization. Mater. Struct. 48(5), 1–12 (2013) Wanambisi, A.W., Aywa, S., Maende, C., et al.: Advances in composite integer factorization. Mater. Struct. 48(5), 1–12 (2013)
4.
Zurück zum Zitat Abubakar, A., Jabaka, S., Tijjani, B.I., et al.: Cryptanalytic attacks on Rivest, Shamir, and Adleman (RSA) cryptosystem: issues and challenges. J. Theor. Appl. Inf. Technol. 61(1), 1–7 (2014) Abubakar, A., Jabaka, S., Tijjani, B.I., et al.: Cryptanalytic attacks on Rivest, Shamir, and Adleman (RSA) cryptosystem: issues and challenges. J. Theor. Appl. Inf. Technol. 61(1), 1–7 (2014)
5.
Zurück zum Zitat Sonalker, A.A.: Asymmetric Key Distribution. A thesis submitted to the Graduate Faculty of North Carolina State University (2002) Sonalker, A.A.: Asymmetric Key Distribution. A thesis submitted to the Graduate Faculty of North Carolina State University (2002)
6.
Zurück zum Zitat Singh, K., Verma, R.K., Chehal, R.: Modified prime number factorization algorithm (MPFA) For RSA public key encryption. Int. J. Soft Comput. Eng. 2(4), 17–22 (2012) Singh, K., Verma, R.K., Chehal, R.: Modified prime number factorization algorithm (MPFA) For RSA public key encryption. Int. J. Soft Comput. Eng. 2(4), 17–22 (2012)
7.
Zurück zum Zitat Park, J., Sys, M.: Prime sieve and factorization using multiplication table. J. Math. Res. 4(3), 7–12 (2012)MathSciNetCrossRef Park, J., Sys, M.: Prime sieve and factorization using multiplication table. J. Math. Res. 4(3), 7–12 (2012)MathSciNetCrossRef
8.
Zurück zum Zitat Wanambisi, A.W., Aywa, S., Maende, C., Muketha, G.M.: Algebraic approach to composite integer factorization. Int. J. Math. Stat. Stud. 1(1), 39–44 (2013) Wanambisi, A.W., Aywa, S., Maende, C., Muketha, G.M.: Algebraic approach to composite integer factorization. Int. J. Math. Stat. Stud. 1(1), 39–44 (2013)
9.
Zurück zum Zitat Sarnaik, S., Gaikwad, D.G.U.: An overview to Integer factorization and RSA in cryptography. Int. J. Adv. Res. Eng. Technol. 2(9), 21–26 (2014) Sarnaik, S., Gaikwad, D.G.U.: An overview to Integer factorization and RSA in cryptography. Int. J. Adv. Res. Eng. Technol. 2(9), 21–26 (2014)
10.
Zurück zum Zitat Wang, X.: Seed and sieve of odd composite numbers with applications in factorization of integers. IOSR J. Math. 12(5, Ver. 8), 01–07 (2016) Wang, X.: Seed and sieve of odd composite numbers with applications in factorization of integers. IOSR J. Math. 12(5, Ver. 8), 01–07 (2016)
11.
Zurück zum Zitat Wang, X.: Factorization of large numbers via factorization of small numbers. Glob. J. Pure Appl. Math. 12(6), 5157–5173 (2016) Wang, X.: Factorization of large numbers via factorization of small numbers. Glob. J. Pure Appl. Math. 12(6), 5157–5173 (2016)
14.
Zurück zum Zitat Wang, X.: Genetic traits of odd numbers with applications in factorization of integers. Glob. J. Pure Appl. Math. 13(1), 318–333 (2017) Wang, X.: Genetic traits of odd numbers with applications in factorization of integers. Glob. J. Pure Appl. Math. 13(1), 318–333 (2017)
15.
Zurück zum Zitat Li, J.: Algorithm design and implementation for a mathematical model of factoring integers. IOSR J. Math. 13(I Ver. 6), 37–41 (2017)CrossRef Li, J.: Algorithm design and implementation for a mathematical model of factoring integers. IOSR J. Math. 13(I Ver. 6), 37–41 (2017)CrossRef
16.
Zurück zum Zitat Fu, D.: A parallel algorithm for factorization of big odd numbers. IOSR J. Comput. Eng. 19(2, Ver. 5), 51–54 (2017)CrossRef Fu, D.: A parallel algorithm for factorization of big odd numbers. IOSR J. Comput. Eng. 19(2, Ver. 5), 51–54 (2017)CrossRef
17.
Zurück zum Zitat Wang, X.: Strategy for algorithm design in factoring RSA numbers. IOSR J. Comput. Eng. 19(3, Ver. 2), 01–07 (2017)CrossRef Wang, X.: Strategy for algorithm design in factoring RSA numbers. IOSR J. Comput. Eng. 19(3, Ver. 2), 01–07 (2017)CrossRef
18.
Zurück zum Zitat Wang, X.: Brief summary of frequently-used properties of the floor function. IOSR J. Math. 13(5), 46–48 (2017) Wang, X.: Brief summary of frequently-used properties of the floor function. IOSR J. Math. 13(5), 46–48 (2017)
19.
Zurück zum Zitat Berg, M.D., Kreveld, M.V., Snoeyink, J.: Two-and three-dimensional point location in rectangular subdivisions. Academic Press Inc. (1995) Berg, M.D., Kreveld, M.V., Snoeyink, J.: Two-and three-dimensional point location in rectangular subdivisions. Academic Press Inc. (1995)
Metadaten
Titel
Factorization of Odd Integers as Lattice Search Procedure
verfasst von
Xingbo Wang
Copyright-Jahr
2018
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-13-1651-7_22