Digital signatures are growing in importance as a legal standing with traditional handwritten signatures, most secure web transactions today are already dependent on digital signatures, which are included as part of the digital certificates a server presents to a client identify. The digital certificates bind a key exchange algorithm with an identity and enable a receiver to verify the sender's digital signature, or as case when setting up a secure connection with a web server, enable a client to encrypt information.This paper, describes the quantum computing with the representation of quantum bit, then this paper explains the proposed algorithm which is serving digital signature under unsecure communication channel by applying the quantum key exchange algorithm which is more complex in degree of computational complexity in data security of client than the classical key exchange algorithm.
Digital signatures are growing in importance as a legal standing with traditional handwritten signatures, most secure web transactions today are already dependent on digital signatures, which are included as part of the digital certificates a server presents to a client identify. The digital certificates bind a key exchange algorithm with an identity and enable a receiver to verify the sender's digital signature, or as case when setting up a secure connection with a web server, enable a client to encrypt information.This paper, describes the quantum computing with the representation of quantum bit, then this paper explains the proposed algorithm which is serving digital signature under unsecure communication channel by applying the quantum key exchange algorithm which is more complex in degree of computational complexity in data security of client than the classical key exchange algorithm.
Quantum computation is a new field bridging many disciplines, including theoretical physics, functional analysis and group theory, electrical engineering, computer science, and quantum cryptography. The goal of this paper is to explore the base of quantum computation that serves to build up a secure algorithm for keys in the unsecured communication channel between two hosts (computers) by applying quantum key exchange algorithm which has highly guarantee protecting toward the computational complexity because the quantum key exchange algorithm is more complex in computation than the classical key exchange algorithm if it perform in classical computer. Also, this algorithm (key exchange algorithm) provides the ability to perform in quantum computer if will be available in future.
Security is the most common aspect of today's world, when all things are going to digitize then make them secure over the communication channel has become the prime aim of the digital service providers.Although many encryption and decryption techniques are available in the field of the cryptography, but they all are based on mathematical calculation which are difficult to solve but not impossible.The all existing techniques can be break by using quantum computer and some extra efforts.But Quantum Cryptography that is free from the mathematical calculations and large prime number factorization is solution of this type of problems.Quantum Cryptography based on the laws of physics and quantum mechanics which gives the most secure way of encryption and decryption.In this paper Key Generation and Exchanging of Key is implemented by using Visual Basic software to secure the digital data over the communication channel.Quantum cryptography will use Photons to transmit the information over the channel which are polarized at different orientation which are 00,450,900 and 1350 from sender at some basis and these polarized information is received by second party at other end and receiver will match the received photon with his photon on his basis and matched photons will form the Key, and if anyone try to hack that information both parties will come to know about the hacking.
Signature schemes, proposed in 1976 by Diffie and Hellman, have become ubiquitous across modern communications. They allow for the exchange of messages from one sender to multiple recipients, with the guarantees that messages cannot be forged or tampered with and that messages also can be forwarded from one recipient to another without compromising their validity. Signatures are different from, but no less important than encryption, which ensures the privacy of a message. Commonly used signature protocols—signatures based on the Rivest–Adleman–Shamir (RSA) algorithm, the digital signature algorithm (DSA), and the elliptic curve digital signature algorithm (ECDSA)—are only computationally secure, similar to public key encryption methods. In fact, since these rely on the difficulty of finding discrete logarithms or factoring large primes, it is known that they will become completely insecure with the emergence of quantum computers. We may therefore see a shift towards signature protocols that will remain secure even in a post-quantum world. Ideally, such schemes would provide unconditional or information-theoretic security. In this paper, we aim to provide an accessible and comprehensive review of existing unconditionally securesecure signature schemes for signing classical messages, with a focus on unconditionally secure quantum signature schemes.
In recent years, there has been ample research on quantum computing technology that uses quantum mechanics to solve complex mathematical problems that are difficult for classical computers to solve. Currently, digital communication has been secured by many of the public-key cryptosystems that could be compromised by quantum computers. The objective of post-quantum cryptography (also called quantum-resistant cryptography) in cryptographic systems is to protect information against quantum and classical computers. This paper proposes the use of post-quantum cryptographic (PQC) algorithms in digital signature applications over classical cryptographic algorithms to obtain confidentiality and integrity against quantum computers. To promote PQC in electronic signature applications (e-Sign), we developed a platform (QEsign) to illustrate and analyze the available PQC algorithms to evaluate the performance of the signing time required for a digital signature certificate (DSC) generation in the eSign system. Furthermore, QEsign also provides a provision to generate the CSR (Certificate Signing Request) by providing certificate subject information, which will be exploited to issue the DSC signed by post-quantum algorithms, and the evaluation report will be visualized using a graphical representation.
Signatures are primarily used as a mark of authenticity, to demonstrate that the sender of a message is who they claim to be. In the current digital age, signatures underpin trust in the vast majority of information that we exchange, particularly on public networks such as the internet. However, schemes for signing digital information, which are based on assumptions of computational complexity, are facing challenges from advances in mathematics, the capability of computers, and the advent of the quantum era. Here, the authors present a review of digital signature schemes, looking at their origins and where they are under threat. Next, the authors introduce post-quantum digital schemes, which are being developed with the specific intent of mitigating against threats from quantum algorithms while still relying on digital processes and infrastructure. Finally, the authors review schemes for signing information carried on quantum channels, which promise provable security metrics. Signatures were invented as a practical means of authenticating communications, and it is important that the practicality of novel signature schemes is considered carefully, which is kept as a common theme of interest throughout this review.
We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different people, and all will agree either that the message came from Alice or that it has been tampered with. To accomplish this task, each recipient of the message must have a copy of Alice's "public key," which is a set of quantum states whose exact identity is known only to Alice. Quantum public keys are more difficult to deal with than classical public keys: for instance, only a limited number of copies can be in circulation, or the scheme becomes insecure. However, in exchange for this price, we achieve unconditionally secure digital signatures. Sending an m-bit message uses up O(m) quantum bits for each recipient of the public key. We briefly discuss how to securely distribute quantum public keys, and show the signature scheme is absolutely secure using one method of key distribution. The protocol provides a model for importing the ideas of classical public key cryptography into the quantum world.