A measuring-basis encrypted quantum key distribution scheme is proposed by using twelve nonorthogohal states in a four-state system and the measuring-basis encryption technique. In this scheme, two bits of classical i...A measuring-basis encrypted quantum key distribution scheme is proposed by using twelve nonorthogohal states in a four-state system and the measuring-basis encryption technique. In this scheme, two bits of classical information can be encoded on one four-state particle and the transmitted particles can be fully used.展开更多
Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certai...Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.展开更多
Quantum cryptography and quantum search algorithm are considered as two important research topics in quantum information science.An asymmetrical quantum encryption protocol based on the properties of quantum one-way f...Quantum cryptography and quantum search algorithm are considered as two important research topics in quantum information science.An asymmetrical quantum encryption protocol based on the properties of quantum one-way function and quantum search algorithm is proposed.Depending on the no-cloning theorem and trapdoor one-way functions of the publickey,the eavesdropper cannot extract any private-information from the public-keys and the ciphertext.Introducing key-generation randomized logarithm to improve security of our proposed protocol,i.e.,one privatekey corresponds to an exponential number of public-keys.Using unitary operations and the single photon measurement,secret messages can be directly sent from the sender to the receiver.The security of the proposed protocol is proved that it is informationtheoretically secure.Furthermore,compared the symmetrical Quantum key distribution,the proposed protocol is not only efficient to reduce additional communication,but also easier to carry out in practice,because no entangled photons and complex operations are required.展开更多
A quantum key distribution protocol, based on the quantum dense encoding in entangled states, is presented. In this protocol, we introduce an encoding process to encode two classical bits information into one of the f...A quantum key distribution protocol, based on the quantum dense encoding in entangled states, is presented. In this protocol, we introduce an encoding process to encode two classical bits information into one of the four one-qubit unitary operations implemented by Alice and the Bell states measurement implemented by Bob in stead of direct measuring the previously shared Einstein-Podolsky-Rosen pairs by both of the distant parties, Alice and Bob.Considering the practical application we can get the conclusion that our protocol has some advantages. It not only simplifies the measurement which may induce potential errors, but also improves the effectively transmitted rate of the generated qubits by the raw key. Here we also discuss eavesdropping attacks against the scheme and the channel loss.展开更多
It is established that a single quantum cryptography protocol usually cooperates with other cryptographicsystems,such as an authentication system,in the real world.However,few protocols have been proposed on how tocom...It is established that a single quantum cryptography protocol usually cooperates with other cryptographicsystems,such as an authentication system,in the real world.However,few protocols have been proposed on how tocombine two or more quantum protocols.To fill this gap,we propose a composed quantum protocol,containing bothquantum identity authentication and quantum key distribution,using squeezed states.Hence,not only the identity canbe verified,but also a new private key can be generated by our new protocol.We also analyze the security under anoptimal attack,and the efficiency,which is defined by the threshold of the tolerant error rate,using Gaussian errorfunction.展开更多
PRINCE is a 64-bit lightweight block cipher with a 128-bit key published at ASIACRYPT 2012. Assuming one nibble fault is injected, previous different fault analysis(DFA) on PRINCE adopted the technique from DFA on AES...PRINCE is a 64-bit lightweight block cipher with a 128-bit key published at ASIACRYPT 2012. Assuming one nibble fault is injected, previous different fault analysis(DFA) on PRINCE adopted the technique from DFA on AES and current results are different. This paper aims to make a comprehensive study of algebraic fault analysis(AFA) on PRINCE. How to build the equations for PRINCE and faults are explained. Extensive experiments are conducted. Under nibble-based fault model, AFA with three or four fault injections can succeed within 300 seconds with a very high probability. Under other fault models such as byte-based, half word-based, word-based fault models, the faults become overlapped in the last round and previous DFAs are difficult to work. Our results show that AFA can still succeed to recover the full master key. To evaluate security of PRINCE against fault attacks, we utilize AFA to calculate the reduced entropy of the secret key for given amount of fault injections. The results can interpret and compare the efficiency of previous work. Under nibble-based fault model, the master key of PRINCE can be reduced to 29.69 and 236.10 with 3 and 2 fault injections on average, respectively.展开更多
The problem of perfectly secure communication has enjoyed considerable theoretical treatment over the last decades. Results in this area include the identification of multipath transmission as a necessary ingredient, ...The problem of perfectly secure communication has enjoyed considerable theoretical treatment over the last decades. Results in this area include the identification of multipath transmission as a necessary ingredient, as well as quantum key distribution (QKD), which can perfectly protect direct lines, Combining the advantages of the quantum and multipath transmission paradigm, as well as rigorously analyzing the security of such combined techniques, is possible by virtue of game-theory. Based on a game-theoretic measure of channel vulnerability, the authors prove the problem of setting up infrastructures for QKD-based multipath transmission to be NP-complete. The authors consider the problem in two flavors, both being computationally hard. Remarkably, the authors' results indicate that the P-vs-NP-question is only of minor effect for confidentiality, because either nowadays public-key cryptosystems remain secure (in case that P, NP) or infrastructures facilitating perfectly confidential communication can be constructed efficiently (in case that P = NP).展开更多
The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing....The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.展开更多
Decoy state method quantum key distribution (QKD) is one of the promising practical solutions for BB84QKD with coherent light pulses.The number of data-set size in practical QKD protocol is always finite,which will ca...Decoy state method quantum key distribution (QKD) is one of the promising practical solutions for BB84QKD with coherent light pulses.The number of data-set size in practical QKD protocol is always finite,which will causestatistical fluctuations.In this paper,we apply absolutely statistical fluctuation to amend the yield and error rate of thequantum state.The relationship between exchanged number of quantum signals and key generation rate is analyzed inour simulation,which offers a useful reference for experiment.展开更多
This paper proposes an adaptively secure solution to certificateless distributed key encapsulation mechanism from pairings by using Canetti's adaptive secure key generation scheme based on discrete logarithm. The pro...This paper proposes an adaptively secure solution to certificateless distributed key encapsulation mechanism from pairings by using Canetti's adaptive secure key generation scheme based on discrete logarithm. The proposed scheme can withstand adaptive attackers that can choose players for corruption at any time during the run of the protocol, and this kind of attack is powerful and realistic. In contrast, all previously presented threshold certificateless public key cryptosystems are proven secure against the more idealized static adversaries only. They choose and fix the subset of target players before running the protocol. We also prove security of this scheme in the random oracle model.展开更多
The isomorphism of polynomials (IP), one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials. Then the enumeration problem of IP consists o...The isomorphism of polynomials (IP), one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials. Then the enumeration problem of IP consists of counting the numbers of different classes and counting the cardinality of each class that is highly related to the scale of key space for a multivariate publi9 key cryptosystem. In this paper we show the enumeration of the equivalence classes containing ∑n-1 i=0 aiX^2qi when char(Fq) = 2, which implies that these polynomials are all weak IP instances. Moreover, we study the cardinality of an equivalence class containing the binomial aX2qi + bX2qj (i ≠ j) over Fqn without the restriction that char(Fq) = 2, which gives us a deeper understanding of finite geometry as a tool to investigate the enumeration problem of IP.展开更多
We propose a new counterfactual quantum cryptography protocol concerning about distributing a deterministic key.By adding a controlled blocking operation module to the original protocol [T.G.Noh,Phys.Rev.Lett.103(2009...We propose a new counterfactual quantum cryptography protocol concerning about distributing a deterministic key.By adding a controlled blocking operation module to the original protocol [T.G.Noh,Phys.Rev.Lett.103(2009) 230501],the correlation between the polarizations of the two parties,Alice and Bob,is extended,therefore,one can distribute both deterministic keys and random ones using our protocol.We have also given a simple proof of the security of our protocol using the technique we ever applied to the original protocol.Most importantly,our analysis produces a bound tighter than the existing ones.展开更多
Considering the air-water interface and ocean water’s optical attenuation,the performance of quantum key distribution(QKD)based on air-water channel is studied.The effects of photons’various incident angles to air-w...Considering the air-water interface and ocean water’s optical attenuation,the performance of quantum key distribution(QKD)based on air-water channel is studied.The effects of photons’various incident angles to air-water interface on quantum bit error rate(QBER)and the maximum secure transmission distance are analyzed.Taking the optical attenuation of ocean water into account,the performance bounds of QKD in different types of ocean water are discussed.The simulation results show that the maximum secure transmission distance of QKD gradually reduces as the incident angle from air to ocean water increases.In the clearest ocean water with the lowest attenuation,the maximum secure transmission distance of photons far exceeds the the working depth of underwater vehicles.In intermediate and murky ocean waters with higher attenuation,the secure transmission distance shortens,but the underwater vehicle can deploy other accessorial methods for QKD with perfect security.So the implementation of OKD between the satellite and the underwater vehicle is feasible.展开更多
Quantum key distribution (QKD) is a technology with the potential capability to achieve information-theoretic security. Phase- coding is an important approach to develop practical QKD systems in fiber channel. In or...Quantum key distribution (QKD) is a technology with the potential capability to achieve information-theoretic security. Phase- coding is an important approach to develop practical QKD systems in fiber channel. In order to improve the phase-coding modulation rate, we proposed a new digital-modulation method in this paper and constructed a compact and robust prototype of QKD system using currently available components in our lab to demonstrate the effectiveness of the method. The system was deployed in laboratory environment over a 50 km fiber and continuously operated during 87 h without manual interaction. The quantum bit error rate (QBER) of the system was stable with an average value of 3.22% and the secure key generation rate is 8.91 kbps. Although the modulation rate of the photon in the derno system was only 200 MHz, which was limited by the Faraday- Michelson interferometer (FMI) structure, the proposed method and the field programmable gate array (FPGA) based electronics scheme have a great potential for high speed QKD systems with Giga-bits/second modulation rate.展开更多
基金The project supported by the National Fundamental Research Program under Grant No. 2006CB0L0106, National Natural Science Foundation of China under Grant Nos. 60433050, 10325521, and 10447106, and the SRFDP Program of Education Ministry of China and Beijing Education Committee under Grant No. XK100270454
文摘A measuring-basis encrypted quantum key distribution scheme is proposed by using twelve nonorthogohal states in a four-state system and the measuring-basis encryption technique. In this scheme, two bits of classical information can be encoded on one four-state particle and the transmitted particles can be fully used.
基金supported in part by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386)the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004)+2 种基金the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008)Major State Basic Research Development Program of China(973 Program)(No.2014CB340600)the Hubei Natural Science Foundation of China(Grant Nos.2011CDB453,2014CFB440)
文摘Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.
基金This work was supported in part by the program for Innovation Team Building at Institutions of Higher Education in Chongqing under Grant No.KJTD201310,the Scientific and Technological Research Program of Chongqing Municipal Education Commission of China under Grant KJ120513,Natural Science Foundation Project of CQ CSTC of P.R.China under Grant No.cstc2011jjA40031
文摘Quantum cryptography and quantum search algorithm are considered as two important research topics in quantum information science.An asymmetrical quantum encryption protocol based on the properties of quantum one-way function and quantum search algorithm is proposed.Depending on the no-cloning theorem and trapdoor one-way functions of the publickey,the eavesdropper cannot extract any private-information from the public-keys and the ciphertext.Introducing key-generation randomized logarithm to improve security of our proposed protocol,i.e.,one privatekey corresponds to an exponential number of public-keys.Using unitary operations and the single photon measurement,secret messages can be directly sent from the sender to the receiver.The security of the proposed protocol is proved that it is informationtheoretically secure.Furthermore,compared the symmetrical Quantum key distribution,the proposed protocol is not only efficient to reduce additional communication,but also easier to carry out in practice,because no entangled photons and complex operations are required.
文摘A quantum key distribution protocol, based on the quantum dense encoding in entangled states, is presented. In this protocol, we introduce an encoding process to encode two classical bits information into one of the four one-qubit unitary operations implemented by Alice and the Bell states measurement implemented by Bob in stead of direct measuring the previously shared Einstein-Podolsky-Rosen pairs by both of the distant parties, Alice and Bob.Considering the practical application we can get the conclusion that our protocol has some advantages. It not only simplifies the measurement which may induce potential errors, but also improves the effectively transmitted rate of the generated qubits by the raw key. Here we also discuss eavesdropping attacks against the scheme and the channel loss.
基金Supported by the National Natural Science Foundation of China under Grant No. 60872052
文摘It is established that a single quantum cryptography protocol usually cooperates with other cryptographicsystems,such as an authentication system,in the real world.However,few protocols have been proposed on how tocombine two or more quantum protocols.To fill this gap,we propose a composed quantum protocol,containing bothquantum identity authentication and quantum key distribution,using squeezed states.Hence,not only the identity canbe verified,but also a new private key can be generated by our new protocol.We also analyze the security under anoptimal attack,and the efficiency,which is defined by the threshold of the tolerant error rate,using Gaussian errorfunction.
基金supported in part by the Major State Basic Research Development Program (973 Plan) of China under thegrant 2013CB338004the National Natural Science Foundation of China under the grants 61173191, 61271124, 61272491, 61309021, 61472357+1 种基金by the Zhejiang Provincial Natural Science Foundation of China under the grant LY13F010001by the Fundamental Research Funds for the Central Universities under the grant 2015QNA5005
文摘PRINCE is a 64-bit lightweight block cipher with a 128-bit key published at ASIACRYPT 2012. Assuming one nibble fault is injected, previous different fault analysis(DFA) on PRINCE adopted the technique from DFA on AES and current results are different. This paper aims to make a comprehensive study of algebraic fault analysis(AFA) on PRINCE. How to build the equations for PRINCE and faults are explained. Extensive experiments are conducted. Under nibble-based fault model, AFA with three or four fault injections can succeed within 300 seconds with a very high probability. Under other fault models such as byte-based, half word-based, word-based fault models, the faults become overlapped in the last round and previous DFAs are difficult to work. Our results show that AFA can still succeed to recover the full master key. To evaluate security of PRINCE against fault attacks, we utilize AFA to calculate the reduced entropy of the secret key for given amount of fault injections. The results can interpret and compare the efficiency of previous work. Under nibble-based fault model, the master key of PRINCE can be reduced to 29.69 and 236.10 with 3 and 2 fault injections on average, respectively.
文摘The problem of perfectly secure communication has enjoyed considerable theoretical treatment over the last decades. Results in this area include the identification of multipath transmission as a necessary ingredient, as well as quantum key distribution (QKD), which can perfectly protect direct lines, Combining the advantages of the quantum and multipath transmission paradigm, as well as rigorously analyzing the security of such combined techniques, is possible by virtue of game-theory. Based on a game-theoretic measure of channel vulnerability, the authors prove the problem of setting up infrastructures for QKD-based multipath transmission to be NP-complete. The authors consider the problem in two flavors, both being computationally hard. Remarkably, the authors' results indicate that the P-vs-NP-question is only of minor effect for confidentiality, because either nowadays public-key cryptosystems remain secure (in case that P, NP) or infrastructures facilitating perfectly confidential communication can be constructed efficiently (in case that P = NP).
基金supported by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386)the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004)+2 种基金the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008)Major State Basic Research Development Program of China(973 Program)(No.2014CB340600)the Hubei Natural Science Foundation of China(Grant No.2011CDB453,2014CFB440)
文摘The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.
基金Supported by the National Basic Research Program (973) of China under Grant No.2010CB923200Chinese Universities Scientific Fund BUPT2009RC0709
文摘Decoy state method quantum key distribution (QKD) is one of the promising practical solutions for BB84QKD with coherent light pulses.The number of data-set size in practical QKD protocol is always finite,which will causestatistical fluctuations.In this paper,we apply absolutely statistical fluctuation to amend the yield and error rate of thequantum state.The relationship between exchanged number of quantum signals and key generation rate is analyzed inour simulation,which offers a useful reference for experiment.
基金the National Basic Research Program(973)of China(No.2007CB311201)the National High Technology Research and Development Program(863) of China(Nos.2006AA01Z422,2007AA01Z456)
文摘This paper proposes an adaptively secure solution to certificateless distributed key encapsulation mechanism from pairings by using Canetti's adaptive secure key generation scheme based on discrete logarithm. The proposed scheme can withstand adaptive attackers that can choose players for corruption at any time during the run of the protocol, and this kind of attack is powerful and realistic. In contrast, all previously presented threshold certificateless public key cryptosystems are proven secure against the more idealized static adversaries only. They choose and fix the subset of target players before running the protocol. We also prove security of this scheme in the random oracle model.
基金supported by National Basic Research Program of China (973 Program)(Grant No. 2011CB302400)National Natural Science Foundation of China (Grant No. 60970152)Grand Project of Institute of Software (Grant No. YOCX285056)
文摘The isomorphism of polynomials (IP), one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials. Then the enumeration problem of IP consists of counting the numbers of different classes and counting the cardinality of each class that is highly related to the scale of key space for a multivariate publi9 key cryptosystem. In this paper we show the enumeration of the equivalence classes containing ∑n-1 i=0 aiX^2qi when char(Fq) = 2, which implies that these polynomials are all weak IP instances. Moreover, we study the cardinality of an equivalence class containing the binomial aX2qi + bX2qj (i ≠ j) over Fqn without the restriction that char(Fq) = 2, which gives us a deeper understanding of finite geometry as a tool to investigate the enumeration problem of IP.
基金Supported by the National Natural Science Foundation of China under Grant No. 60872052
文摘We propose a new counterfactual quantum cryptography protocol concerning about distributing a deterministic key.By adding a controlled blocking operation module to the original protocol [T.G.Noh,Phys.Rev.Lett.103(2009) 230501],the correlation between the polarizations of the two parties,Alice and Bob,is extended,therefore,one can distribute both deterministic keys and random ones using our protocol.We have also given a simple proof of the security of our protocol using the technique we ever applied to the original protocol.Most importantly,our analysis produces a bound tighter than the existing ones.
基金supported by the National High Technology Research and Development Program of China(No.2011AA7014061)
文摘Considering the air-water interface and ocean water’s optical attenuation,the performance of quantum key distribution(QKD)based on air-water channel is studied.The effects of photons’various incident angles to air-water interface on quantum bit error rate(QBER)and the maximum secure transmission distance are analyzed.Taking the optical attenuation of ocean water into account,the performance bounds of QKD in different types of ocean water are discussed.The simulation results show that the maximum secure transmission distance of QKD gradually reduces as the incident angle from air to ocean water increases.In the clearest ocean water with the lowest attenuation,the maximum secure transmission distance of photons far exceeds the the working depth of underwater vehicles.In intermediate and murky ocean waters with higher attenuation,the secure transmission distance shortens,but the underwater vehicle can deploy other accessorial methods for QKD with perfect security.So the implementation of OKD between the satellite and the underwater vehicle is feasible.
基金supported by the National Key Basic Research Program of China(Grant Nos.2011CBA00200 and 2011CB921200)the National Natural Science Foundation of China(Grant Nos.61201239,6120511811304397 and 61475148)the Strategic Priority Research Program(B)of the Chinese Academy of Sciences(Grant Nos.XDB01030100 and XDB01030300)
文摘Quantum key distribution (QKD) is a technology with the potential capability to achieve information-theoretic security. Phase- coding is an important approach to develop practical QKD systems in fiber channel. In order to improve the phase-coding modulation rate, we proposed a new digital-modulation method in this paper and constructed a compact and robust prototype of QKD system using currently available components in our lab to demonstrate the effectiveness of the method. The system was deployed in laboratory environment over a 50 km fiber and continuously operated during 87 h without manual interaction. The quantum bit error rate (QBER) of the system was stable with an average value of 3.22% and the secure key generation rate is 8.91 kbps. Although the modulation rate of the photon in the derno system was only 200 MHz, which was limited by the Faraday- Michelson interferometer (FMI) structure, the proposed method and the field programmable gate array (FPGA) based electronics scheme have a great potential for high speed QKD systems with Giga-bits/second modulation rate.