{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:15:40Z","timestamp":1725574540202},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405504"},{"type":"electronic","value":"9783540450801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45080-1_43","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T04:54:03Z","timestamp":1294376043000},"page":"329-336","source":"Crossref","is-referenced-by-count":7,"title":["Minimal Addition-Subtraction Sequences for Efficient Pre-processing in Large Window-Based Modular Exponentiation Using Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza","family":"de Macedo Mourelle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0196-6774(89)90036-9","volume":"10","author":"R. Begeron","year":"1989","unstructured":"Begeron, R., Berstel, J., Brlek, S., Duboc, C.: Addition chains using continued fractions. Journal of Algorithms\u00a010, 403\u2013412 (1989)","journal-title":"Journal of Algorithms"},{"key":"43_CR2","first-page":"38","volume-title":"Parallel problem solving from nature","author":"K. Jong De","year":"1990","unstructured":"De Jong, K., Spears, W.M.: An analysis of the interacting roles of the population size and crossover type in genetic algorithms. In: Parallel problem solving from nature, pp. 38\u201347. Springer, Heidelberg (1990)"},{"key":"43_CR3","first-page":"124","volume-title":"Proceedings of the Third International Conference on Genetic Algorithms","author":"K. Jong De","year":"1989","unstructured":"De Jong, K., Spears, W.M.: Using genetic algorithms to solve NP-complete problems. In: Proceedings of the Third International Conference on Genetic Algorithms, pp. 124\u2013132. Morgan Kaufmann, San Francisco (1989)"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P.: Remarks on number theory III: On addition chain. Acta Arithmetica, 77\u201381 (1960)","DOI":"10.4064\/aa-6-1-77-81"},{"key":"43_CR5","volume-title":"Practical genetic algorithms","author":"R.L. Haupt","year":"1998","unstructured":"Haupt, R.L., Haupt, S.E.: Practical genetic algorithms. John Wiley and Sons, New York (1998)"},{"key":"43_CR6","volume-title":"The Art of Programming: Seminumerical Algorithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Programming: Seminumerical Algorithms, 2nd edn., vol.\u00a02. Addison_Wesley, Reading (1981)","edition":"2"},{"key":"43_CR7","unstructured":"Ko\u00e7, \u00c7.K., High-speed, R.S.A.: Implementation, Technical report, RSA Laboratories, Redwood City, califirnia, USA (November 1994)"},{"key":"43_CR8","first-page":"60","volume":"E83-A,","author":"N. Kunihiro","year":"2000","unstructured":"Kunihiro, N., Yamamoto, H.: New methods for generating short addition chain. IEICE Transactions\u00a0E83-A, 60\u201367 (2000)","journal-title":"IEICE Transactions"},{"key":"43_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms + data structures = evolution program","author":"Z. Michalewics","year":"1996","unstructured":"Michalewics, Z.: Genetic algorithms + data structures = evolution program, 3rd edn. Springer, USA (1996)","edition":"3"},{"key":"43_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic curve public key cryptosystems","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J.: Elliptic curve public key cryptosystems. Kluwer Academic, Dordrecht (1993)"},{"key":"43_CR11","unstructured":"Neves, J., Rocha, M., Rodrigues, B.M., Alves, J.: Adaptive strategies and the design evolutionary applications. In: Proceedings of the Genetic and the Design of Evolutionary Computation Conference, Orlando, Florida, USA (1999)"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the Fifteenth International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems","author":"N. Nedjah","year":"2002","unstructured":"Nedjah, N., Mourelle, L.M.: Minimal addition chains using genetic algorithms. In: Proceedings of the Fifteenth International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Cairns, Australia. LNCS, Springer, Heidelberg (2002) (to appear)"},{"issue":"2","key":"43_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signature and public-key cryptosystems. Communication of ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communication of ACM"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45080-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:07:22Z","timestamp":1559927242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45080-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405504","9783540450801"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45080-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}