Classical Cryptography: Classical cryptography is based on the mathematics and it relies on the computational difficulty of factorizing large number. The security of classical cryptography is based on the high complexity of the mathematical problem for the instance factorization of large number.
Quantum Cryptography: Quantum Cryptography is based on physics and it relies on the laws of quantum mechanics. It is arising technology which emphasizes the phenomena of quantum physics in which two parties can have secure communication based on the invariability of the laws of the quantum mechanics.
Comparisons between Classical Vs. Quantum Cryptography:
|Classical Cryptography||Quantum Crptography|
|It is based on mathematical computation.||It is based on quantum mechanics.|
|It is widely used.||It is sophisticated.|
|Digital signature is present.||Digital signature is absent.|
|Bit rate depends on computational power.||Average bit rate is 1 MBPS.|
|Bit storage 2n n-bit strings.||Bit storage one n-bit string.|
|Communication range is millions of miles.||Communication range is maximum 10 miles.|
|Deployed and tested.||In initial stages, not tested fully.|
|Required up gradation as computing power increases.||It is based in physics laws.|
|Communication medium independent.||Communication medium dependent.|
|Expenditure is very less.||Expenditure is high.|
- Classical Cryptography and Quantum Cryptography
- Quantum Cryptography
- DNA Cryptography
- Cryptography and its Types
- RSA Algorithm in Cryptography
- Cryptography Introduction
- Development of Cryptography
- The CIA triad in Cryptography
- Difference between Steganography and Cryptography
- Easy Key Management in Cryptography
- Bifid Cipher in Cryptography
- Vernam Cipher in Cryptography
- Image Steganography in Cryptography
- Birthday attack in Cryptography
- Avalanche Effect in Cryptography
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.