Terry Watson, David Montes De Oca and Kanwalinderjit Kaur Gagneja*

Department of Computer and Electrical Engineering and Computer Science California State University, Bakersfield, USA

*Corresponding Author: Kanwalinderjit Kaur Gagneja, Department of Computer and Electrical Engineering and Computer Science California State University, Bakersfield, USA.

Received: December 14, 2021; Published: March 17, 2022

Abstract

In current computing methods, encryption is widely used and highly valued. Encryption complexity has developed and progressed greatly since the creation of the Internet. This is mainly due to the higher demand for security and privacy amongst the Internet's users. The increase in demand for security has also led to an increase in demand for services capable of breaking this security. That led to the race of encryption vs. code-breaking. Modern encryption methods are highly advanced and difficult to break but come with the caveat of needing higher and higher processing power and time to complete, especially on large data sets. Thereby necessitating a new approach. The proposed approach uses the character shift to decrease the time it takes for an encryption approach to complete in a distributed way. This approach requires long strings of characters and shifting them/transforming them to properly show that this methodology saves time.

Keywords: Cryptography; Distributed Encryption; Time; Runtime; Code-breaking