{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:47:01Z","timestamp":1725468421211},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540316493"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-31662-0_32","type":"book-chapter","created":{"date-parts":[[2006,8,10]],"date-time":"2006-08-10T14:41:25Z","timestamp":1155220885000},"page":"415-424","source":"Crossref","is-referenced-by-count":0,"title":["Towards Very Fast Modular Exponentiations Using Ant Colony"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza de Macedo","family":"Mourelle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M. and Gambardella, L.M. 1997, Ant Colony: a Cooperative Learning Approach to the Travelling Salesman Problem, IEEE Transaction on Evolutionary Computation, Vol. 1, No. 1, pp. 53\u201366","journal-title":"IEEE Transaction on Evolutionary Computation"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"10","author":"P. Downing","year":"1981","unstructured":"Downing, P. Leong B. and Sthi, R. 1981, Computing Sequences with Addition Chains, SIAM Journal on Computing, vol. 10, No. 3, pp. 638\u2013646","journal-title":"SIAM Journal on Computing"},{"key":"32_CR3","unstructured":"Feber, J. 1995, Multi-Agent Systems: an Introduction to Distributed Artificial Intelligence, Addison-Wesley"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-36077-8_43","volume":"2457","author":"N. Nedjah","year":"2002","unstructured":"Nedjah, N., Mourelle, L.M. 2002, Efficient Parallel Modular Exponentiation Algorithm, Second International Conference on Information systems, ADVIS\u20322002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2457, pp. 405\u2013414","journal-title":"Lecture Notes in Computer Science, Springer-Verlag"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Nedjah, N. and Mourelle, L.M., Minimal addition chains using genetic algorithms, Proceedings of the Fifteenth International Conference on Industrial & Engineering Applications of Artificial Intelligence &Expert Systems, Lecture Notes in Computer Science, Springer-Verlag, vol. 2358, pp. 88\u201398","DOI":"10.1007\/3-540-36077-8_31"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A. and Adleman, L. 1978, A method for Obtaining Digital Signature and Public-Key Cryptosystems, Communications of the ACM, 21:120\u2013126","journal-title":"Communications of the ACM"},{"key":"32_CR7","unstructured":"Stutzle, T. and Dorigo, M. 1999, ACO Algorithms for the Travelling Salesman Problems, Evolutionary Algorithms in Engineering and Computer Science, John-Wiley"}],"container-title":["Advances in Soft Computing","Applied Soft Computing Technologies: The Challenge of Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-31662-0_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:23:18Z","timestamp":1619572998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-31662-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540316493"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-31662-0_32","relation":{},"subject":[]}}