Method for realizing two-party efficient quantum key agreement by using fewer sub-channels
By performing identity authentication in the registry and using Bell state and tensor product, the problem of inefficient quantum key negotiation in the prior art is solved, and high-efficiency quantum key negotiation between limited quantum users and quantum users is achieved. It achieves 80% qubit efficiency and provides resistance to attacks.
Patent Information
- Application Number
- CN202411029870.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-30
- Publication Date
- 2024-11-15
AI Technical Summary
When using entangled resources, the existing quantum key negotiation technology increases the number of quantum channels used and the encoding efficiency is not high, especially in the communication between limited quantum users and quantum users.
By implementing participant identity authentication in the registry, combining Bell state and tensor product, quantum key negotiation is used to use fewer quantum channels, and efficient key negotiation is achieved by using Bell measurement results to derive the other party The measurement result is obtained, thereby obtaining the same key.
It achieves higher quantum bit efficiency, up to 80%, and effectively resists internal and external attacks, providing new ideas for secure communication between limited quantum users and quantum users.
Smart Images

Figure CN118972046A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the field of quantum information, and in particular to a secure communication method. Background Art
[0002] Quantum key agreement (QKA) technology uses the principles of quantum mechanics to securely generate and share keys. QKA uses the uncertainty principle of quantum mechanics and quantum entanglement resources to achieve key agreement.
[0003] Some references [1-3] use the unique properties of quantum entanglement resources to achieve two-party key negotiation, such as cluster states [1], six-particle entangled states [2], and Bell states [3]. He and Ma [1] used Pauli operations to encode four-particle cluster states and used multiple quantum channels to achieve two-party QKA, with a quantum bit efficiency of 26.67%; Jiang et al. [2] used unitary operations to encode six-particle entangled states and used multiple quantum channels to achieve two-party QKA, with a quantum bit efficiency of 22.22%; Wang et al. [3] used Pauli operations to encode Bell states and used five quantum channels to achieve two-party cyclic authentication QKA, with a quantum bit efficiency of 16.67%.
[0004] In the two-party key negotiation, the unitary operation and Pauli operation are used to encode the entangled resources. When exchanging entangled resources, the number of quantum channels used will increase, and the coding efficiency is not high. In addition, the participants in the literature [1-3] are quantum users, while this method considers the communication between restricted quantum users and quantum users.
[0005] Based on this, this method combines the actual situation and proposes an efficient QKA using only one quantum channel between restricted quantum users. This method not only realizes the identity authentication of participants, but also integrates the tensor product with the Bell state, and obtains a QKA with a quantum bit efficiency of 80% based on the measurement results.
[0006] References
[0007] [1]Ye-Feng He,Wen-Ping Ma.Quantum key agreement protocols with four-qubit cluster states[J].Quantum Inf.Process.14(9),3483–3498(2015).
[0008] [2]She-Xiang Jiang, Lei Fang, Xian-Jin Fang.Two-party Quantum KeyAgreement with Six-particle Entangled States Against Collective Noise[J].Int.J.Theor.Phys.62(11),235(2023).
[0009] [3]Chaonan Wang, Qian Zhang, Shufan Liang, Hongfeng Zhu.Secure mutual authentication quantum key agreement scheme for two-party setting with keyrecycling[J].Quantum Inf.Process.23(4),139(2024). Summary of the invention
[0010] The present invention aims to realize participant identity authentication in combination with a third-party registration center, use Bell states and tensor products, and use fewer quantum channels to realize two-party secure quantum key negotiation, providing a new idea for secure communication of restricted quantum users. A method for realizing efficient two-party quantum key negotiation using fewer quantum channels is proposed. The technical solution of the present invention is as follows:
[0011] A method for realizing efficient quantum key negotiation between two parties using fewer quantum channels comprises the following steps:
[0012] Step 1: Alice and Bob complete registration at the registration center R using a secure channel;
[0013] Step 2: When Alice and Bob attempt to negotiate a key, they send their biometrics to R again to authenticate their identities.
[0014] Step 3: Alice prepares Bell states and groups them, performs tensor product and sends part of the sequence to Bob. Alice and Bob use the Bell measurement results to infer each other's measurement results and thus obtain the same key.
[0015] Furthermore, the step 1: Alice and Bob complete registration on the registration center R using a secure channel, specifically including the following steps:
[0016] A1, Alice and Bob send <ID A ,BIO A > and <ID B ,BIOB >send to R;
[0017] A2 and R return a and b for Alice and Bob respectively:
[0018] (1) R calculates generate(BIO A )→(P A ,R A ), generate RN A ,calculate storage <a,ID A ,P A ,R A > and send a to Alice via a secure channel;
[0019] (2) R calculates generate(BIO B )→(P B ,R B ), generate RN B ,calculate storage <b,ID B ,P B ,R B > and sends b to Bob via a secure channel.
[0020] Furthermore, in step 2, when Alice and Bob attempt to negotiate a key, they send the biometric feature to R again to implement identity authentication, which specifically includes the following steps:
[0021] B1, Alice, and Bob try to negotiate a key and send information to R through a normal channel:
[0022] (1) Alice calculates Generate q1 and calculate Send using normal channel <HID A ,BIO A ,A1,T A > to R;
[0023] (2) Bob calculates Generate q2 and calculate Send using normal channel <HID B ,BIO B ,B1,T B > to R;
[0024] B2 and R return RQ to Alice and Bob respectively A and RQ B :
[0025] (1) R judges T A ′-T A<ΔT, if satisfied, calculate ID′ A Otherwise, Alice is asked to resend. R retrieves ID′ from the database A If it exists, proceed to the next step, otherwise ask Alice to re-register. R calculates reproduce(BIO′ A ,P A )→(R′ A ) and judge distance(R A ,R′ A )<t, if it satisfies, it means Alice’s identity is real. R calculates q1 and sends To Alice;
[0026] (2) R judges T B ′-T B <ΔT, if satisfied, calculate ID′ B , otherwise ask Bob to resend. R retrieves ID′ in the database B If it exists, proceed to the next step, otherwise ask Alice to re-register. R calculates reproduce(BIO′ B ,P B )→(R′ B ) and judge distance(R B ,R′ B )<t, if it satisfies, it means Bob’s identity is real. R calculates q2 and sends To Bob;
[0027] B3. Alice’s calculation Get Q AB =H(q1||q2), Bob calculates Get Q AB =H(q1||q2).
[0028] Q AB =Q AB [1]||...||Q AB [j]||...||Q AB [2N] (1)
[0029] Furthermore, the step 3: Alice prepares Bell states and groups them, performs tensor product and sends part of the sequence to Bob, Alice and Bob calculate each other's measurement results through the Bell measurement results, thereby obtaining the same key, specifically includes the following steps:
[0030] C1、Alice according to Q AB Preparation of 2N groups of Bell state BS;
[0031]
[0032] C2. Alice performs tensor product on the i-th group and the N+i-th group of BS to obtain TP[i]:
[0033]
[0034] After performing the tensor product, Alice divides BS into two groups, S1 and S2:
[0035]
[0036] C3. Alice randomly prepares N single-photon states |D> and randomly inserts them into S2 to obtain S2′, records the insertion position, initial state and measurement basis, and then sends S2′ to Bob through the quantum channel.
[0037] After confirming that Bob has received S2′, Alice informs him of the insertion position and measurement basis. Bob removes |D> from S2′ according to the insertion position to obtain S2. Bob uses the correct measurement basis to measure |D> to obtain the single-photon measurement result and announces the measurement result. Alice compares the initial preparation state with Bob's measurement result and calculates the error rate. If the error rate is lower than the threshold, Alice proceeds to the next step. Otherwise, Alice re-prepares the Bell state and distributes it.
[0038] C4, Alice, and Bob group S1 and S2 respectively and perform Bell measurements:
[0039] (1) Alice divides S1 into AS1 and AS2, and Bob divides S2 into BS1 and BS2:
[0040]
[0041] (2) Alice jointly measures P i [1] and P N+i [1] Get the measurement result MS A [i] Alice obtains the measurement result MS A ; Bob jointly measures P i [2] and P N+i [2] Get the measurement result MS B [i], Bob obtains the measurement result MS B :
[0042]
[0043] C5, Alice according to MS A and Q AB Derivation of MS B , Bob according to MS B and QAB Derivation of MS A , Alice and Bob obtain the negotiated key K A and K B :
[0044] Alice obtains MS B [i] The specific process is as follows: calculate K A [i] = MS A [i]||MS B [i] Get K A :
[0045] (1) MS A [i] = ab, then MS B [i] = ab;
[0046] (2) MS A [i] = ab, then
[0047] (3) MS A [i] = ab, then
[0048] (4) MS A [i] = ab, then
[0049] Bob gets MS A [i] Similarly, calculate K B [i] = MS A [i]||MS B [i] Get K B :
[0050] (1) MS B [i] = ab, then MS A [i] = ab;
[0051] (2) MS B [i] = ab, then
[0052] (3) MS B [i] = ab, then
[0053] (4) MS B [i] = ab, then
[0054] Negotiate the key K A =K B :
[0055]
[0056] The advantages and beneficial effects of the present invention are as follows:
[0057] 1. Combined with actual communication, fully consider the user role: In some two-party key negotiation documents, Alice and Bob are both quantum users. However, in actual communication, there is a situation where one party is a quantum user and the other is a restricted quantum user. Therefore, this method fully considers the operations that restricted quantum users can perform and combines some operations to achieve two-party quantum key negotiation;
[0058] 2. Combine FE to implement identity authentication for Alice and Bob: In B2, R first determines whether the timestamp ΔT meets the requirements, and then further searches for the identity ID in the database. If the retrieval is successful, the reproduce() algorithm is used to determine the Hamming distance. When the Hamming distance is less than the tolerance value, RQ is returned to Alice and Bob respectively. A and RQ B ;
[0059] 3. Use tensor product to achieve key negotiation: Some key negotiation literature uses unitary operation and Pauli operation to encode entangled resources, while in C2, this method only needs to perform tensor product operation on the prepared Bell state, making full use of the entanglement characteristics of the four Bell states and Bell measurement, and performing key negotiation based on the measurement results;
[0060] 4. Use fewer quantum channels: In C3, Alice uses a quantum channel to send S2′ to Bob, and then Alice and Bob respectively perform Bell measurements to achieve two-party quantum key negotiation. Compared with some two-party quantum key negotiation literature, the present invention uses fewer quantum channels to complete the two-party key negotiation.
[0061] 5. Obtaining a higher quantum bit efficiency η: In C5, Alice and Bob each obtain a negotiated key of length 4N. According to the quantum bit efficiency It can be calculated
[0062] Where c, q, and b represent the final negotiated key length, the amount of quantum resources consumed, and the number of classical bits used to decrypt the final negotiated key, respectively.
[0063] 6. Resistance to common internal and external attacks: Although the third party R knows the initial Bell state information, during the key negotiation process between Alice and Bob, R cannot obtain information such as the position of the single-photon state and the measurement basis, so it can effectively resist R's attack; in addition, external attackers other than Alice, Bob and R cannot obtain the initial Bell state information, nor can they obtain information such as the position of the single-photon state and the measurement basis, so they cannot implement interception-measurement-retransmission attack and interception-entanglement-measurement attack; BRIEF DESCRIPTION OF THE DRAWINGS
[0064] Figure 1 The present invention provides a preferred embodiment of the overall framework diagram of using fewer quantum channels to achieve efficient quantum key negotiation between two parties;
[0065] Figure 2 It is the simulation running result. DETAILED DESCRIPTION
[0066] The following will describe the technical solutions in the embodiments of the present invention in detail in conjunction with the accompanying drawings in the embodiments of the present invention. The described embodiments are only part of the embodiments of the present invention.
[0067] The technical solution of the present invention to solve the above technical problems is:
[0068] As attached Figure 1 As shown in the figure, a method for realizing efficient quantum key agreement between two parties using fewer quantum channels includes the following three steps, and a pseudo code based on Python software is given in combination with Netsquid:
[0069] 1. As attached Figure 1 As shown in step 1, Alice and Bob complete the registration at the registration center R:
[0070] 1) The registration center R uses the fuzzy extractor to calculate the reconstruction parameters and private features of Alice and Bob;
[0071] extractor=FuzzyExtractor(N,N / 2)
[0072] RA,PA=extractor.generate(BIO_Alice)
[0073] RB,PB=extractor.generate(BIO_Bob)
[0074] 2) R returns a and b for Alice and Bob respectively:
[0075] RN_binary_A=".join(random.choice('01')for_in range(4*N))
[0076] print('len(RN_binary_A)',len(RN_binary_A))
[0077] RN_binary_B=".join(random.choice('01')for_in range(4*N))
[0078] a=hash_fuction(bitwise_XOR(ID_binary_A,RN_binary_A),N)
[0079] b=hash_fuction(bitwise_XOR(ID_binary_B,RN_binary_B),N)
[0080] 2. As attached Figure 1 As shown in step 2, when Alice and Bob attempt to negotiate a key, they again send their biometrics to R for identity authentication:
[0081] 1) R returns RQ for Alice A , returns RQ for Bob B Similarly:
[0082] #Alice's ID exists in the database
[0083] key_RA=extractor.reproduce(BIO_Alice_new,PA)
[0084] if key_RA==RA:
[0085] print("Alice's identity is real!")
[0086] RA_qa=bitwise_XOR(A1,hash_fuction((HIDA+a),N))
[0087] RQA=bitwise_XOR(q2,hash_fuction((a+ID_binary_A+RA_qa),N))
[0088] 2) Alice gets Q AB =H(q1||q2), Bob gets Q AB =H(q1||q2);
[0089] Alice_q2=bitwise_XOR(RQA,hash_fuction((a+ID_binary_A+q1),N))
[0090] Alice_QAB=hash_fuction((q1+Alice_q2),N)
[0091] print('Alice_QAB:',Alice_QAB)
[0092] Bob_q1=bitwise_XOR(RQB,hash_fuction((b+ID_binary_B+q2),N))
[0093] Bob_QAB=hash_fuction((Bob_q1+q2),N)
[0094] 3. As attached Figure 1 As shown in step 3, Alice prepares Bell states and groups them, performs tensor product and sends part of the sequence to Bob. Alice and Bob use Bell measurement results to infer each other's measurement results, thereby obtaining the same key:
[0095] 1) Alice prepares 2N groups of Bell states BS:
[0096] State,S1_Alice,S2_Alice=generate_bell_states(Alice_QAB)
[0097] 2) Alice performs tensor product on the i-th group and the N+i-th group of BS to obtain TP[i]:
[0098] # Divide BS into two groups S1_Alice and S2_Alice
[0099] State,S1_Alice,S2_Alice=generate_bell_states(Alice_QAB)
[0100] #Perform tensor product
[0101] State_a=State[:N]
[0102] State_b=State[N:]
[0103] tensor_products = []
[0104] for a,b in zip(State_a,State_b):
[0105] tensor_product = np.kron(a,b)
[0106] tensor_products.append(tensor_product)
[0107] 3) Alice prepares N single-photon states |D> and randomly inserts them into S2:
[0108] DS_Alice,PS_State_Alice,BS_Alice=generate_single_photon(Decoy_binary)
[0109] S2_Alice_Bob,insert_positions=insert_decoys(DS_Alice,S2_Alice)
[0110] #Bob removes the single photon state to obtain S2_Bob
[0111] S2_Bob=remove_decoys(S2_Alice_Bob,insert_positions)
[0112] #Alice calculates the error rate
[0113] Error=compare_single_photon(PS_State_Alice,PS_State_Bob)
[0114] 4) When the error rate is lower than the threshold, Alice and Bob perform Bell measurement:
[0115] AS1=S1_Alice[:N]
[0116] AS2=S1_Alice[N:]
[0117] BS1=S2_Alice[:N]
[0118] BS2=S2_Alice[N:]
[0119] #Alice and Bob obtain the measurement results MSA and MSB respectively
[0120] MSA=bell_measurement(AS1,AS2)
[0121] MSB=bell_measurement(BS1,BS2)
[0122] 5) Alice derives MSB to obtain the negotiated key KA, and Bob derives MSA to obtain the negotiated key KB:
[0123] MSB_Alice,KA=derive_MSB(Alice_QAB,MSA)
[0124] MSA_Bob,KB=derive_MSA(Bob_QAB,MSB_Alice)
[0125] #KA and KB should be equal, print output True
[0126] print('KA should equal to KB:',KA==KB)
[0127] The present invention realizes two-party quantum key negotiation using only one quantum channel, fully considers the communication between restricted quantum users and quantum users, uses tensor product and Bell state to obtain a negotiation key of length 4N, and uses Netsquid simulation between restricted quantum users and quantum users to achieve 80% quantum bit efficiency. Compared with other two-party quantum key negotiation methods, this method not only realizes participant identity authentication, but also can effectively resist common internal and external attacks, providing new ideas for two-party key negotiation.
[0128] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions.
[0129] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0130] The above embodiments should be understood to be only used to illustrate the present invention and not to limit the protection scope of the present invention. After reading the contents of the present invention, technicians can make various changes or modifications to the present invention, and these equivalent changes and modifications also fall within the scope defined by the claims of the present invention.
Claims
1. A method for realizing efficient quantum key negotiation between two parties using fewer quantum channels, characterized in that: The following steps are involved: Step 1. Alice and Bob complete registration on the registration center R using a secure channel; the participant Alice is a quantum user with quantum capabilities and can prepare, measure, and distribute quantum; the participant Bob is a restricted quantum user who cannot prepare quantum states, but can perform Bell measurements and single-photon measurements and all operations of classical users; the registration center R is a fully trusted registration center and uses the fuzzy extractor FE to complete the registration and authentication of Alice and Bob; Step 2: When Alice and Bob attempt to negotiate a key, they send their biometrics to the registration center R again to authenticate their identities. Step 3: Alice prepares Bell states and groups them, performs tensor product, and sends part of the sequence to Bob. Alice and Bob use the Bell measurement results to infer each other's measurement results, thereby obtaining the same key.
2. The method for realizing efficient two-party quantum key agreement using fewer quantum channels according to claim 1, characterized in that: Step 1: Alice and Bob complete registration at the registration center R using a secure channel, which specifically includes the following steps: A1, Alice, and Bob complete the registration using a secure channel, which includes dedicated lines, public key encryption, and on-site card activation: (1) Alice has an identity ID A and biometrics A , through a secure channel <ID A ,BIO A >send to R; (2) Bob holds an ID B and biometrics B , through a secure channel <ID B ,BIO B >send to R; A2 and R use a secure channel to return binary numbers a and b of length 4N to Alice and Bob respectively. Represents exclusive OR: (1) R calculates the reconstruction parameter P A and private feature R A , generate(BIO A )→(P A ,R A ), generate a random binary number RN of length 4N for Alice A ,calculate a,ID A ,P A ,R A >Store the binary number a in the database and send it to Alice via a secure channel; (2) R calculates generate(BIO B )→(P B ,R B ), generate a random binary number RN of length 4N for Bob B ,calculate Will <b,ID B ,P B ,R B >Store in the database and send the binary number b to Bob through a secure channel.
3. The method for realizing efficient two-party quantum key agreement using fewer quantum channels according to claim 2, characterized in that: Step 2: When Alice and Bob attempt to negotiate a key, they send biometrics to R again to perform identity authentication, which specifically includes the following steps: When B1, Alice and Bob try to negotiate a key, they send information to R and T through the normal channel respectively. A and T B Indicates a timestamp, and || indicates a connection symbol: (1) Alice receives a and calculates And generate a random binary number q1 with a length of 4N, calculate Send HID using normal channel A ,BIO A ,A1,T A > to R; (2) After receiving b, Bob calculates And generate a random binary number q2 with a length of 4N, calculate Send HID using normal channel B ,BIO B ,B1,T B > to R; B2 and R use the common channel to send RQ respectively A and RQ B For Alice and Bob: (1) R receives <HID A ,BIO A ,A1,T A >After that, determine the received timestamp T A ′ and the sent timestamp T A Is the difference less than ΔT, that is, T A ′-T A <ΔT. If satisfied, calculate Get ID′ A , otherwise ask Alice to resend; R retrieves ID′ in the database A , if it exists, proceed to the next step, otherwise ask Alice to re-register; R calculates reproduce(BIO′ A ,P A )→(R′ A ), if the Hamming distance satisfies distance(R A ,R′ A )<t means Alice’s identity is real, R calculates Get q1, send To Alice, assume that R has obtained q2 at this time; (2) R receives <HID B ,BIO B ,B1,T B >After that, determine the received timestamp T B ′ and the sent timestamp T B Is the difference less than ΔT, that is, T B ′-T B <ΔT;If satisfied, calculate Get ID′ B , otherwise ask Bob to resend; R retrieves ID′ in the database B If it exists, proceed to the next step, otherwise Bob is required to re-register; R calculates reproduce(BIO′ B ,P B )→(R′ B ), if the Hamming distance satisfies distance(R B ,R′ B )<t means Bob’s identity is real, R calculates Get q2, send To Bob; B3. Alice’s calculation Get q2, calculate Q AB =H(q1||q2) to get a binary number Q of length 4N AB ; Bob calculates Get q1, calculate Q AB =H(q1||q2);Q AB [j]∈{00,01,10,11}, j=1,2,…,2N. Q AB =Q AB [1]||...||Q AB [j]||...||Q AB [2N] (1)。 4. The method for realizing efficient two-party quantum key agreement using fewer quantum channels according to claim 1, characterized in that: Step 3: Alice prepares Bell states and groups them, performs tensor product and sends part of the sequence to Bob. Alice and Bob calculate each other's measurement results through Bell measurement results, thereby obtaining the same key, which specifically includes the following steps: C1、Alice according to Q AB Prepare 2N groups of Bell states BS, BS[j]∈{|β 00 >,|β 01 >,|β 10 >,|β 11 >}, j = 1, 2, ..., 2N; C2. Alice performs tensor product on the i-th group and the N+i-th group of BS to obtain TP[i], that is, There are N sets of tensor products in total, i = 1, 2, ..., N; After performing the tensor product, Alice divides BS into two groups, S1 and S2: C3. Alice randomly prepares N single-photon states |D>, |D>∈{|0>,|1>,|+>,|->}, randomly inserts N |D> into S2 to obtain S2′, and records the insertion position, initial state and measurement basis, and then sends S2′ to Bob through the quantum channel; After confirming that Bob has received S2′, Alice informs him of the insertion position and measurement basis. Bob removes |D> from S2′ according to the insertion position to obtain S2. Bob uses the correct measurement basis to measure |D> to obtain the single-photon measurement result and announces the measurement result. Alice compares the initial preparation state with Bob’s measurement result and calculates the error rate. If the error rate is lower than the threshold, she proceeds to the next step. Otherwise, Alice re-prepares the Bell state and distributes it. C4, assuming the error rate is lower than the threshold, Alice and Bob group S1 and S2 respectively and perform Bell measurement; C5, Alice according to MS A and Q AB Derivation of MS B , Bob according to MS B and Q AB Derivation of MS A , Alice and Bob obtain the negotiated key K A and K B , K A [i] and K B [i] belongs to the sixteen four-bit binary systems, namely K A [i],K B [i]∈{0000,0001,...,1111}, i=1,2,...,N:.
5. The method for realizing efficient two-party quantum key agreement using fewer quantum channels according to claim 4, characterized in that: The specific measurement requirements of C4 are as follows: (1) In S1, Alice denotes the first N particles as AS1 and the last N particles as AS2. Similarly, Bob divides S2 into BS1 and BS2: (2) In AS1 and AS2, Alice jointly measures P i [1] and P N+i [1] Get the measurement result MS A [i] Alice obtains the measurement result MS A ; In BS1 and BS2, Bob jointly measures P i [2] and P N+i [2] Get the measurement result MS B [i], Bob obtains the measurement result MS B , M.S. A [i],MS B [i]∈{|β 00 >,|β 01 >,|β 10 >,|β 11 >}, abbreviated as MS A [i],MS B [i]∈{00,01,10,11}:
6. The method for realizing efficient two-party quantum key agreement using fewer quantum channels according to claim 4, characterized in that: In step C5, Alice uses MS A and Q AB Derivation of MS B , Bob according to MS B and Q AB Derivation of MS A , Alice and Bob obtain the negotiated key K A and K B , specifically including: Indicates negation, if a=0 then a,b∈{0,1}, Alice obtains MS B [i] The specific process is as follows: (1) MS A If [i]=ab, then MS B [i]=ab; (2) MS A [i] = ab, then (3) MS A [i] = ab, then (4) MS A [i] = ab, then From this, Alice can calculate K A [i] = MS A [i]||MS B [i], thus we get K A ; Bob gets MS A [i] Similarly, the specific process is as follows: (1) MS B If [i] = ab, then MS A [i] = ab; (2) MS B [i] = ab, then (3) MS B [i] = ab, then (4) MS B [i] = ab, then From this, Bob can calculate K B [i] = MS A [i]||MS B [i], thus we get K B Here, K A and K B are equal, both are binary numbers of length 4N. At this time, Alice and Bob obtain the same key.
7. The method for realizing efficient two-party quantum key agreement using fewer quantum channels according to any one of claims 1 to 6, characterized in that: The fuzzy extractor FE and one-way hash function H(M) used by the registration center R are specifically: (1) The first algorithm of FE is the generate() function, which inputs the biometric feature BIO and outputs the reconstruction parameter P and the private feature R, i.e. generate(BIO)→(P,R); (2) The second algorithm of FE is the reproduce() function, which inputs the new biometric feature BIO′ and the reconstruction parameter P and outputs the new private feature R′, that is, reproduce(BIO′,P)→(R′). At this time, it is determined whether the Hamming distance distance(R,R′)<t is less than t, where t represents the fault tolerance value; (3) H(M) is a one-way hash function that converts a message M into a binary number H(M) of length 4N. A one-way hash function means that it is computationally infeasible for an attacker to find the original input M of H(M) in probabilistic polynomial time. A one-way hash function is collision-resistant, that is, it is computationally infeasible for an attacker to find H(M2) equal to H(M1) in probabilistic polynomial time.
8. An electronic device, characterized in that: The invention comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method for realizing efficient two-party quantum key negotiation using fewer quantum channels as described in any one of claims 1 to 7 is realized.
9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for realizing efficient two-party quantum key agreement using fewer quantum channels as described in any one of claims 1 to 7 is implemented.
