Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428260 | Information Processing Letters | 2008 | 6 Pages |
Abstract
Modular exponentiation is a frequent task, in particular for many cryptographic applications. To accelerate modular exponentiation for very large integers one may use repeated squaring, which is based on representing the exponent in the standard binary numeration system. We show here that for certain applications, replacing the standard system by one based on Fibonacci numbers may yield a new line of time/space tradeoffs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics