Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications
Publication Type:Book Chapter
Source:Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives: Applications and Perspectives, IGI Global, USA[Editors Dr. T. S. Raghu, (Arizona State University, USA) and Dr. M. Sethumadhavan (Amrita), Dr. Mohit Virendra, (Brocade Communications Corp. USA)], p.231 (2010)
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.
Cite this Research Publication
Related Research Publications
- Quantum Non-Locality and Universe
- Diverse Spectroscopic Studies and First-Principles Investigations of the Zinc Vacancy Mediated Ferromagnetism in Mn-Doped ZnO Nanoparticles
- Foundational issues of Chaos and Randomness:" God or Devil, do we have a Choice?"
- The Einstein relation in quantum wires of III-V, ternary, and quaternary materials in the presence of light waves: Simplified theory, relative comparison, and suggestion for experimental determination
- A Prototype for Tiger Hash Primitive Hardware Architecture