Comparing the efficiencies of different detect strategies in the ping-pong protocol

Gao, Fei; Guo, Fen-Zhuo; Wen, Qiaoyan

doi:10.1007/s11433-008-0185-4

Cited by 29 publications

(24 citation statements)

References 39 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Ping-pong protocol (and its enhanced variants) (Boström & Felbinger, 2002;Cai & Li, 2004b;Chamoli & Bhandari, 2009;Gao et al, 2008;Ostermeyer & Walenta, 2008;Vasiliu & Nikolaenko, 2009;Vasiliu, 2011). …”

Section: Quantum Secure Direct Communicationmentioning

confidence: 99%

Quantum Secure Telecommunication Systems

Корченко¹,

Vorobiyenko²,

Lutskiy³

et al. 2012

Telecommunications Networks - Current Status and Future Trends

View full text Add to dashboard Cite

Section: Quantum Secure Direct Communicationmentioning

confidence: 99%

Quantum Secure Telecommunication Systems

Корченко¹,

Vorobiyenko²,

Lutskiy³

et al. 2012

Telecommunications Networks - Current Status and Future Trends

View full text Add to dashboard Cite

“…Since then, to overcome this, scholars [6][7][8][9] in China and abroad have paid great attention to research into quantum computer technology, quantum computation algorithms and quantum cryptology. Grover's algorithm, which offers an exhaustive search of long lists held in a quantum computer, reduces the computational complexity of current exhaustive search attacks from O(2 n ) to O(2 n/2 ), thus raising the security concerns of current crypto-systems to a new level.…”

Section: Label Quantum Search Computation Complexity Ntrumentioning

confidence: 99%

“…In 1992, Deutsch et al [3] designed the first quantum algorithm whose computation capability surpassed that of an electronic computer. Shortly thereafter, Shor's [4] quantum factorization algorithm and Grover's [5] quantum search algorithm added further to the security difficulties associated with modern cryptology.Since then, to overcome this, scholars [6][7][8][9] in China and abroad have paid great attention to research into quantum computer technology, quantum computation algorithms and quantum cryptology. Grover's algorithm, which offers an exhaustive search of long lists held in a quantum computer, reduces the computational complexity of current exhaustive search attacks from O(2 n ) to O(2 n/2 ), thus raising the security concerns of current crypto-systems to a new level.…”

mentioning

confidence: 99%

“…Shortly thereafter, Shor's [4] quantum factorization algorithm and Grover's [5] quantum search algorithm added further to the security difficulties associated with modern cryptology. Since then, to overcome this, scholars [6][7][8][9] in China and abroad have paid great attention to research into quantum computer technology, quantum computation algorithms and quantum cryptology.…”

mentioning

confidence: 99%

See 1 more Smart Citation

A quantum algorithm for searching a target solution of fixed weight

Wang

Bao

2011

Chin. Sci. Bull.

View full text Add to dashboard Cite

To search for a target n-product Boolean vector of fixed weight d, we propose an important method involving the notion of a fixed-weight "vector label" accompanied with a vector label restoration algorithm. Based on these, we present a new quantum algorithm designed to search for a fixed-weight target whose computation complexity, specifically ( ) 1 d n O C + , is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions. label, quantum search, computation complexity, NTRUCitation: Wang X, Bao W S, Fu X Q. A quantum algorithm for searching a target solution of fixed weight. Quantum computation evolved from proposals put forward by Paul [1] and Feynman [2] to harness the computational power of quantum environments. In 1992, Deutsch et al. [3] designed the first quantum algorithm whose computation capability surpassed that of an electronic computer. Shortly thereafter, Shor's [4] quantum factorization algorithm and Grover's [5] quantum search algorithm added further to the security difficulties associated with modern cryptology.Since then, to overcome this, scholars [6][7][8][9] in China and abroad have paid great attention to research into quantum computer technology, quantum computation algorithms and quantum cryptology. Grover's algorithm, which offers an exhaustive search of long lists held in a quantum computer, reduces the computational complexity of current exhaustive search attacks from O(2 n ) to O(2 n/2 ), thus raising the security concerns of current crypto-systems to a new level. Along with an in-depth study, Long et al. [10][11][12][13] presented an improved algorithm based on phase shifts with zero theoretical failure rate, while Zhong et al. [14] proposed a meet-in-the-middle quantum search algorithm. As a result, Grover's algorithm *Corresponding author (email: bws2004@sina.com) has been widely applied.Indeed, Grover's algorithm is a universally applicable algorithm for which the input is an equally-weighted superimposed state of all classical n-product states, each of which is potentially a target solution. However, in practical decryption of a cryptosystem, such problems can be represented as searches for a target solution with special conditions (as a target-product vector with fixed weight). If Grover's algorithm is used to find a solution, then the computation complexity is no better than for classical search algorithms, sometimes even much worse. Reasoning in this way, the exploitation of a quantum computer's powerful paralleling capability seems not to be fully achieved. Obviously, improving the efficiency of classical crypto-analysis with the use of quantum computation principles is a key and vital problem needing to be resolved. In this article, we focus on solving this special crypto attack problem associated with target vectors of fixed weight, and we propose an important method introducing the notion of a fixed weight vector labe...

