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

View Sample PDF

Author(s): Narayanankutty Karuppath (Amrita Vishwa Vidyapeetham, India)and P. Achuthan (Amrita Vishwa Vidyapeetham, India)
Copyright: 2011
Pages: 9
Source title: Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives
Source Author(s)/Editor(s): Raghu Santanam (Arizona State University, USA), M. Sethumadhavan (Amrita University, India)and Mohit Virendra (Brocade Communications Systems, USA)
DOI: 10.4018/978-1-60960-123-2.ch016

Keywords: Digital Crime & Forensics / Information Science Reference / IT Security and Ethics / Security & Forensics

Purchase

View Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications on the publisher's website for pricing and purchasing information.

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.

The IRMA Community

Research IRM

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

Purchase

Abstract

Related Content

IRMA Sponsors