Should one always use repeated squaring for modular exponentiation?

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


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.

Original languageEnglish
Pages (from-to)232-237
Number of pages6
JournalInformation Processing Letters
Issue number6
StatePublished - 15 Jun 2008


  • Cryptography
  • Design of algorithms
  • Fibonacci number system
  • Modular exponentiation


Dive into the research topics of 'Should one always use repeated squaring for modular exponentiation?'. Together they form a unique fingerprint.

Cite this