The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Einstein-Podolsky-Rosen Paradox and Certain Aspects of Quantum Cryptology with Some Applications
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.
Related Content
|
Wassim Jaber.
© 2024.
24 pages.
|
|
Hussein A.H. Jaber, Zahraa Saleh, Wassim Jaber, Adnan Badran, Hatem Nasser.
© 2024.
17 pages.
|
|
Sakshi Garg, Kunal Arora, Sumita Singh, K. Nagarajan.
© 2024.
20 pages.
|
|
Wassim Jaber.
© 2024.
14 pages.
|
|
Ray Gutierrez Jr..
© 2024.
22 pages.
|
|
Wassim Jaber, Hussein A.H. Jaber, Ramzi Jaber, Zahraa Saleh.
© 2024.
16 pages.
|
|
Zahraa Saleh, Wassim Jaber, Ali Jaber, Edmond Cheble, Mikhael Bechelany, Akram Hijazi, David Cornu, Ghassan Mahmoud Ibrahim.
© 2024.
22 pages.
|
|
|