|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A Resistant Quantum Key Exchange Protocol and Its Corresponding Encryption Scheme显示文摘The emergence of quantum computer will threaten the security of existing public-key cryptosystems,including the Diffie Hellman key exchange protocol,encryption scheme and etc,and it makes the study of resistant quantum cryptography very urgent.This motivate us to design a new key exchange protocol and encryption scheme in this paper.Firstly,some acknowledged mathematical problems was introduced,such as ergodic matrix problem and tensor decomposition problem,the two problems have been proved to NPC hard.From the computational complexity prospective,NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them.From the algebraic structures prospective,non-commutative cryptography has been considered to resist quantum.The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures,so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures.Secondly,a new problem was constructed based on the introduced problems in this paper,then a key exchange protocol and a public key encryption scheme were proposed based on it.Finally the security analysis,efficiency,recommended parameters,performance evaluation and etc.were also been given.The two schemes has the following characteristics,provable security,security bits can be scalable,to achieve high efficiency,quantum resistance,and etc. | MAO Shaowu ZHANG Huanguo WU Wanqing LIU Jinhui LI Shuanbao Wang Houzhen | 2014 | China Communications2014，11，9： | 11 |
| 2 | A public key cryptosystem based on data complexity under quantum environment显示文摘Since the Shor algorithm showed that a quantum algorithm can efficiently calculate discrete logarithms and factorize integers, it has been used to break the RSA, EIGamal, and ECC classical public key cryptosystems. This is therefore a significant issue in the context of ensuring communication security over insecure channels. In this paper, we prove that there are no polynomial-size quantum circuits that can compute all Boolean functions(of which there are 22ncases) in the standard quantum oracle model. Based on this,we propose the notion of data complexity under a quantum environment and suggest that it can be used as a condition for post-quantum computation. It is generally believed that NP-complete problems cannot be solved in polynomial time even with quantum computers. Therefore, a public key cryptosystem and signature scheme based on the difficulty of NP-complete problems and the notion of data complexity are presented here. Finally,we analyze the security of the proposed encryption and signature schemes. | WU WanQing ZHANG HuanGuo WANG HouZhen MAO ShaoWu JIA JianWei LIU JinHui | 2015 | Science China(Information Sciences)2015，58，11： | 6 |
| 3 | Cryptanalysis of Public Key Cryptosystems Based on Non-Abelian Factorization Problems显示文摘Advances in quantum computers threaten to break public-key cryptosystems(e.g., RSA, ECC, and EIGamal), based on the hardness of factoring or taking a discrete logarithm. However, no quantum algorithms have yet been found for solving certain mathematical problems in non-commutative algebraic structures. Recently,two novel public-key encryption schemes, BKT-B cryptosystem and BKT-FO cryptosystem, based on factorization problems have been proposed at Security and Communication Networks in 2013. In this paper we show that these two schemes are vulnerable to structural attacks and linearization equations attacks, and that they only require polynomial time complexity to obtain messages from associated public keys. We conduct a detailed analysis of the two attack methods and show corresponding algorithmic descriptions and efficiency analyses. In addition, we provide some improvement suggestions for the two public-key encryption schemes. | Jinhui Liu Aiwan Fan Jianwei Jia Huanguo Zhang Houzhen Wang Shaowu Mao | 2016 | Tsinghua Science and Technology2016，21，3： | 3 |
| 4 | Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem显示文摘Advances in quantum computation threaten to break public key cryptosystems such as RSA, ECC,and El Gamal that are based on the difficulty of factorization or taking a discrete logarithm, although up to now,no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures. Against this background, Raulynaitis et al. have proposed a novel asymmetric cipher protocol using a matrix decomposition problem. Their proposed scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we show that the asymmetric cipher of the non-commutative cryptography scheme is vulnerable to a linear algebra attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. We also propose an improvement to enhance the scheme of Raulynaitis et al. | Jinhui LIU Huanguo ZHANG Jianwei JIA Houzhen WANG Shaowu MAO Wanqing WU | 2016 | Science China(Information Sciences)2016，59，5： | 2 |
| 5 | Numerical Modeling of Floating Oil Boom Motions in Wave-Current Coupling Conditions显示文摘Containment booms are commonly used in collecting and containing spilled oil on the sea surface and in protecting specific sea areas against oil slick spreading.In the present study,a numerical model is proposed based on the N-S equations in a mesh frame.The proposed model tracks the outline of the floating boom in motion by using the fractional area/volume obstacle representation technique.The boom motion is then simulated by the technique of general moving object.The simulated results of the rigid oil boom motions are validated against the experimental results.Then,the failure mechanism of the boom is investigated through numerical experiments.Based on the numerical results,the effects of boom parameters and dynamic factors on the oil containment performance are also assessed. | SHI Yang LI Shaowu ZHANG Huaqin PENG Shitao CHEN Hanbao ZHOU Ran MAO Tianyu | 2017 | Journal of Ocean University of China2017，16，4： | 2 |
| 6 | Key Exchange Protocol Based on Tensor Decomposition Problem显示文摘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. | MAO Shaowu ZHANG Huanguo WU Wanqing ZHANG Pei SONG Jun LIU Jinhui | 2016 | China Communications2016，13，3： | 1 |
| 7 | Cryptanalysis of a lattice based key exchange protocol显示文摘A lattice is a set of points in n-dimensional space with a periodic structure.Lattice-based cryptosystem holds a great promise for post-quantum cryptography[1],as they enjoy very strong security proofs based on the worst-case hardness,relatively efficient implementations,as well as great simplicity.The first lattice-based cryptosystem was proposed by Ajtai and Dwork[2],whose security is based on the lattice problems in the worstcase.After their seminal work,several latticebased cryptosystems have been proposed till now, | Shaowu MAO Pei ZHANG Houzhen WANG Huanguo ZHANG Wanqing WU | 2017 | Science China(Information Sciences)2017，60，2： | 0 |
| 8 | Cryptanalysis of an MOR cryptosystem based on a finite associative algebra显示文摘The Shor algorithm is effective for public-key cryptosystems based on an abelian group. At CRYPTO 2001, Paeng(2001) presented a MOR cryptosystem using a non-abelian group, which can be considered as a candidate scheme for post-quantum attack. This paper analyses the security of a MOR cryptosystem based on a finite associative algebra using a quantum algorithm. Specifically, let L be a finite associative algebra over a finite field F. Consider a homomorphism φ : Aut(L) → Aut(H) × Aut(I), where I is an ideal of L and H ■ L/I.We compute dim Im(φ) and dim Ker(φ), and combine them by dim Aut(L) = dim Im(φ) + dim Ker(φ). We prove that Im(φ) = Stab Comp(H,I)(μ + B^2(H, I)) and Ker(φ)■ Z^1(H, I). Thus, we can obtain dim Im(φ), since the algorithm for the stabilizer is a standard algorithm among abelian hidden subgroup algorithms. In addition,Z^1(H, I) is equivalent to the solution space of the linear equation group over the Galois fields GF(p), and it is possible to obtain dim Ker(φ) by the enumeration theorem. Furthermore, we can obtain the dimension of the automorphism group Aut(L). When the map ? ∈ Aut(L), it is possible to effectively compute the cyclic group ? and recover the private key a. Therefore, the MOR scheme is insecure when based on a finite associative algebra in quantum computation. | Wanqing WU Huanguo ZHANG Houzhen WANG Shaowu MAO Shuomei WU Haiqing HAN | 2016 | Science China(Information Sciences)2016，59，3： | 0 |
| 9 | Software Watermarking Scheme Based on Multivariate Public Key Cryptosystem显示文摘Software watermarking is an efficient tool to verify the copyright of software. Public key cryptosystem-based watermarking is widely researched. However, the popular public key cryptosystem is not secure under quantum algorithm. This paper proposes a novel software watermarking scheme based on multivariate public key cryptosystem. The copyright information generated by copyright holder is transformed into copyright numbers using multivariate quadratic polynomial equations inspired by multivariate public key cryptosystem(MPKC). Every polynomial is embedded into the host program independently. Based on the security performance of MPKC, the robustness and invisibility of the proposed scheme is significantly improved in comparison with the RSA-based watermarking method. | SUN Xiaoyan ZHANG Maosheng MAO Shaowu REN Zhengwei ZHANG Huanguo | 2016 | Wuhan University Journal of Natural Sciences2016，21，3： | 0 |
| 10 | New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem显示文摘During the last two decades, there has been intensive and fast development in Multivariate Public Key Cryptography(MPKC), which is considered to be an important candidate for post-quantum cryptography. However,it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme(especially an encryption scheme) employing the existing trapdoor construction. In this paper, we propose a new key-exchange scheme and an MPKC scheme based on the Morphism of Polynomials(MP) problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem,namely the Decisional Multivariate Diffie-Hellman(DMDH) problem derived from the MP problem. The proposed key agreement is one of several non-number-theory-based protocols, and is a candidate for use in the post-quantum era. More importantly, by slightly modifying the protocol, we offer an original approach to designing a secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency,and seems competitive with traditional MPKC schemes. | Houzhen Wang Huanguo Zhang Shaowu Mao Wanqing Wu Liqiang Zhang | 2016 | Tsinghua Science and Technology2016，21，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员