Back to search

Georgia Southern University

Arnold Transformations as Applied to Data Encryption

Abstract

dc:description.abstract

As 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 × 9

Rights

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.georgiasouthern.edu/etd/2323

Chain of custody

source
Harvested from
Georgia Southern University
Base URL
digitalcommons.georgiasouthern.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Anderson, Haley N. Arnold Transformations as Applied to Data Encryption. Thesis (open access) thesis, https://digitalcommons.georgiasouthern.edu/etd/2323