Augmenting AES to Quantum Safe level with No-Sum Sequence
Quantum computing is a potential method for addressing complicated issues, such as encryption. Quantum computers' speed poses a challenge to traditional cryptography. The No-Sum sequence-based cryptosystem is a novel quantum-resistant private-key cryptosystem that is suggested. This approach raises the computing resources required to defend against quantum computer-assisted brute-force attacks. The Advanced Encryption Standard (AES) algorithm is used widely in symmetric cryptography. In this article, we discuss various flavors of No-Sum (NS) sequences, these sequences increase the computational resource requirement against the quantum computer-assisted brute-force attack. The proposed process is divided into two phases: the first phase involves the traditional confidential 256-bit key, which we will refer to as the principal key. This primary key will be used for generating three diverse types of NS sequences to serve as a secondary key. By combining these primary and secondary keys, a composite new secret key will be formed and utilized in the first round AES protocol. In phase two regular AES procedures are performed with a composite key. The proposed modified AES cryptosystem illustrates the ability of the NS sequence in the field of a quantum-resistant cryptosystem.
Authors
- Anjan Biswas (ORCID: https://orcid.org/0000-0002-8131-6044)
- A. John Peter (ORCID: https://orcid.org/0000-0001-6882-2391)
- Raman Singh (ORCID: https://orcid.org/0000-0002-6839-5454)
- Bharat S. Rawal (ORCID: https://orcid.org/0000-0002-9456-7010)
- Songjie Liang
Institutions
- Grambling State University (US)
- University of the West of Scotland (GB)
Publication Details
- Published
- 2024-10-04
- DOI
- https://doi.org/10.1109/mac61551.2024.10837288
- Citations
- 1
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.35