Date of Award

12-18-2019

Document Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Computer Science

First Advisor

Daniel Berleant

Second Advisor

Kenji Yoshigoe

Abstract

Heuristic One-Time Pad (HOP) represents a methodology that is compliant with the requirements as established by Claude Shannon for a globally scalable and permanent encryption solution. The technique is not limited to encryption, rather, it also encompasses dynamic hashing and authentication. The two key Shannon-identified problems of continuous random number generation and secure distribution of encryption keys have been solved and are integral to the method. At each step of the algorithms, entropy is ‘1’ and unicity is ‘infinite’. All encryption key generation is independent of the value of the data being encrypted, and is dependent upon a combination of quasi-random data values and their respective matrix index values. The creation of functionally random numbers results from combining a plurality of quasi-random sources and breaking up any potential linear, sequential, or harmonic anomalies. This, in conjunction with a novel data shuffling and salting technique, ensures that the encryption cannot be attacked via frequency analysis or even brute force. Contrary to all previous versions of the One-Time Pad, HOP does not require large encryption keys to be themselves distributed across any medium, rather, the keys are generated exactly when and where they are needed. The footprint of HOP is small enough to support operation on systems as small as Internet of Things (IoT) and wireless sensors, while also being robust enough to handle the encryption needs of the largest supercomputers. Regarding speed, in direct head-to-head testing HOP is approximately 3.5 times faster than Advanced Encryption Standard (AES). With regards to key security, even if the encryption keys are stolen, they cannot be used by an unauthorized person or system to break the encryption. HOP represents a mathematically-proven uncrackable encryption system which is faster than the competition, runs on all platforms, is globally scalable, and is, as is intuitive from Shannon’s work, quantum as well as future proof. As such, it ends the historically perpetual cycle, or race-condition, of encryption algorithm creation and encryption algorithm breaking.

Download

Share

COinS