Euler's theorem and exponentiation ciphers

Page Content

Sam Wagstaff - CERIAS

Nov 07, 2001

Abstract

We 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 Speaker

Before 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.

Unless otherwise noted, the security seminar is held on Wednesdays at 4:30P.M. STEW G52, West Lafayette Campus. More information...

© 1999-2013 Purdue University. All rights reserved.

Use/Reuse Guidelines

CERIAS Seminar materials are intended for educational, non-commercial use only and any or all commercial use is prohibited. Any use must attribute "The CERIAS Seminar at Purdue University." Opinions expressed in the recordings are not necessarily representative of the views of CERIAS or of Purdue University.