Latest COVID-19 Information for Purdue University

The Center for Education and Research in Information Assurance and Security (CERIAS)

The Center for Education and Research in
Information Assurance and Security (CERIAS)

Sam Wagstaff - CERIAS

Students: Fall 2021, unless noted otherwise, sessions will be virtual on Zoom.

Euler's theorem and exponentiation ciphers

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.


Ways to Watch

YouTube

Watch Now!

Over 500 videos of our weekly seminar and symposia keynotes are available on our YouTube Channel. Also check out Spaf's YouTube Channel. Subscribe today!