Date

Spring 4-26-2018

Document Type

Honors Project

First Advisor

Helmstutler, Randall

Department Chair or Program Director

Helmstutler, Randall

Degree Name

Bachelor of Science

Major or Concentration

Mathematics

Department or Program

Mathematics

Abstract

We introduce two non-commutative variations on the original Massey-Omura encryption system using conjugations in the symmetric group Sn. Patented in 1986, the original system was based on the cyclic group F* of units in a finite field F. In place of the abelian group F*, we will work in the non-abelian group Snusing disjoint permutations as well as maximal abelian subgroups in order to potentially create a more secure system. Introducing the non-abelian group Sn presents the need to create a keyspace of commuting permutations and abelian subgroups of sufficient size. We analyze the security of our modified systems by examining the bit-level security of each and susceptibility to standard message attacks. Additionally, we find that the keycount for the first system grows factorially with n. We show that the keycount for the second variation grows exponentially with n while improving on the first modification by allowing any number of users to participate in communication.

Language

English

Included in

Mathematics Commons

Share

COinS