Skip to main content

Where All Roads Meet: Modular Exponentiation

  • Chapter
Cryptography in C and C++
  • 1731 Accesses

Abstract

In addition to the calculational rules for addition, subtraction, and multiplication in residue classes we can also define an operation of exponentiation, where the exponent specifies how many times the base is to be multiplied by itself. Exponentiation is carried out, as usual, by means of recursive calls to multiplication: For a in ℤ m we have a0:= ī and ae+1 := a · ae.

For a long time on that spot I stood,

Where two roads converged in the wood and I thought:

“Someone going the other way

Might someday stop here for the sake

Of deciding which path to take.”

But my direction lay where it lay.

And walking on, I felt a sense

Of wonder at that difference.

—Ilya Bernstein, Attention and Man

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Michael Welschenbach

About this chapter

Cite this chapter

Welschenbach, M. (2013). Where All Roads Meet: Modular Exponentiation. In: Cryptography in C and C++. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-5099-9_6

Download citation

Publish with us

Policies and ethics