Superposition as a Means of Data Encryption in N-Dimensional Value Spaces
Keywords:Post-Quantum, Cryptography, Superposition, Encryption, Algorithm, Hashing
The objective of this study was to provide a new method for creating quantum-proof encryption algorithms. I accomplished this by designing a symmetric 2-key cryptosystem that exploits the superposition principle to encrypt data in multi-dimensional value spaces.
The proposed cryptosystem substitutes characters for frequencies, as determined by two private keys: component wave order key (CWOK) and character transmission order key (CTOK). A CWOK defines the values and theoretical spatial arrangement of frequencies in a complex wave. A CTOK defines the unique arrangement of system characters (i.e., characters in an encoding scheme such as ASCII), determined by a hash function, to identify a user. Combining the CWOK and CTOK, we construct a character-lookup table (CLT), which defines the character-frequency relationships used to generate a substitution cipher. A cipher’s frequency values must be superimposed in accordance with the CWOK. Fast Fourier Transforms are used during the decryption stage to perform complex wave analysis.
Complex waves can have n! frequency configurations, where n = the number of component frequencies; each CTOK can have a! character configurations, where a = the number of characters defined in an encoding scheme. Therefore, by requiring n ≥128 and using the ASCII encoding scheme (a = 128), there are n!+a!=128!+128!=2*128! possible key configurations for any given cipher. This is approximately 3.330284e+138 times as many key configurations possible with AES 256.
Exploiting the multi-dimensional nature of complex waves, and combining these techniques with other powerful encryption algorithms used today, it appears likely that we can create a quantum-proof cryptosystem.
D. Moody and A. Robinson, "Cryptographic Standards in the Post-Quantum Era," in IEEE Security & Privacy, vol. 20, no. 6, pp. 66-72, Nov.-Dec. 2022, doi: 10.1109/MSEC.2022.3202589.
U. Altun, G. Karabulut Kurt and E. Ozdemir, "The Magic of Superposition: A Survey on Simultaneous Transmission Based Wireless Systems," in IEEE Access, vol. 10, pp. 79760-79794, 2022, doi: 10.1109/ACCESS.2022.3195056.
D. Upadhyay, N. Gaikwad, M. Zaman and S. Sampalli, "Investigating the Avalanche Effect of Various Cryptographically Secure Hash Functions and Hash-Based Applications," in IEEE Access, vol. 10, pp. 112472-112486, 2022, doi: 10.1109/ACCESS.2022.3215778.comi
Dai H. Harmonic pitch: dependence on resolved partials, spectral edges, and combination tones. Hear Res. 2010 Dec 1;270(1-2):143-50. doi: 10.1016/j.heares.2010.08.002. Epub 2010 Aug 13. PMID: 20709166; PMCID: PMC3703502.
Nathan Lenssen & Deanna Needell, "An Introduction to Fourier Analysis with Applications to Music," Journal of Humanistic Mathematics, Volume 4 Issue 1 (January 2014), pages 72-91. DOI: 10.5642/ jhummath.201401.05. Available at: https://scholarship.claremont.edu/jhm/vol4/iss1/5
J. F. Dooley, History of cryptography and cryptanalysis codes, ciphers, and their algorithms, 1st ed. Cham, Switzerland: Springer, 2018.
J. Copeland, “Alan Turing: The codebreaker who saved 'millions of lives',” BBC News, 19-Jun-2012. [Online]. Available: https://www.bbc.com/news/technology-18419691. [Accessed: 23-Jan-2023].
S. Singh, The code book: The science of secrecy from Ancient Egypt to Quantum Cryptography. New York City, New York: Anchor Books, a division of Random House, Inc, 2000.
S. Devi and K. Harika, “AES encryption and decryption standards,” International conference on computer vision and machine learning, 2019. [Online]. Available: https://iopscience.iop.org/article/10.1088/1742-6596/1228/1/012006/pdf. [Accessed: 25-Jan-2023].
D. Shores, “The Evolution of Cryptography Through Number Theory,” 30-Nov-2020. [Online]. Available: https://www.gcsu.edu/sites/default/files/documents/2021-06/shores.pdf. [Accessed: 25-Jan-2023].
Li Q, Meng X, Yin Y, Wu H. A Multi-Image Encryption Based on Sinusoidal Coding Frequency Multiplexing and Deep Learning. Sensors (Basel). 2021 Sep 15;21(18):6178. doi: 10.3390/s21186178. PMID: 34577385; PMCID: PMC8470889.
A. Vaishnavi and S. Pillai, “Cybersecurity in the quantum era-a study of perceived ... - iopscience,” Journal of Physics: Conference Series, 2021. [Online]. Available: https://iopscience.iop.org/article/10.1088/1742-6596/1964/4/042002. [Accessed: 25-Jan-2023].
Drzazga, B.; Krzywiecki, Ł. Review of Chosen Isogeny-Based Cryptographic Schemes. Cryptography 2022, 6, 27. https://doi.org/10.3390/ cryptography6020027
S. Islam and S. Islam, “A comparative study on discrete fourier transformation for digital signal analysis,” ResearchGate, Oct-2019. [Online]. Available: https://www.researchgate.net/publication/338626068_A_Comparative_Study_on_Discrete_Fourier_Transformation_for_Digital_Signal_Analysis. [Accessed: 14-Mar-2023].
G. H. Wakefield, “Fourier series and the discrete Fourier transform: Quick primer,” University of Michigan, 2001. [Online]. Available: https://www.eecs.umich.edu/courses/eecs206/public/lec/wakefield,fs,dft.pdf. [Accessed: 14-Mar-2023].
R. Baraniuk, “Continuous Time Fourier transform (CTFT),” Engineering LibreTexts, 22-May-2022. [Online]. Available: https://eng.libretexts.org/Bookshelves/Electrical_Engineering/Signal_Processing_and_Modeling/Signals_and_Systems_(Baraniuk_et_al.)/08:_Continuous_Time_Fourier_Transform_(CTFT)/8.02:_Continuous_Time_Fourier_Transform_(CTFT). [Accessed: 14-Mar-2023].
G. Singh and Supriya, “A Study of Encryption Algorithms (RSA, DES, 3DES and AES) for Information Security,” CiteSeerX, Apr-2013. [Online]. Available: https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=187d26258dc57d794ce4badb094e64cf8d3f7d88. [Accessed: 25-Mar-2023].
How to Cite
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Proceedings of the West Virginia Academy of Science applies the Creative Commons Attribution-NonCommercial (CC BY-NC) license to works we publish. By virtue of their appearance in this open access journal, articles are free to use, with proper attribution, in educational and other non-commercial settings.