Loading...
Flash Player 9 (or above) is needed to view slideshows. We have detected that you do not have it on your computer.To install it, go here
Modular Arithmetic and Trap Door Ciphers
169 views | comments | 0 favorites |
0 embeds (Stats)
Desc: Like other branches of mathematics, number theory has seen many surprising developments in recent years. One of the most surprising is the fact that number theory, long considered the most "useless" of any field of mathematics, has become vital to the development of modern codes and ciphers. As an example, the RSA cryptosystem, eveloped in the 1970's by Rivest, Shamir, and Adleman, uses some ideas that are very easy to understand. Yet, these ideas underlie large portions of both modern number theory and modern cryptography. We will explore these ideas, and show how they make RSA the first practical "trap door" cipher. This means that anyone can encode a message but only the recipient can decode it!
More Info
This slideshow is Public
Views: 169
Comments:
Favorites: 0
Downloads: 14
View Details:
169 on Slideshare
0 from embeds
Slideshow Transcript
- Slide 1: Modular arithmetic and trap
door ciphers
Prof. Joshua Holden, Rose-Hulman Inst. of Tech.
http://www.rose-hulman.edu/Ëœholden
Modular arithmetic and trap door ciphers – p.1/31
- Slide 2:RSA Setup
Ronald Rivest, Adi Shamir, Leonard Adleman,
1977.
Pick two primes and .
Â
¡
Compute .
¢
Â
¡
£
Pick encryption exponent such that and