Date of Award
2014
Document Type
Thesis
Degree Name
Bachelors
Department
Natural Sciences
First Advisor
Poimenidou, Eirini
Keywords
Cryptography, Abelian Groups, Applied Mathematics
Area of Concentration
Applied Mathematics
Abstract
The most common public key cryptosystems presently in use, such as the RSA algorithm, depend on the structure of abelian groups. Given the modern day strength of computing machinery, however, these systems are theoretically susceptible to attack. This thesis is a study of cryptosystems over group rings that do not necessarily depend on abelian groups, but rather may be implemented with non-abelian groups. Several cryptosystems will be introduced with the focus and the final examples on public key cryptosystems.
Recommended Citation
Moscardini, Helen, "GROUP RING CRYPTOGRAPHY" (2014). Theses & ETDs. 4912.
https://digitalcommons.ncf.edu/theses_etds/4912