Verifiable quantum key negotiation method
A quantum key agreement and quantum technology, applied to key distribution, can solve the problems of lack of legal identity of participants and correctness verification of session keys, difficulty in ensuring fairness of participants, etc.
Patent Information
- Authority / Receiving Office
- CN · China
- Current Assignee / Owner
- Publication Date
- 2020-03-27
Abstract
Description
technical field
[0001] The invention belongs to the application field of modern cryptography, in particular to a verifiable quantum key agreement method. Background technique
[0002] Key management is one of the most critical issues in modern cryptography, involving key generation, distribution, storage, application, etc. At present, many security applications on the Internet use public key encryption algorithms to distribute session keys. However, with the introduction of quantum computers and quantum fast algorithms, classical cryptographic algorithms, including symmetric encryption algorithms (such as DES, AES) and public key encryption algorithms (such as RSA, ECC), are facing huge security challenges.
[0003] On the other hand, the emergence of quantum cryptography has brought a new dawn to the field of security. Quantum cryptography is the product of the combination of quantum mechanics and modern cryptography. Its security is guaranteed by the basic principles of...
Examples
Embodiment Construction
[0083] In this implementation case, a verifiable quantum key agreement method is applied to two participants, Alice and Bob, and a public network connecting the two participants, where the public network includes public quantum channels and public The classical channel, the classical channel is proposed relative to the quantum channel; the verifiable quantum key agreement method is carried out according to the following steps:
[0084] Step 1: Initialization phase:
[0085] Participant Alice and participant Bob share a 2m-bit master key k face-to-face (offline) AB =k AB [1]||k AB [2]||…||k AB [i]||…||k AB [m], where k AB [i] represents the master key of the i-th bit, and k AB [i]∈{00, 01, 10, 11}, 1≤i≤m, || represents a string connector, for example, assuming that the master key share of the first bit is 00, then k AB [1]=00, the purpose of this step is to realize the initialization of the whole verification process;
[0086] Step 2: Participant Alice and participant B...