In this paper, we discuss some problems in modern key distribution cryptography such as Diffie-Hellman key distribution and compare with quantum key distribution cryptography which has potential of replacing the typical algorithms due to the fact that they use natural properties of physics like not being able to be cloned or copied.
This article is devoted to the current problem - the distribution of keys in cryptographic systems. In the work, two basic methods of key distribution, which are currently used in the designof cryptographic systems, are examined and compared in detail. The Diffie-Hellman algorithmis the primary key distribution method in existing protocols for automated distributed systems.The technologies of quantum cryptography are getting more and more development and require analysis and comparison with other methods of classical cryptography regarding competitiveness.
Quantum cryptography has become a subject of widespread interest. In particular, quantum key distribution, which provides a secure key agreement by using quantum systems, is believed to be the most important application of quantum cryptography. Quantum key distribution has the potential to achieve the “unconditionally” secure infrastructure. We also have many cryptographic tools that are based on “modern cryptography” at the present time. They are being used in an effort to guarantee secure communication over open networks such as the Internet. Unfortunately, their ultimate efficacy is in doubt. Quantum key distribution systems are believed to be close to practical and commercial use. In this paper, we discuss what we should do to apply quantum cryptography to our communications. We also discuss how quantum key distribution can be combined with or used to replace cryptographic tools based on modern cryptography.
Quantum key distribution (QKD) is the objects of close attention and rapid progress due to the fact that once first quantum computers are available – classical cryptography systems will become partially or completely insecure. The potential threat to today’s information security cannot be neglected, and efficient quantum computing algorithms already exist. Quantum cryptography brings a completely new level of security and is based on quantum physics principles, comparing with the classical systems that rely on hard mathematical problems. The aim of the article is to overview QKD and the most conspicuous and prominent QKD protocols, their workflow and security basement. The article covers 17 QKD protocols and each introduces novel ideas for further QKD system improvement.
Most cryptographic mechanisms, such as symmetric and asymmetric cryptography, often involve the use of cryptographic keys. However, all cryptographic techniques will be ineffective if th e key distribution mechanism is weak. The security of most modern cryptographic systems of key distribution mechanism is based on computational co mplexity and the extraordinary time needed to break the code. Quantum Key Distribution (QKD) or Quantum Cryptography is attracting much attention as a solution of the problem of key distribution; QKD of fers unconditionally secure communication based on quantum mechanics. In this article we survey the mo st popular QKD protocols. Also, we give a short state of the art of Quantum Cryptography.
The advancement of the quantum computing is challenging the foundation of the cryptography by its almost unlimited computation power to predict the secure key that is thought to be absolutely secure based on the currently used algorithms such as the RSA and the Diffie-Hellman and others. The field of quantum cryptography on the other hand is providing the needed highly secure keys through the introduction of quantum key distribution QKD when the quantum computing becomes a reality. However, the quantum cryptography and the QKD are challenged in many ways, not only to provide the advanced level of technology but also to overcome many constraints to provide a worldwide practical distribution system as well as to provide the efficiency to overcome the very modest size of the quantum keys. In this paper, practical factors affecting realistic QKD are investigated supported by related simulation based analysis.
Broadly, Cryptography refers to the passing of secret information from one place to another securely so that only intended receivers can decrypt it. Security of the modern public key cryptographic algorithms and protocols is mainly dependent on the complexity of the factorization of the product of large prime numbers. But due to technological developments in the field of computation and evolution of new mathematical techniques, the problem of the factorization of the product of integers is not complex anymore nowadays. The growing research interests in Quantum computing technology is also making the modern public cryptographic algorithms unsafe. Researchers have proved that modern cryptographic algorithms such as RSA are breakable using quantum computers in polynomial time complexity. Therefore, attempts are being made to design new cryptographic algorithms using Quantum Computing techniques. Quantum cryptography is an emerging field which works on principles of quantum physics. In this paper, an attempt has been made to introduce quantum cryptography, analysis on supremacy of quantum cryptography over modern cryptography, discussion on key distribution using quantum physics, and implementation challenges in quantum key distribution. We have proposed two key verification mechanisms for BB84 protocol, analysis on quantum attacks on modern cryptographic digital signatures, Post-quantum digital signatures and finally discussion on future directions of this technology.