Abstract 【Objective】 Combining ECC and OPT, a novel elliptic curve algorithm was proposed, which can effectively resist the reverse calculation of quantum computer and ensure the security of private key. 【Method】 On the basis of elliptic curve encryption algorithm, OPT algorithm was introduced to protect the private key. 【Result】 The signature and verification of messages can be successfully completed by the repeated algorithm on Python platform. Finally, the algorithm is proved to be safe under Shor algorithm and quantum computer attack through algorithm theory. 【Conclusion】 ECC combined with OPT encryption algorithm can effectively resist reversible computation of functional quantum devices, prevent eavesdroppers from forging signatures, and ensure the security of modern public key cryptosystems.
Abstract 【Objective】 Combining ECC and OPT, a novel elliptic curve algorithm was proposed, which can effectively resist the reverse calculation of quantum computer and ensure the security of private key. 【Method】 On the basis of elliptic curve encryption algorithm, OPT algorithm was introduced to protect the private key. 【Result】 The signature and verification of messages can be successfully completed by the repeated algorithm on Python platform. Finally, the algorithm is proved to be safe under Shor algorithm and quantum computer attack through algorithm theory. 【Conclusion】 ECC combined with OPT encryption algorithm can effectively resist reversible computation of functional quantum devices, prevent eavesdroppers from forging signatures, and ensure the security of modern public key cryptosystems.
Abstract The notion of a quantum computer is no longer just theoretical. It is the most significant technology in the world, and nations are competing to become the leaders in quantum computing. The computing time will be cut down from years to hours or even minutes thanks to technology. The scientific community will greatly benefit from the capabilities of quantum computing. It does, however, represent severe risks to cyber security. All encryption algorithms are theoretically prone to damage. Compared to RSA-based cryptosystems, elliptic curve cryptography (ECC) is quicker, more effective, and more sensitive to quantum attacks. Standard ECC is still unworthy of establishing a secure network connection, nonetheless. The improved ECC method is used to extend the communication strategy, reconfiguring the message with the number of cipher-text from both sides. Therefore, we need to carefully evaluate the quantum security of EECC to prepare for the advent of quantum computers. In this, work a new strategy (CQAEECC) known as a collaborative quantum-assisted Extended Elliptic Curve Cryptography (EECC) to protect the transmission of information across networks. The mechanism of merging cryptographic methods and the private key is retrieved from the Quantum Cryptography used by Extended Elliptic Curve Cryptography to ensure greater security over networks. The novel cryptography is compared with standard algorithms and the results show that it is one of the most efficient public key cryptosystems (PKC) for desirable security. Thereupon, the proposed method has the ability to ensure confidentiality, integrity, and availability over the network.
With the rise of quantum computing, traditional cryptographic algorithms, such as the Elliptic Curve Digital Signature Algorithm (ECDSA), face potential vulnerabilities. Quantum computers could efficiently solve problems that are currently computationally infeasible for classical computers, thus threatening the security of cryptographic systems. As a result, there is a pressing need to develop quantum- resistant cryptographic algorithms to ensure secure communication in a future where quantum computing is prevalent. ECDSA, widely used for securing digital communications, relies on elliptic curve cryptography to provide robust security through digital signatures. However, the advent of quantum computing poses a significant threat to ECDSA's security, as quantum algorithms such as Shor's algorithm could break the elliptic curve-based encryption by efficiently solving discrete logarithm problems. To address this issue, we propose a quantum-resistant cryptographic algorithm based on lattice-based cryptography. Our approach utilizes the Learning With Errors (LWE) problem, known for its resistance to quantum attacks. We implement the proposed algorithm and compare its performance with ECDSA in terms of key generation time, signing time, and verification time. The algorithm's security is analyzed against quantum attacks using theoretical and empirical methods. The experimental results demonstrate that the quantum-resistant algorithm provides a comparable level of security to ECDSA while offering significant advantages in the context of quantum resistance. Specifically, our quantum-resistant algorithm achieved key generation times of 120 ms, signing times of 150 ms, and verification times of 100 ms. In comparison, ECDSA showed key generation times of 80 ms, signing times of 90 ms, and verification times of 70 ms. Despite these performance trade-offs, the quantum resistance of the proposed algorithm ensures future-proof security for digital communications.
The rapid advancements in quantum computation pose significant threats to traditional cryptographic systems, such as those used in the Internet of Things (IoT). RSA and methods like Elliptic Curve Cryptography (ECC) are particularly vulnerable to quantum algorithmic techniques, such as Shor’s and Grover’s algorithms. This paper focuses on the analysis of cryptographic models based on quantum technologies, with special emphasis on IoT security. It examines how both symmetric and public-key cryptography are affected by quantum comput-ing—highlighting vulnerabilities in symmetric schemes to Grover’s algorithm and in public-key systems like ECC to Shor’s algorithm. Significant focus is placed on the advancement of quantum-resistant ECC, with an in-depth evaluation of its effectiveness, security capabilities, and suitability for IoT applications. This work also compares various methods for implementing quantum-enhanced ECC, considering both software and hardware solutions. Furthermore, the paper explores emerging hybrid systems that integrate classical and quantum-resistant encryption to offer enhanced security in transitional scenarios. Lastly, it outlines potential research avenues for developing new techniques to protect future IoT networks from quantum-based attacks.
We propose and develop new schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\\^ut's construction of public key cryptosystems using supersingular elliptic curve isogenies. We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies. We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption. Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem. We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies.
Abstract: Traditional encryption systems, like RSA and ECC (Elliptic Curve Cryptography), are in big danger because quantum computing is getting better and faster. These systems are the foundation of safe messaging today. Using algorithms like Shor's and Grover's, quantum computers might be able to break many of the most common encryption methods. So, people who work with cryptography are doing a lot of study on quantum-resistant cryptography (QRC) to come up with methods that will still work even when quantum computers are used. This essay looks at and rates different quantum- resistant encryption methods with the main goal of finding the best ones for protecting the next generation of communication systems. It looks at various types of algorithms, such as hash-based cryptography, code-based cryptography, multivariate quadratic equations, and lattice-based cryptography. It rates their pros and cons in terms of security, computational efficiency, and usefulness in real life. The study also talks about the problems and trade-offs that come with switching to quantum-resistant cryptography. For example, some methods need very large key sizes and a lot of computing power. We look at what groups like the National Institute of Standards and Technology (NIST) are doing to make post-quantum cryptography methods more uniform. Lastly, the study looks into the future of safe communication and stresses how important it is to use mixed cryptosystems that combine traditional methods with algorithms that can't be broken by quantum computers. To keep interactions safe in a world after quantum computing, strong, flexible, and effective encryption methods will become more and more important.