Abstract
dc:description.abstractAs our world becomes increasingly digital, data security becomes key. Data must be encrypted such that it can be easily encrypted only by the intended recipient. Arnold Transformations are a useful tool in this because of its unpredictable periodicity. Our goal is to outline a method for choosing an Arnold Transformation that is both secure and easy to implement. We find the necessary and sufficient condition that a key matrix has periodicity. The chosen key matrix has a random structure, and it has a periodicity that is sufficiently high. We apply this method to several image and data string examples to evaluate its effectiveness.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Mathematics (M.S.)
- Level thesis:degree_level
- Thesis (open access)
- Discipline thesis:degree_discipline
- Department of Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Anderson, Haley N
- Contributors dc:contributor
-
- Martha Abell
- Yongki Lee
Subjects
dc:subject × 9Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.georgiasouthern.edu/etd/2323