Quick Upload

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
Post to Twitter Post to Twitter
Share on Facebook
Myspace Hi5 Friendster Xanga LiveJournal Facebook Blogger Tagged Typepad Freewebs BlackPlanet gigya icons

Modular Arithmetic and Trap Door Ciphers

from joshuarbholden, 3 months ago Add as contact

169 views | 0 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!

Embed customize close
 

Categories

Education

Groups/Events

More Info

This slideshow is Public

Views: 169 Comments: 0 Favorites: 0 Downloads: 14

View Details: 169 on Slideshare 0 from embeds
Flagged as inappropriate Flag as inappropriate

Flag as inappropriate

Select your reason for flagging this slideshow as inappropriate.

If needed, use the feedback form to let us know more details.

Slideshow Transcript

  1. 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
  2. Slide 2:RSA Setup Ronald Rivest, Adi Shamir, Leonard Adleman, 1977. Pick two primes and .   ¡ Compute . ¢   ¡ £ Pick encryption exponent such that and