{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T05:21:49Z","timestamp":1748064109237,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2015,7,23]],"date-time":"2015-07-23T00:00:00Z","timestamp":1437609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00500-015-1772-8","type":"journal-article","created":{"date-parts":[[2015,7,22]],"date-time":"2015-07-22T03:42:17Z","timestamp":1437536537000},"page":"3363-3371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic algorithm based on molecules optimizing their geometry in a crystal to solve the problem of integer factorization"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6111-3565","authenticated-orcid":false,"given":"Mohit","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Utkarsh","family":"Chaturvedi","sequence":"additional","affiliation":[]},{"given":"K. K.","family":"Shukla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,23]]},"reference":[{"key":"1772_CR1","unstructured":"Adi Shamir ET (2013) Factoring large numbers with the TWIRL device. In: Crypto\u2014The 23rd annual international cryptology conference. Santa Barbara, pp 1\u201326"},{"issue":"2","key":"1772_CR2","doi-asserted-by":"crossref","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M Agrawal","year":"2004","unstructured":"Agrawal M, Kayal N, Saxena N (2004) PRIMES is in P. Ann Math 160(2):781\u2013793","journal-title":"Ann Math"},{"key":"1772_CR3","doi-asserted-by":"crossref","unstructured":"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\u201322","DOI":"10.1007\/3-540-44968-X_2"},{"key":"1772_CR4","unstructured":"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\u201357"},{"key":"1772_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013131","DOI":"10.1109\/NaBIC.2013.6617850"},{"issue":"5","key":"1772_CR6","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TSMCA.2009.2025027","volume":"39","author":"WA Dembski","year":"2009","unstructured":"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\u20131061","journal-title":"Syst Man Cybern Part A Syst Humans IEEE Trans"},{"key":"1772_CR7","unstructured":"Energy Minimization Wikipedia (2014) The free encyclopedia. http:\/\/en.wikipedia.org\/wiki\/Energy_minimization . Accessed 10 Jan 2014"},{"key":"1772_CR8","unstructured":"Goldwasser S, Bellare M (2008) Lecture notes on cryptography. http:\/\/cseweb.ucsd.edu\/~mihir\/papers\/gb.pdf . Accessed Jan\u2013Feb 2013"},{"key":"1772_CR9","doi-asserted-by":"crossref","unstructured":"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\u20132582","DOI":"10.1109\/IJCNN.2005.1556309"},{"key":"1772_CR10","doi-asserted-by":"crossref","unstructured":"Kleinjung T et al (2010) Factorization of a 768-Bit RSA modulus. In: Advances in Cryptology\u2014CRYPTO. Lecture Notes in Computer Science, vol 62223, pp 333\u2013350","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"1772_CR11","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/j.na.2005.03.003","volume":"63","author":"EC Laskari","year":"2005","unstructured":"Laskari EC, Meletiou GC, Vrahatis MN (2005) Problems of cryptography as discrete optimiation tasks. Nonlinear Anal 63:831\u2013837","journal-title":"Nonlinear Anal"},{"key":"1772_CR12","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.nonrwa.2005.12.002","volume":"7","author":"EC Laskari","year":"2006","unstructured":"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\u2013942","journal-title":"Nonlinear Anal Real World Appl"},{"key":"1772_CR13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"AK Lenstra","year":"2001","unstructured":"Lenstra AK, Verheul ER (2001) Selecting cryptographic key sizes. J Cryptol 14:255\u2013293","journal-title":"J Cryptol"},{"issue":"5560","key":"1772_CR14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1038\/261459a0","volume":"261","author":"RM May","year":"1976","unstructured":"May RM (1976) Simple mathematical models with very complicated dynamics. Nature 261(5560):459\u2013467","journal-title":"Nature"},{"key":"1772_CR15","unstructured":"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\u2013488"},{"key":"1772_CR16","doi-asserted-by":"crossref","unstructured":"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\u20131324","DOI":"10.1109\/IAdCC.2014.6779518"},{"key":"1772_CR17","first-page":"1473","volume":"43","author":"C Pomerance","year":"1996","unstructured":"Pomerance C (1996) A tale of two sieves. Not AMS 43:1473\u20131485","journal-title":"Not AMS"},{"key":"1772_CR18","unstructured":"Rich E (2008) Automata, computability and complexity: theory and applications. Prentice Hall"},{"issue":"2","key":"1772_CR19","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest R, Shamir A, Adleman L (1978) A Method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"1772_CR20","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Sci Statist Comput 26:1484\u20131509","journal-title":"SIAM J Sci Statist Comput"},{"key":"1772_CR21","unstructured":"Weisstein EW (2014) Logistic equation. http:\/\/mathworld.wolfram.com\/LogisticEquation.html . Accessed 14 Jan 2014"},{"issue":"2","key":"1772_CR22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1504\/IJBIC.2010.032127","volume":"2","author":"RV Yampolskiy","year":"2010","unstructured":"Yampolskiy RV (2010) Application of bio-inspired algoritm to the problem of intger factorization. Int J Bio-inspired Comput 2(2):115\u2013123","journal-title":"Int J Bio-inspired Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1772-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1772-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1772-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:43:49Z","timestamp":1559079829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1772-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,23]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1772"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1772-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2015,7,23]]}}}