show abstract

“…Since the pioneering work [2] , various protocols based on different quantum features are proposed, such as quantum key distribution (QKD) [3,4] , quantum secret sharing (QSS) [5,6] , quantum secure direct communication (QSDC) [7,8] and so on. QSDC is a novel branch which allows that the secret is transmitted between users directly without creating a private key in advance.…”

mentioning

confidence: 99%

Quantum secure direct communication over the collective amplitude damping channel

Qin

Wen

2009

Sci. China Ser. G-Phys. Mech. Astron.

Self Cite

View full text Add to dashboard Cite

An efficient quantum secure direct communication protocol is presented over the amplitude damping channel. The protocol encodes logical bits in two-qubit noiseless states, and so it can function over a quantum channel subjected to collective amplitude damping. The feature of this protocol is that the sender encodes the secret directly on the quantum states, the receiver decodes the secret by performing determinate measurements, and there is no basis mismatch. The transmission's safety is ensured by the nonorthogonality of the noiseless states traveling forward and backward on the quantum channel. Moreover, we construct the efficient quantum circuits to implement channel encoding and information encoding by means of primitive operations in quantum computation.quantum secure direct communication, amplitude damping, quantum cryptography Quantum cryptography [1] is one of the most remarkable applications of quantum information. Since the pioneering work [2] , various protocols based on different quantum features are proposed, such as quantum key distribution (QKD) [3,4] , quantum secret sharing (QSS) [5,6] , quantum secure direct communication (QSDC) [7,8] and so on. QSDC is a novel branch which allows that the secret is transmitted between users directly without creating a private key in advance. As it is useful in some urgent circumstances, many efforts have been made on the research of QSDC [9][10][11][12][13][14][15][16][17][18][19][20][21] . For example, Deng et al. proposed four criteria for secure QSDC [12] and gave two secure QSDC protocols [10,12] , Cai et al. presented two efficient QSDC schemes with entangled states [9] and single qubit [11] , respectively.In contrast to classical cryptography, the security of quantum cryptography is guaranteed by the principles of quantum mechanics, and therefore the unconditional security can be achieved. Properly speaking, according to quantum physics principles, Eve's eavesdropping will inevitably disturb the carrier states and induce errors in the process of checking eavesdropping. Higher error rate results in lower information transmission rate, and once it becomes too large, no secure message can be transmitted and the communications will have to abort. Therefore, building a viable quantum cryptographic system depends on ensuring that the error rate is low. However in practice, quantum states are very fragile and easily destroyed by decoherence due to unwanted coupling with the environment, and errors are induced in the eavesdropping detection inevitably. It has been one of the major obstacles to implementing quantum cryptography protocols in real physical systems. To solve the effects of such interactions, some strategies, such as quantum error correction code [22,23] and quantum error-rejection code [24][25][26][27] have been proposed.Considering the specific types of coupling with the

show abstract

Comparing the efficiencies of different detect strategies in the ping-pong protocol

Cited by 29 publications

References 39 publications

Quantum Secure Telecommunication Systems

Quantum Secure Telecommunication Systems

A quantum algorithm for searching a target solution of fixed weight

Quantum secure direct communication over the collective amplitude damping channel

Contact Info

Product

Resources

About