Synonyms
Related Concepts
Definition
The binary exponentiation method computes powers directed by the exponent bits, one at a time. Bits of value 0 require a squaring; bits of value 1 require a squaring and a multiplication.
Background
Most schemes for public key cryptography involve exponentiation in some group (or, more generally, in some semigroup: an algebraic structure like a group except that elements need not have inverses, and that there may not even be an identity element). The term exponentiation assumes that the group operation is written multiplicatively. If the group operation is written additively, one speaks of scalar multiplication instead, but this change in terminology does not affect the essence of the task.
Let ∘ denote the group operation and assume that the exponentiation to be performed is g e where g is an element of the group (or semigroup) and e is a positive integer. Computing the result \(g \circ...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Knuth DE (1998) The art of computer programming – vol 2: Seminumerical algorithms, 3rd edn.Addison-Wesley, Reading, MA
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Möller, B. (2011). Binary Exponentiation. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_26
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering