Euler's theorem and exponentiation ciphers
Sam Wagstaff - CERIAS
Nov 07, 2001
AbstractWe will discuss Fermat's Little Theorem, Euler's Theorem, and their simple consequences. These include fast exponentiation and computation of inverses modulo some number. In another application we tell how to find large primes. We use all of this theory to explain how exponentiation ciphers, such as RSA and Pohlig-Hellman work, and show how to choose their parameters
About the SpeakerBefore coming to Purdue, Professor Wagstaff taught at the Universities of Rochester, Illinois, and Georgia. He spent a year at the Institute for Advanced Study in Princeton. His research interests are in the areas of cryptography, parallel computation, and analysis of algorithms, especially number theoretic algorithms. He and J. W. Smith of the University of Georgia have built a special processor with parallel capability for factoring large integers.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.