Title

RSA: Keeping Your Secrets Secret - Part 2

Document Type

Oral Presentation

Location

SURC 140

Start Date

17-5-2012

End Date

17-5-2012

Abstract

Public key cryptography has become essential for modern communications, being used for everything from credit card transactions to top secret military communiqués. In this presentation, we will discuss a popular public key cryptosystem first described in the late seventies by Ron Rivest, Adi Shamir, and Leonard Adleman called RSA. In particular, we will discuss its major strengths and weaknesses along with the basic encryption and decryption algorithms. We will also discuss a simple factoring algorithm used to break RSA in special cases known as Pollard's p-1 attack. Naturally, finding a way to protect against such an attack is important, so we will introduce strong primes, and a method for generating them which turns out to be extraordinarily useful in defending against Pollard's p-1 and similar attacks.

Faculty Mentor(s)

Stuart Boersma

Additional Mentoring Department

Mathematics

This document is currently not available here.

Share

COinS
 
May 17th, 3:40 PM May 17th, 4:00 PM

RSA: Keeping Your Secrets Secret - Part 2

SURC 140

Public key cryptography has become essential for modern communications, being used for everything from credit card transactions to top secret military communiqués. In this presentation, we will discuss a popular public key cryptosystem first described in the late seventies by Ron Rivest, Adi Shamir, and Leonard Adleman called RSA. In particular, we will discuss its major strengths and weaknesses along with the basic encryption and decryption algorithms. We will also discuss a simple factoring algorithm used to break RSA in special cases known as Pollard's p-1 attack. Naturally, finding a way to protect against such an attack is important, so we will introduce strong primes, and a method for generating them which turns out to be extraordinarily useful in defending against Pollard's p-1 and similar attacks.