Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications

Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications

Narayanankutty Karuppath, P. Achuthan
ISBN13: 9781609601232|ISBN10: 1609601238|EISBN13: 9781609601256
DOI: 10.4018/978-1-60960-123-2.ch016
Cite Chapter Cite Chapter

MLA

Karuppath, Narayanankutty, and P. Achuthan. "Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications." Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives, edited by Raghu Santanam, et al., IGI Global, 2011, pp. 231-239. https://doi.org/10.4018/978-1-60960-123-2.ch016

APA

Karuppath, N. & Achuthan, P. (2011). Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications. In R. Santanam, M. Sethumadhavan, & M. Virendra (Eds.), Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives (pp. 231-239). IGI Global. https://doi.org/10.4018/978-1-60960-123-2.ch016

Chicago

Karuppath, Narayanankutty, and P. Achuthan. "Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications." In Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives, edited by Raghu Santanam, M. Sethumadhavan, and Mohit Virendra, 231-239. Hershey, PA: IGI Global, 2011. https://doi.org/10.4018/978-1-60960-123-2.ch016

Export Reference

Mendeley
Favorite

Abstract

The developments in quantum computing or any breakthrough in factorization algorithm would have far-reaching consequences in cryptology. For instance, Shor algorithm of factorizing in quantum computing might render the RSA type classical cryptography almost obsolete since it mainly depends on the computational complexity of factorization. Therefore, quantum cryptography is of immense importance and value in the modern context of recent scientific revolution. In this chapter, the authors discuss in brief certain fascinating aspects of Einstein-Podolsky-Rosen (EPR) paradox in the context of quantum cryptology. The EPR protocol and its connections to the famous Bell’s inequality are also considered in here.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.