乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:46:08Z","timestamp":1725795968846},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079943"},{"type":"electronic","value":"9783319079950"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07995-0_37","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T23:24:31Z","timestamp":1402442671000},"page":"375-384","source":"Crossref","is-referenced-by-count":11,"title":["Cryptanalytic Results on Knapsack Cryptosystem Using Binary Particle Swarm Optimization"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Jain","sequence":"first","affiliation":[]},{"given":"Narendra S.","family":"Chaudhari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, J.C., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Applied Mathematics and Computation\u00a0218(22), 11,042\u201311,061 (2012)","DOI":"10.1016\/j.amc.2012.05.001"},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.P., Stern, J.: Improved low-density subset sum algorithms. Computational Complexity\u00a02(2), 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"issue":"3","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1109\/TLA.2012.6222587","volume":"10","author":"M. Danziger","year":"2012","unstructured":"Danziger, M., Henriques, A.: Computational intelligence applied on cryptology: a brief review. IEEE Latin America Transactions (Revista IEEE America Latina)\u00a010(3), 1798\u20131810 (2012)","journal-title":"IEEE Latin America Transactions (Revista IEEE America Latina)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Engelbrecht, A.P.: Computational intelligence: an introduction. John Wiley & Sons (2007)","DOI":"10.1002\/9780470512517"},{"key":"37_CR5","unstructured":"Garg, P., Shastri, A.: An improved cryptanalytic attack on knapsack cipher using genetic algorithm. International Journal of Information Technology\u00a03(3) (2006)"},{"key":"37_CR6","unstructured":"Garg, P., Shastri, A., Agarwal, D.: An enhanced cryptanalytic attack on knapsack cipher using genetic algorithm. Transaction on Engineering, Computing and Technology\u00a012 (2006)"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.future.2010.12.017","volume":"29","author":"\u00c1. Herrero","year":"2013","unstructured":"Herrero, \u00c1., Navarro, M., Corchado, E., Juli\u00e1n, V.: Rt-movicab-ids: Addressing real-time intrusion detection. Future Generation Computer Systems\u00a029(1), 250\u2013261 (2013)","journal-title":"Future Generation Computer Systems"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Herrero, A., Zurutuza, U., Corchado, E.: A neural-visualization ids for honeynet data. International Journal of Neural Systems\u00a022(2) (2012)","DOI":"10.1142\/S0129065712500050"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Jen, S.M., Lai, T.L., Lu, C.Y., Yang, J.F.: Knapsack cryptosystems and unreliable reliance on density. In: 2012 IEEE 26th International Conference on Advanced Information Networking and Applications (AINA), pp. 748\u2013754. IEEE (2012)","DOI":"10.1109\/AINA.2012.43"},{"issue":"3","key":"37_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10207-011-0129-2","volume":"10","author":"A. Kate","year":"2011","unstructured":"Kate, A., Goldberg, I.: Generalizing cryptosystems based on the subset sum problem. International Journal of Information Security\u00a010(3), 189\u2013199 (2011)","journal-title":"International Journal of Information Security"},{"key":"37_CR11","unstructured":"Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation, vol.\u00a05, pp. 4104\u20134108. IEEE (1997)"},{"issue":"1","key":"37_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. Journal of the ACM (JACM)\u00a032(1), 229\u2013246 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-11799-2_23","volume-title":"Theory of Cryptography","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Palacio, A., Segev, G.: Public-key cryptographic primitives provably as secure as subset sum. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 382\u2013400. Springer, Heidelberg (2010)"},{"issue":"5","key":"37_CR14","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. Merkle","year":"1978","unstructured":"Merkle, R., Hellman, M.: Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory\u00a024(5), 525\u2013530 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"37_CR15","unstructured":"Murakami, Y., Hamasho, S., Kasahara, M.: A public-key cryptosystem based on decision version of subset sum problem. In: 2012 International Symposium on Information Theory and its Applications (ISITA), pp. 735\u2013739. IEEE (2012)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Murakami, Y., Katayanagi, K., Kasahara, M.: A new class of cryptosystems based on chinese remainder theorem. In: International Symposium on Information Theory and Its Applications, ISITA 2008, pp. 1\u20136. IEEE (2008)","DOI":"10.1109\/ISITA.2008.4895587"},{"issue":"5","key":"37_CR17","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"30","author":"A. Shamir","year":"1984","unstructured":"Shamir, A.: A polynomial-time algorithm for breaking the basic merkle-hellman cryptosystem. IEEE Transactions on Information Theory\u00a030(5), 699\u2013704 (1984)","journal-title":"IEEE Transactions on Information Theory"},{"key":"37_CR18","unstructured":"Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: The 1998 IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence, pp. 69\u201373. IEEE (1998)"},{"issue":"5","key":"37_CR19","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"37_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1080\/0161-119391867999","volume":"17","author":"R. Spillman","year":"1993","unstructured":"Spillman, R.: Cryptanalysis of knapsack ciphers using genetic algorithms. Cryptologia\u00a017(4), 367\u2013377 (1993)","journal-title":"Cryptologia"},{"issue":"1","key":"37_CR21","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.camwa.2009.08.031","volume":"59","author":"B. Wang","year":"2010","unstructured":"Wang, B., Hu, Y.: Quadratic compact knapsack public-key cryptosystem. Computers & Mathematics with Applications\u00a059(1), 194\u2013206 (2010)","journal-title":"Computers & Mathematics with Applications"},{"issue":"19","key":"37_CR22","doi-asserted-by":"publisher","first-page":"3981","DOI":"10.1016\/j.ins.2007.03.010","volume":"177","author":"B. Wang","year":"2007","unstructured":"Wang, B., Wu, Q., Hu, Y.: A knapsack-based probabilistic encryption scheme. Information Sciences\u00a0177(19), 3981\u20133994 (2007)","journal-title":"Information Sciences"}],"container-title":["Advances in Intelligent Systems and Computing","International Joint Conference SOCO\u201914-CISIS\u201914-ICEUTE\u201914"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07995-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T04:36:59Z","timestamp":1676867819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07995-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079943","9783319079950"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07995-0_37","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}