IJISCS | 162 DATA LOSS PREVENTION USING POST QUANTUM CRYPTOGRAPHY: OVERVIEW OF ROUND-3 ALGORITHMS Augustine Chidiebere Onuora 1 , Prince Ana 2 , Anthony O. Otiko 3 Chibuike Ezeocha Madubuike 4 1, 4 Department of Computer Science, Akanu Ibiam Federal Polytechnic Unwana. Ebonyi State, Nigeria. 2,3 Department of Computer Science, Cross River State University of Technology, Cross-River State, Nigeria. *Corresponding author holyaustin@yahoo.com aconuora@akanuibiampoly.edu.ng Article history: Received July 13, 2021 Revised October 25, 2021 Accepted November 1, 2021 Keywords: KEM; PKE; Post quantum Cryptography; Digital Signature; Quantum Security; Cryptosystem. Abstract The current hype of quantum computing has necessitated the need for computer security stakeholders to call for the design of security algorithms that will be quantum efficient when quantum computers finally grace our computing sphere. Recent advancements in quantum computing have made cryptographic schemes more vulnerable to quantum attacks like Shor’s algorithm and Grove’s algorithm. Therefore NIST call for a new set of algorithms known as Post-Quantum cryptography that would be quantum proof is imminent. Many Post quantum algorithms have been designed and tested. But only few of them made it to the round 3 (the final round). This paper reviewed these post quantum candidates. Literatures highlighting their scheme, properties, implementation and areas of security coverage was reviewed. Recommendations on future research areas in this field was itemized for this novel security paradigm as we await the final standardization of this cryptosystems. 1.0. INTRODUCTION Cryptography can be referred to as the science of information hiding. When information is on transit from point A to Point B, it can be intercepted but when intercepted, the intruder is unable to understand the information. The intended recipient is the only one that can decipher the message using a key [1]. Post Quantum cryptography is the application of existing cryptographic algorithms or the design of new algorithms that are quantum proof [2]. The marriage of quantum theory in physics with computer science is known as quantum computing. Instead of bits, quantum computers use qubits. Unlike traditional computers, they do not use the two-state position of 0s and 1s. Quantum computers encode data using a four- state superimposition. On data processing devices, the four states of quantum computer qubits are represented as ions, atoms, photons, or electrons. Because of its ability to represent data in multiple states, a quantum computer will presumably be more powerful than even the most powerful supercomputer [3]. For some times now, quantum computers – machines that use quantum mechanical concepts to solve mathematical problems that are complicated or impossible for normal computers – have gotten a lot of press. If quantum computers are ever mass produced, many of the current public-key cryptosystems will be broken [4]. The security and privacy of electronic communications on the Internet and elsewhere will be compromised as a result. This will not be funny when it eventually happens. To this effect, The objective of post-quantum cryptography Full Paper eISSN 2598-246X pISSN 2598-0793 IJISCS (International Journal of Information System and Computer Science)