An exotic fieldtrip through cryptography

The extenion of RSA encryption

Bachelor thesis (2023)

Authors

W.H. van Barneveld Electrical Engineering, Mathematics and Computer Science

Contributors

N.D. Verhulst Discrete Mathematics and Optimization - EEMCS (mentor)
J.A.M. de Groot Mathematical Physics - EEMCS (mentor)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2023 Lisa van Barneveld
More Info
expand_more

Published Date

05-07-2023

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

One of the first systems developed to provide online security is what is now known as RSA encryption. This method has been first published by Rivest, Shamir and Adleman in 1978. Even on this day, a modification of the first method of RSA encryption is being used and considered safe. This paper explores a number of mathematical structures and describes whether or not it could be possible to extend RSA encryption. In this paper we will focus on verifying whether the RSA encryption and decryption algorithms are well defined on the mathematical structures.