Should one always use repeated squaring for modular exponentiation?

Shmuel T. Klein

doi:10.1016/j.ipl.2007.11.016

Should one always use repeated squaring for modular exponentiation?

Shmuel T. Klein

CS@BIU

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

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.

Original language	English
Pages (from-to)	232-237
Number of pages	6
Journal	Information Processing Letters
Volume	106
Issue number	6
DOIs	https://doi.org/10.1016/j.ipl.2007.11.016
State	Published - 15 Jun 2008

Keywords

Cryptography
Design of algorithms
Fibonacci number system
Modular exponentiation

Access to Document

10.1016/j.ipl.2007.11.016

Cite this

@article{1b5eb71747ef49929441242258c4ee60,

title = "Should one always use repeated squaring for modular exponentiation?",

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.",

keywords = "Cryptography, Design of algorithms, Fibonacci number system, Modular exponentiation",

author = "Klein, {Shmuel T.}",

year = "2008",

month = jun,

day = "15",

doi = "10.1016/j.ipl.2007.11.016",

language = "אנגלית",

volume = "106",

pages = "232--237",

journal = "Information Processing Letters",

issn = "0020-0190",