Back to search

University of Nevada - Reno

Permutation Steganography in Many Systems

Abstract

dc:description.abstract

The newest method we wish to offer to the world of steganography and cryptology makes use of permutations. The initial idea of permeation steganography was developed independently by Peter Hendrickson (1). Here we extended on his idea by adding composition of permutations into the reply step. We have also included cycle notation; this allows for more freedom and saves bandwidth.

Degree

thesis:*
Level thesis:degree_level
Master's Degree
Department thesis:degree_department
Mathematics and Statistics
Year dc:date.issued
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rudebusch, William
Advisor dc:contributor.advisor
  • Keppelmann, Edward C.
Committee members dc:contributor.committeemember
  • quint, thomas
  • louis, sushil

Subjects

dc:subject × 6

Rights

dc:rights
Statement dc:rights
  • In Copyright(All Rights Reserved)
  • Author(s)

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/11714/3960

Chain of custody

source
Harvested from
University of Nevada - Reno
Base URL
scholarwolf.unr.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Rudebusch, William. Permutation Steganography in Many Systems. Master's Degree thesis, 2011. http://hdl.handle.net/11714/3960