Abstract Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails. With encryption being the dominant method of cloud data security, the advent of quantum computing implies an urgent need to proffer a model that will provide adequate data security for both classical and quantum computing. Thus, most cryptosystems will be rendered susceptible and obsolete, though some cryptosystems will stand the test of quantum computing. The article proposes a model that comprises the application of a variant of McEliece cryptosystem, which has been tipped to replace Rivest–Shamir–Adleman (RSA) in the quantum computing era to secure access control data and the application of a variant of N-th degree truncated polynomial ring units (NTRU) cryptosystem to secure cloud user data. The simulation of the proposed McEliece algorithm showed that the algorithm has a better time complexity than the existing McEliece cryptosystem. Furthermore, the novel tweaking of parameters S and P further improves the security of the proposed algorithms. More so, the simulation of the proposed NTRU algorithm revealed that the existing NTRU cryptosystem had a superior time complexity when juxtaposed with the proposed NTRU cryptosystem.
Abstract Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails. With encryption being the dominant method of cloud data security, the advent of quantum computing implies an urgent need to proffer a model that will provide adequate data security for both classical and quantum computing. Thus, most cryptosystems will be rendered susceptible and obsolete, though some cryptosystems will stand the test of quantum computing. The article proposes a model that comprises the application of a variant of McEliece cryptosystem, which has been tipped to replace Rivest–Shamir–Adleman (RSA) in the quantum computing era to secure access control data and the application of a variant of N-th degree truncated polynomial ring units (NTRU) cryptosystem to secure cloud user data. The simulation of the proposed McEliece algorithm showed that the algorithm has a better time complexity than the existing McEliece cryptosystem. Furthermore, the novel tweaking of parameters S and P further improves the security of the proposed algorithms. More so, the simulation of the proposed NTRU algorithm revealed that the existing NTRU cryptosystem had a superior time complexity when juxtaposed with the proposed NTRU cryptosystem.
Data security in the cloud has a been major issue upon the inception of cloud computing, frameworks have been proposed and implemented yet data breach prevails. With encryption being the dominant method of cloud data security, the advent of quantum computing implies that there is an urgent need to come up with an improved system that will provide adequate data security for both cloud and quantum computing. However, some cryptosystems will be rendered susceptible and obsolete although, some cryptosystems will stand the test of quantum computing. This paper proposes an optimised system for cloud data security using McEliece and NTRU cryptosystems for data security in cloud and quantum computing. While a of McEliece cryptosystem will be used for securing user credentials, a variant of NTRU will also be used for securing user data.
Since the dawn of the web and its widespread usage, privacy of data has been a significant problem. Multiple systems have been suggested; however, data breaches still happen often. The advent of quantum science suggests a pressing need to develop a paradigm that would provide acceptable security of information for both conventional and quantum computer technology, since encrypting is now the most popular way of cloud data protection. Thus, although some encrypted systems will withstand the test of the quantum computer, the majority will become vulnerable and out-of-date. The article suggests a model that entails using an instance of the McElwee digital currency to secure restricted data, which is expected to displace Rivest Shamir Ad in the age of quantum science, and a version of the extent shortened dependent ring units' digital currency to safeguard cloud customer information. The suggested McElwee technique's modelling revealed that it had a lower temporal complexity than the current McElwee cryptosystem. The reliability of the suggested algorithms is further enhanced by the new tuning of the values for Sand P. Furthermore, the simulation of the suggested NTRU technique showed that, when compared to the current NTRU cryptosystem, the new NTRU system had a better time hardness.
The emergence of quantum computing is a serious threat to the principles of modern crypto-logical mathematics. The classical public-key cryptography, including Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Diffie-Hellman are very safe against classical adversaries yet become susceptible to quantum algorithms, including the Shor algorithm, which can easily solve the underlying mathematical problems. This weakness is jeopardizing confidentiality and integrity of the world-wide systems of communication, money transactions, and essential structures, and requires the immediate creation of safe alternatives. The current literature on post-quantum cryptography (PQC) has covered various classes of algorithm, such as lattice-based, code-based, multivariate schemes, and isogeny-based schemes. Although lattice-based approaches like Nth Degree Truncated Polynomial Ring Unit (NTRU) and FrodoKEM can be highly theoretically resistant, they can be computationally and memory-intensive. Cryptosystems based on code such as Classic McEliece are secure but not practicable because they have huge public key sizes. Multivariate schemes like Rainbow, and isogeny-based schemes like Super singular Isogeny Key Encapsulation (SIKE) have been attacked recently by cryptanalytic attacks, and broken completely. Such restrictions open the necessity to find more efficient and secure quantum-resistant solutions.This research study postulates a hybrid post-quantum cryptographic (PQC) system that combines CRYSTALS-Kyber for encryption with CRYSTALS-Dilithium for digital signatures both of which are approved through the National Institute of Standards and Technology (NIST) PQC standardization program. The model will be such that it ensures quantum resistance but at the same time it will be scalable, efficient and compatible with the existing infrastructures. The test outcomes indicate that the hybrid PQC model is 35-45 percent faster to encrypt and decrypt, signature performance is enhanced by up to 40 percent, and the throughput is 20 times higher (98.7 Mbps) than the same base PQC scheme including Nth Degree Truncated Polynomial Ring Unit (NTRU), McEliece and Rainbow. These enhancements affirm that the suggested model provides a viable trade-off between the security, speed, and efficiency in terms of key size, which makes it a viable and a sound base to ensure secure communication in the quantum age.
The safety and security of various cryptosystems are related to the hardness of the integer factorization problem and discrete logarithm problem, most cryptosystems will be rendered vulnerable to attack and outdated as quantum computers become more advanced.This study examines lattice-based cryptography (the NTRU cryptosystem), compares the suggested variation to other cryptosystems by simulation and presents the execution time for key generation, encryption, and decryption procedures, as well as to highlight the benefits and drawbacks of the proposed cryptosystem.A variant of the NTRU cryptosystem is developed with the purpose of improving the cryptosystem's security by allowing it to withstand attacks in both classical and quantum computing.The simulation revealed that the existing NTRU cryptosystem has a better time complexity compared to the proposed NTRU cryptosystem.The existing NTRU cryptosystem has a time complexity of O(n 2 ) while the proposed variant has O(n 3 ).Though had a better capacity of handling large data because of the introduction of lattice multiplication.
Cryptographic design and analysis play a key role in securing communication through untrusted channels.This need is even more pronounced with the advent of cloud-centric environments.Symmetric encryption techniques can deliver high computational efficiencies only if the distribution and management of keys are secured.Public key cryptographic systems such as RSA and Elliptic Curve Cryptography (ECC), which have been the mainstay, are at risk due to arrival of quantum computers that can solve the integer factorization and discrete logarithm problems efficiently.Although post-quantum cryptography has made some breakthroughs, the lattice-based schemes still have to contend with difficulties such as heavy computation requirements, difficulty in choosing parameters, high power consumption, and low security-performance tradeoff.If lattices parameters are not properly set, they may not withstand lattice attacks and computational efficiency will also be degraded, limiting factor for their use in cloud environments.This study, in the quest for a solution, recommends the usage of N-th degree Truncated Polynomial Ring Units (NTRU) cryptosystem which is optimized by adjusting key parameters like lattice dimension (N), modulus (q), and small modulus (p) determining a Hermite factor (𝛿)-based approach.A metaheuristic optimization technique, Electric Eel Foraging Optimization (EEFO), is used to effectively balance security strength, correctness, and computational efficiency.Also, a new cryptographically strong and quantum-resistant key exchange capability is provided by the Improved Supersingular Isogeny Diffie-Hellman (ISIDH) protocol.The experiments have shown method to have an encryption strength of 0.95, an average success rate of 93.47%, and reduced energy consumption of 0.00085, thereby proving its efficiency.
ABSTRACT Nowadays, securing data in the cloud is a challenging task; hence, many studies are being conducted on the use of cryptographic techniques for authentication‐based cloud data security. Apart from traditional cryptographic techniques, data encryption can also utilize certain physical principles of quantum models, known as cryptography. In the existing method, the secure quantum key distribution for cloud data security (SQKD‐CDS) model has high computational complexity and low storage efficiency. However, the quantum cryptography‐based cloud security (QC‐CSM) model uses an optical fiber connection to prevent attackers from altering the secret key shared with the network. This paper presents a novel model called enhanced non‐Abelian NTRU (N‐th degree truncated polynomial ring encryption) (En‐naNTRU) with supersingular isogeny key exchange (SIKE). SIKE's function is to generate a secure key exchange mechanism; thus, it communicates with two parties using a shared session key. This session key acts as a symmetric key for encrypting messages. However, the En‐naNTRU uses this session key to encrypt and decrypt the message securely. The En‐naNTRU handles both encryption and decryption mechanisms. Thus, the integrated method combines and ensures robust security against both quantum and classical threats. The proposed model evaluates computation time, integrity score, encryption and decryption time, processing time, and memory utilization and compares the performance of integrity‐based encryption to attribute‐based encryption. Therefore, the proposed model reduces time complexity and effectively outperforms both classical and quantum security.