Security In Quantum Computing.pdf

SECURITY IN QUANTUM COMPUTING Presented to: Dr. Ibrahim Gomaa Presented by: Gerges Morad Nada Hussein  Agenda 1 Introduction 2 Classical Computing vs Quantum...

SECURITY IN QUANTUM COMPUTING Presented to: Dr. Ibrahim Gomaa Presented by: Gerges Morad Nada Hussein  Agenda 1 Introduction 2 Classical Computing vs Quantum Computing 3 Principles of Quantum Computing 4 Effects of Quantum on Classical Cryptographic 5 Classical Cryptographic Algorithms 6 Quantum Security 7 Quantum Supremacy 8 References Introduction Introduction Cryptography plays a major role for ensuring the privacy and security of online communications and transactions. Cryptographic-based algorithms are used by industries along with government firms to establish an authentic and confidential communication having the presence of integrity in it. However, with the increase in the advance communications and computing systems, it is easy to break algorithms within a fraction of seconds. QUANTUM COMPUTING ▪ Quantum computer is the next generation of computing. ▪ Quantum computing based upon quantum physics uses subatomic particles, such as electrons or photons. ▪ The development of Quantum computing became very easy to solve the complex mathematical problems within a limited period of time. ▪ Quantum computing has the capability to sift through huge numbers of possibilities and extract potential solutions to complex problems and challenges. Classical Computing vs Quantum Computing  Quantum Computing vs. Classical Computing Quantum Computing Classical Computing Use quantum bits or qubits that can represent both 0 and 1, which Use bits that can only represent either 0 or 1. can exist in multiple states simultaneously due to superposition. Classical bits are independent and not entangled with each Qubits can become entangled, where the state of one qubit other. depends on the state of another, even when separated. Have two possible states which is either 0 or 1. Have infinite possible states since it can hold combinations of 0, 1 along with some complex information. Relies on cryptographic algorithms which are secure against Can potentially break classical cryptographic systems using quantum classical attacks but vulnerable to quantum attacks. algorithms.  Challenges Facing Supercomputers Weather and Climate Modeling: Simulating 1 complex atmospheric processes and climate change scenarios requires massive computational power. Protein Folding: Predicting the 3D structure 2 of proteins is crucial for drug discovery and understanding diseases, but it's computationally intensive.  Challenges Facing Supercomputers Quantum Mechanics Simulations: Modeling 3 the behavior of quantum systems accurately demands significant computational resources. Astrophysics and Cosmology: Modeling the 4 behavior of galaxies, black holes, and the early universe involves complex calculations that strain conventional computers. Advantages of Quantum Computing Solving Exponential optimization Speedup problems Improved Parallelism Encryption Disadvantages of Quantum Computing High Cost Environmental Impact Ethical and Technical Security Complexity Concerns Principles of Quantum Computing  Principles of Quantum Computing SUPERPOSITION ENTANGLEMENT DECOHERENCE Qubits can represent Quantum entanglement occurs numerous possible when two systems link so The decoherence theory will combinations of 1 and 0 at closely that knowledge about revert the quantum system back the same time. one gives you immediate to classical through interactions knowledge about the other. with the environment. This ability to simultaneously be in Used to enable quantum When quantum state loses its multiple states is called parallelism, which is the superposition state, it returns to superposition. ability of quantum computers the classical state which is to perform multiple known as decoherence. To put qubits into calculations simultaneously. superposition, researchers manipulate them using Allows quantum computers to precision lasers or manipulate many qubits in a microwave beams. single operation. Brute-Force In 2023 Short key lengths may be susceptible to brute-force attacks Effects of Quantum on Classical Cryptography Effects of Quantum on Classical Cryptography let's consider the case of brute forcing a password of 4 bits: A 4-bit password means there are 2^4 = 16 possible combinations. Quantum computer could find the correct combination in a single step. This is because a 4-qubit quantum computer can simultaneously represent all 16 possible combinations due to superposition. Classical Cryptographic Algorithms  Classical Cryptographic Algorithms The most common encryption algorithms Data Encryption Standard (DES) 1 key length was 56 bits In 1999, it took just 22 hours to hack a DES system. (Now, just 6 min) 2 Triple DES (3DES) It encrypts, decrypts, and re-encrypts data hence the name.  Classical Cryptographic Algorithms Rivest Shamir Adleman (RSA) 3 Based on the mathematical challenges. Key size between 2048 and 4096 bits. Already broken in the year of 2010. 4 Advanced Encryption Standard (AES) Depend on the challenges of integer factorization and discrete logarithms. Quantum Security  Quantum Security The threat to current cryptographic systems by quantum computers is already a reality. Therefore, preparations are needed by investing in quantum-resistant cryptographic algorithms and protocols. The National Institute of Standards and Technology (NIST) started researching which resulted in a domain called Post Quantum Cryptography (PQC).  Post-quantum Cryptography (PQC) PQC is a cryptographic system that came into existence with the evolution of quantum computers. It is an algorithm that resists quantum attacks. Classical computers cannot break classical encryption algorithms, but quantum computers are very strong at breaking the base of cryptographic algorithms. Hence, it is required to replace classical encryption algorithms with PQC algorithms. The PQC is classified into four cryptosystems:  Post-quantum Cryptography (PQC) Rainbow It is a multivariate PQC algorithm proposed by D. Schmidt and J. Ding which came into existence in 2005. It is one of the NIST projects. It has 207 classical bits and 169 qubits. McEliece It is a code-based cryptosystem developed by RobertMcEliece. This algorithm is having an issue of heavy key length which makes it very difficult to use in embedded devices. The process of decryption and encryption is very fast compared to RSA algorithms.  Quantum Security Quantum security is based on the use of quantum key distribution (QKD) Quantum key distribution (QKD) is a secure communication method that uses quantum mechanics principles to enable two parties to produce a shared random secret key known only to them, which can then be used to encrypt and decrypt messages. QKD relies on the principles of quantum mechanics to provide provably unbreakable security guarantees, even in the presence of an eavesdropper, who has unlimited computational power. Quantum Supremacy  Quantum Supremacy Quantum supremacy is the experimental demonstration of a quantum computer's dominance and advantage over classical computers by performing calculations previously impossible at unmatched speeds.  Quantum Supremacy Google Roadmap for Quantum Computer https://quantumai.google/ References  References S. Sharma · K. R. Ramkumar · A. Kaur · T. Hasija · S. Mittal. (2023). Post-quantum Cryptography: A Solution to the Challenges of Classical Encryption Algorithms. India: Chitkara University Institute of Engineering & Technology. Dam, D.-T. (2023, August 14). A Survey of Post-Quantum Cryptography: Start of a New Race. What is Quantum Security? (n.d.). Retrieved from nomios: https://www.nomios.com/resources/what-is- quantum-security/ Anderson, R. (2023, April 24). How Long Does It Take a Hacker to Brute Force a Password in 2023. Retrieved from netsec.news: https://www.netsec.news/how-long-does-it-take-a-hacker-to-brute-force- a-password-in-2023/ THANK YOU