Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications
Source abstract
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.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References
Reference metadata was not supplied for this record.