Skip to main content
Top
Published in: Soft Computing 9/2016

23-07-2015 | Focus

Heuristic algorithm based on molecules optimizing their geometry in a crystal to solve the problem of integer factorization

Authors: Mohit Mishra, Utkarsh Chaturvedi, K. K. Shukla

Published in: Soft Computing | Issue 9/2016

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Integer factorization is a vital number theoretic problem finding frequent use in public key cryptography, and other areas like Fourier transforms. There has been growing interest among researchers in innovative alternative approaches to solving the problem by modeling some optimizing natural or biological behaviour in a form of an algorithm that can be used to solve the problem provided the problem can be represented as an optimization task. In this paper, we present a new model based on computational chemistry behind how molecules interact among each other to minimize their surface energy potential in a typical crystal. While this phenomenon itself is a research problem, it interestingly provides a new way of solving other problems like integer factorization which can be represented in different forms of discrete optimization task. However, we must note that the present methods based on such models are not scalable to the real-world scenario, and we present a brief discussion on this issue.

Dont have a licence yet? Then find out more about our products and how to get one now:

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 "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!

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!

Literature
go back to reference Adi Shamir ET (2013) Factoring large numbers with the TWIRL device. In: Crypto—The 23rd annual international cryptology conference. Santa Barbara, pp 1–26 Adi Shamir ET (2013) Factoring large numbers with the TWIRL device. In: Crypto—The 23rd annual international cryptology conference. Santa Barbara, pp 1–26
go back to reference Brent RP (2000) Recent progress and prospects for integer factorisation algorithms. In: Computing and combinatorics: sixth annual international computing and combinatorics conference. Sydney, pp 3–22 Brent RP (2000) Recent progress and prospects for integer factorisation algorithms. In: Computing and combinatorics: sixth annual international computing and combinatorics conference. Sydney, pp 3–22
go back to reference Chan DM (2002) Automatic generation of prime factorization algorithms using genetic programming. In: Genetic algorithms and genetic programming at stanford. Stanford Bookstore, Stanford, pp 52–57 Chan DM (2002) Automatic generation of prime factorization algorithms using genetic programming. In: Genetic algorithms and genetic programming at stanford. Stanford Bookstore, Stanford, pp 52–57
go back to reference Dass P, Sharma H, Bansal JC, Nygard KE (2013) Meta heuristics for prime factorization problem. In: Nature and biologically inspired computing (NaBIC), 2013 World Congress on, pp 126–131 Dass P, Sharma H, Bansal JC, Nygard KE (2013) Meta heuristics for prime factorization problem. In: Nature and biologically inspired computing (NaBIC), 2013 World Congress on, pp 126–131
go back to reference Dembski WA, Marks RJ (2009) Conservation of information in search: measuring the cost of success. Syst Man Cybern Part A Syst Humans IEEE Trans 39(5):1051–1061CrossRef Dembski WA, Marks RJ (2009) Conservation of information in search: measuring the cost of success. Syst Man Cybern Part A Syst Humans IEEE Trans 39(5):1051–1061CrossRef
go back to reference Jansen B, Nakayama K (2005) Neural networks following a binary approach applied to the integer prime-factorization problem. In: IEEE international joint conference on neural networks (IJCNN), pp 2577–2582 Jansen B, Nakayama K (2005) Neural networks following a binary approach applied to the integer prime-factorization problem. In: IEEE international joint conference on neural networks (IJCNN), pp 2577–2582
go back to reference Kleinjung T et al (2010) Factorization of a 768-Bit RSA modulus. In: Advances in Cryptology—CRYPTO. Lecture Notes in Computer Science, vol 62223, pp 333–350 Kleinjung T et al (2010) Factorization of a 768-Bit RSA modulus. In: Advances in Cryptology—CRYPTO. Lecture Notes in Computer Science, vol 62223, pp 333–350
go back to reference Laskari EC, Meletiou GC, Tasoulis DK, Vrahatis MN (2006) Studying the performance of artificial neural networks on problems related to cryptography. Nonlinear Anal Real World Appl 7:937–942MathSciNetCrossRefMATH Laskari EC, Meletiou GC, Tasoulis DK, Vrahatis MN (2006) Studying the performance of artificial neural networks on problems related to cryptography. Nonlinear Anal Real World Appl 7:937–942MathSciNetCrossRefMATH
go back to reference May RM (1976) Simple mathematical models with very complicated dynamics. Nature 261(5560):459–467CrossRef May RM (1976) Simple mathematical models with very complicated dynamics. Nature 261(5560):459–467CrossRef
go back to reference Meletiou G, Tasoulis DK, Vrahatis MN (2002) A first study of the neural network approach to the RSA cryptosystem. In: IASTED 2002 Conference on artificial intelligence. Banff, pp 483–488 Meletiou G, Tasoulis DK, Vrahatis MN (2002) A first study of the neural network approach to the RSA cryptosystem. In: IASTED 2002 Conference on artificial intelligence. Banff, pp 483–488
go back to reference Mishra M, Chaturvedi U, Pal SK (2014) A multithreaded bound varying chaotic firefly algorithm for prime factorization. In: IEEE international advance computing conference (IACC). Gurgaon, pp 1321–1324 Mishra M, Chaturvedi U, Pal SK (2014) A multithreaded bound varying chaotic firefly algorithm for prime factorization. In: IEEE international advance computing conference (IACC). Gurgaon, pp 1321–1324
go back to reference Rich E (2008) Automata, computability and complexity: theory and applications. Prentice Hall Rich E (2008) Automata, computability and complexity: theory and applications. Prentice Hall
go back to reference Rivest R, Shamir A, Adleman L (1978) A Method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126MathSciNetCrossRefMATH Rivest R, Shamir A, Adleman L (1978) A Method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126MathSciNetCrossRefMATH
go back to reference Shor PW (1997) Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Sci Statist Comput 26:1484–1509MathSciNetCrossRefMATH Shor PW (1997) Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Sci Statist Comput 26:1484–1509MathSciNetCrossRefMATH
go back to reference Yampolskiy RV (2010) Application of bio-inspired algoritm to the problem of intger factorization. Int J Bio-inspired Comput 2(2):115–123CrossRef Yampolskiy RV (2010) Application of bio-inspired algoritm to the problem of intger factorization. Int J Bio-inspired Comput 2(2):115–123CrossRef
Metadata
Title
Heuristic algorithm based on molecules optimizing their geometry in a crystal to solve the problem of integer factorization
Authors
Mohit Mishra
Utkarsh Chaturvedi
K. K. Shukla
Publication date
23-07-2015
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 9/2016
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-015-1772-8

Other articles of this Issue 9/2016

Soft Computing 9/2016 Go to the issue

Premium Partner