Presentation + Paper
22 April 2020 Variable word length: a quantum-proof encryption solution
Author Affiliations +
Abstract
Quantum computing is coming; and, with it, the security of modern cryptography will be compromised. Technologies such as industrial control systems, banking, and smartphones depend on cryptography to ensure the confidentiality and integrity of operations. Any data sent over the internet relies on cryptography. In some cases, information is so sensitive that if the encryption is broken years in the future the results could be catastrophic. A post-quantum cryptographic solution is required today. Variable World Length is a proposed quantum-proof symmetric cryptography algorithm. It is low-labor, low-latency, and low-power; with a keyspace of 10511 in its simplest form (for comparison, AES-256 is 2256). Variable Word Length performs bit manipulation to send “words” of varied length. Without the key, an attacker would need to brute force all possible combinations. Due to the design of the algorithm, some of these combinations will decrypt real plaintext that was not the encrypted message. Additionally, the keyspace can be increased without an exponential tax on computing resources.
Conference Presentation
© (2020) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mitchell Palmer "Variable word length: a quantum-proof encryption solution", Proc. SPIE 11419, Disruptive Technologies in Information Sciences IV, 114190C (22 April 2020); https://doi.org/10.1117/12.2559740
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Cryptography

Quantum computing

Quantum cryptography

Computer security

Algorithm development

Computing systems

Control systems

Back to Top