{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:46:07Z","timestamp":1743036367460,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811310553"},{"type":"electronic","value":"9789811310560"}],"license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-1056-0_22","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T12:30:31Z","timestamp":1532349031000},"page":"211-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Performance Comparison of Some Addition Chain Methods Based on Integer Family"],"prefix":"10.1007","author":[{"given":"M. F. A.","family":"Kadir","sequence":"first","affiliation":[]},{"given":"M. A.","family":"Mohamed","sequence":"additional","affiliation":[]},{"given":"R.","family":"Mohamad","sequence":"additional","affiliation":[]},{"given":"M.","family":"Mamat","sequence":"additional","affiliation":[]},{"given":"A.","family":"Muhammed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"issue":"153\u2013156","key":"22_CR1","first-page":"7665","volume":"8","author":"MA Mohamed","year":"2014","unstructured":"Mohamed MA (2014) A survey on elliptic curve cryptography. Appl Math Sci 8(153\u2013156):7665\u20137691","journal-title":"Appl Math Sci"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz N (1987) Elliptic curve cryptosystems. Math Comput 48:203\u2013209","journal-title":"Math Comput"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"10","author":"F Downey","year":"1981","unstructured":"Downey F, Leong B, Seith R (1981) Computing sequences with addition chains. SIAM J Comput 10:638\u2013646","journal-title":"SIAM J Comput"},{"issue":"8","key":"22_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.3844\/jcssp.2017.275.289","volume":"13","author":"AM Noma","year":"2017","unstructured":"Noma AM, Muhammed A, Mohamed MA, Zulkarnain ZA (2017) A review on heuristics for addition chain problem: towards efficient public key cryptosystems. J Comput Sci 13(8):275\u2013289","journal-title":"J Comput Sci"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11596448_30","volume-title":"Computational Intelligence and Security","author":"Nareli Cruz-Cort\u00e9s","year":"2005","unstructured":"Cruz-Cort\u00e9s\u00a0N, Rodr\u00edguez-Henr\u00edquez F, Ju\u00e1rez-Morales R, Coello Coello CA (2005) Finding optimal addition chains using a genetic algorithm approach. In: Hao Y et al (eds) Computational intelligence and security (CIS 2005). LNCS, vol 3801. Springer, Berlin, Heidelberg"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Osorio-Hernandez L, Mezura-Montes E, Cruz-Cortes N, Rodriguez-Henriquez F (2009) A genetic algorithm with repair and local search mechanisms able to find minimal length addition chains for small exponents. In: IEEE congress on evolutionary computation (CEC 2009), pp 1422\u20131429","DOI":"10.1109\/CEC.2009.4983110"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-35323-9_2","volume-title":"Soft Computing Applications in Optimization, Control, and Recognition","author":"Arturo Rodriguez-Cristerna","year":"2013","unstructured":"Rodriguez-Cristerna A, Torres-Jimenez J (2013) A genetic algorithm for the problem of minimal Brauer chains for large exponents. In: Melin P, Castillo O (eds) Soft computing applications in optimization, control, and recognition. Studies in fuzziness and soft computing, vol 294. Springer, Berlin, Heidelberg"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10852-005-9024-z","volume":"5","author":"N Nedjah","year":"2006","unstructured":"Nedjah N, Mourelle LDM (2006) Towards minimal addition chains using ant colony optimization. J. Math Model Algorithms 5:525\u2013543","journal-title":"J. Math Model Algorithms"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2007.906082","volume":"12","author":"N Cruz-Cort\u00e9s","year":"2008","unstructured":"Cruz-Cort\u00e9s N, Rodr\u00edguez-Henr\u00edquez F, Ju\u00e1rezMorales R, Coello-Coello CA (2008) An artificial immune system heuristic for generating short addition chains. IEEE Trans Evol Comput 12:1\u201324","journal-title":"IEEE Trans Evol Comput"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-642-05258-3_60","volume-title":"MICAI 2009: Advances in Artificial Intelligence","author":"Alejandro Le\u00f3n-Javier","year":"2009","unstructured":"Le\u00f3n-Javier A, Cruz-Cort\u00e9s\u00a0N, Moreno-Armend\u00e1riz MA, Orantes-Jim\u00e9nez S (2009) Finding minimal addition chains with a particle swarm optimization algorithm. In: Aguirre AH, Borja RM, Garci\u00e1 CAR (eds) Advances in artificial intelligence (MICAI 2009). LNCS, vol 5845. Springer, Berlin, Heidelberg"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-24769-9_23","volume-title":"Progress in Artificial Intelligence","author":"Adan Jose-Garcia","year":"2011","unstructured":"Jose-Garcia A, Romero-Monsivais H, Hernandez-Morales CG, Rodriguez-Cristerna A, Rivera-Islas I, Torres-Jimenez J (2011) A simulated annealing algorithm for the problem of minimal addition chains. In: Antunes L, Pinto HS (eds) Progress in artificial intelligence (EPIA 2011). LNCS, vol 7026. Springer, Berlin, Heidelberg (2011)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.engappai.2014.09.003","volume":"37","author":"S Dominguez-Isidro","year":"2015","unstructured":"Dominguez-Isidro S, Mezura-Montes E, Cruz-Cort\u00e9s N, Rodr\u00edguez-Henr\u00edquez F (2015) Evolutionary programming for the length minimization of addition chains. Eng Appl Artif Intell 37:125\u2013134","journal-title":"Eng Appl Artif Intell"},{"key":"22_CR13","unstructured":"Knuth DE (1981) The art of computer programming. Seminumeral algorithms, vol 2, 2nd edn. Addison-Wesley"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-28628-8_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"Katsuyuki Okeya","year":"2004","unstructured":"Okeya K, Schmidt-Samoa K, Spahn C, Takagi T (2004) Signed binary representations re-visited. In: Proceedings of CRYPTO\u20192004. LNCS 3152, pp 123\u2013139"},{"key":"22_CR15","first-page":"51","volume":"190","author":"P Balasubramaniam","year":"2007","unstructured":"Balasubramaniam P, Karthikeyan E (2007) Elliptic curve scalar multiplication algorithm using complementary recoding. Appl Math Comput 190:51\u201356","journal-title":"Appl Math Comput"},{"issue":"11","key":"22_CR16","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1080\/00207160.2010.543456","volume":"88","author":"MA Mohamed","year":"2011","unstructured":"Mohamed MA, Md Said MR, Mohd Atan KA, Ahmad Zulkarnain Z (2011) Shorter addition chain for smooth integers using decomposition method. Int J Comput Math 88(11):2222\u20132232","journal-title":"Int J Comput Math"},{"key":"22_CR17","unstructured":"Mohamed MA, Mohd Atan KA (2012) Rule based representation of integer for a new addition chain method. Appl Math Sci 6(30):1497\u20131503"},{"key":"22_CR18","first-page":"144","volume":"14","author":"MA Mohamed","year":"2015","unstructured":"Mohamed MA, Said MRMd (2015) A hybrid addition chain method for faster scalar multiplication. Wseas Trans Commun 14:144\u2013152","journal-title":"Wseas Trans Commun"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.21817\/ijet\/2017\/v9i1\/170902306","volume":"9","author":"MA Mohamed","year":"2017","unstructured":"Mohamed MA, Ahmad A, Mohamed RR, Said MRM (2017) Shorter addition-subtraction chain with signed composition method. Int J Eng Technol 9(2):299\u2013308","journal-title":"Int J Eng Technol"}],"container-title":["Lecture Notes in Electrical Engineering","Information Science and Applications 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1056-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T22:35:11Z","timestamp":1558132511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1056-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"ISBN":["9789811310553","9789811310560"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1056-0_22","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2018,7,24]]},"assertion":[{"value":"24 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Science and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}