Shorter addition chain for smooth integers using decomposition method.

• المؤلفون الرئيسيون: Mohamed, M. A., Md. Said, Mohamad Rushdan, Mohd Atan, Kamel Ariffin, Ahmad Zulkarnain, Zuriati
• التنسيق: مقال
• اللغة: English; English
• منشور في: Taylor & Francis 2011
• الوصول للمادة أونلاين: http://psasir.upm.edu.my/id/eprint/25154/1/Shorter%20addition%20chain%20for%20smooth%20integers%20using%20decomposition%20method.pdf; http://psasir.upm.edu.my/id/eprint/25154/; http://www.tandf.co.uk/journals/default.asp

An efficient computation of scalar multiplication in elliptic curve cryptography can be achieved by reducing the original problem into a chain of additions and doublings. Finding the shortest addition chain is an NP-problem. To produce the nearest possible shortest chain, various methods were introd...