Shorter addition chain for smooth integers using decomposition method.
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...
Saved in:
Main Authors: | , , , |
---|---|
格式: | Article |
语言: | 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 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
成为第一个发表评论!