Exponentiation by squaring

This article may be confusing or unclear to readers. Please help clarify the article. There is a discussion about this on talk:Exponentiation by squaring § Least significant bit is first. (May 2022) (Learn how and when to remove this message)

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Exponentiation by squaring" – news · newspapers · books · scholar · JSTOR (February 2018) (Learn how and when to remove this message)

In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a number, or more generally of an element of a semigroup, like a polynomial or a square matrix. Some variants are commonly referred to as square-and-multiply algorithms or binary exponentiation. These can be of quite general use, for example in modular arithmetic or powering of matrices. For semigroups for which additive notation is commonly used, like elliptic curves used in cryptography, this method is also referred to as double-and-add.