Presenter(s)

    Maximo Gonzalez

    Comments

    9:00-10:15, Kennedy Union Ballroom

    Download

    Download Project (290 KB)

    Description

    This project explores key mathematical components of public key cryptography, which is widely used to secure digital communications. The necessary mathematical tools are reviewed, including the topic of prime numbers and the Miller–Rabin primality test. One-way functions based on modular exponentiation are also covered, as well as the Diffie-Hellman algorithm which generates a secret key that is known to only the intended sender and receiver utilizing modular exponentiation. These topics are integral to demonstrate public key cryptography and how it is implemented using the RSA (Rivest–Shamir–Adleman) cryptosystem.

    Publication Date

    4-23-2025

    Project Designation

    Capstone Project

    Primary Advisor

    Arthur H. Busch

    Primary Advisor's Department

    Mathematics

    Keywords

    Stander Symposium, College of Arts and Sciences

    The Mathematics of RSA: Primality Testing, One-Way Functions and Key Exchange

    Share

    COinS