检索结果-南通市图书馆

Quantum Polynomial-Time Fixed-Point Attack for RSA

China Communications 2018年第2期15卷 25-32页

作者： Yahui wang Huanguo Zhang houzhen wang School of computer Wuhan University Key Laboratory of Aerospace Information security and trusted computing Ministry of Education Wuhan University

Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.

关键词：多项式时间 RSA 攻击 Fourier 定点公共密钥安全分析量算法

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Cryptanalysis of a lattice based key exchange protocol

引用

Science China(Information Sciences) 2017年第2期60卷 196-198页

作者： Shaowu MAO Pei ZHANG houzhen wang Huanguo ZHANG Wanqing WU Computer School of Wuhan University The Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Huawei Technoligies Co. Ltd. School of Computer Science and Technology Hebei University

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,

关键词： ISIS Bi Cryptanalysis of a lattice based key exchange protocol

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem

引用

Tsinghua Science and Technology 2016年第3期21卷 302-311页

作者： houzhen wang Huanguo Zhang Shaowu Mao Wanqing Wu Liqiang Zhang Computer School of Wuhan University Wuhan 430079China the State Key Laboratory of Cryptology Beijing 100878China

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.

关键词： public key cryptosystem key exchange Multivariate Public Key Cryptography （MPKC） Morphism ofPolynomials （MP） problem

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Survey on Quantum Information Security

引用

China Communications 2019年第10期16卷 1-36页

作者： Huanguo Zhang Zhaoxu Ji houzhen wang Wanqing Wu Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of EducationSchool of Cyber Science and EngineeringWuhan UniversityWuhan 430072China School of Cyber Security and Computer Hebei UniversityBaoding 071002China

The security of classical cryptography based on computational complexity assumptions has been severely challenged with the rapid development of quantum computers and quantum algorithms. Quantum cryptography, which offers unconditional security based on some principles of quantum mechanics, has become a significant branch and hotspot in the field of modern cryptography research. In this paper, we review the research and development of several important and well-studied branches of quantum cryptography in terms of theory and experiment, including quantum key distribution, quantum secret sharing, quantum secure direct communication, quantum signature, and quantum private query. We also briefly review the research and development of some other branches which are currently in the stage of theoretical research but receive widespread concern from academia, including quantum private comparison, quantum anonymous voting, quantum secure multi-party summation, quantum sealed-bid auction, quantum public key cryptosystem, quantum key agreement, quantum dialogue, and quantum identity authentication. In addition, we discuss some open issues and future research directions for the branches referred to above.

关键词： quantum information information security quantum cryptography quantum key distribution

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Lattice-Based Double-Authentication-Preventing Ring Signature for Security and Privacy in Vehicular Ad-Hoc Networks

引用

Tsinghua Science and Technology 2019年第5期24卷 575-584页

作者： Jinhui Liu Yong Yu Jianwei Jia Shijia wang Peiru Fan houzhen wang Huanguo Zhang School of Computer Science Shaanxi Normal University. Xi'an 710119 China Department of Statistics and Actuarial Science Simon Fraser University Burnaby. V5A1S6 Canada School of Cyber Science and Engineering. Wuhan University Wuhan 430072China

Amidst the rapid development of the Internet of Things (loT), Vehicular Ad-Hoc NETwork (VANET), a typical loT application, are bringing an ever-larger number of intelligent and convenient services to the daily lives of individuals. However, there remain challenges for VANETs in preserving privacy and security. In this paper, we propose the first lattice-based Double-Authentication-Preventing Ring Signature (DAPRS) and adopt it to propose a novel privacy-preserving authentication scheme for VANETs, offering the potential for security against quantum computers. The new construction is proven secure against chosen message attacks. Our scheme is more efficient than other ring signature in terms of the time cost of the message signing phase and verification phase, and also in terms of signature length. Analyses of security and efficiency demonstrate that our proposed scheme is provably secure and efficient in the application.

关键词： Vehicular Ad-Hoc NETwork(VANET) privacy security Double-Authentication-Preventing Ring Signature(DAPRS) lattice

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Cryptanalysis of an MOR cryptosystem based on a finite associative algebra

引用

Science China(Information Sciences) 2016年第3期59卷 137-145页

作者： Wanqing WU Huanguo ZHANG houzhen wang Shaowu MAO Shuomei WU Haiqing HAN Computer School of Wuhan University Computer Department Shijiazhuang University School of Mathematics and Physics Hubei Polytechnic University

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;（H, I）) and Ker（φ）■ Z;（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;（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.

关键词： MOR cryptosystem cryptanalysis quantum algorithm finite associative algebra hidden subgroup problem stabilizer

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem

引用

Science China(Information Sciences) 2016年第5期59卷 133-143页

作者： Jinhui LIU Huanguo ZHANG Jianwei JIA houzhen wang Shaowu MAO Wanqing WU Computer School of Wuhan University Key Laboratory of Aerospace Information security and trusted computing Ministry of Education

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.

关键词： cryptography post-quantum computational cryptography asymmetric cipher protocol cryptanalysis matrix decomposition

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Cryptanalysis of Public Key Cryptosystems Based on Non-Abelian Factorization Problems

引用

Tsinghua Science and Technology 2016年第3期21卷 344-351页

作者： Jinhui Liu Aiwan Fan Jianwei Jia Huanguo Zhang houzhen wang Shaowu Mao Computer School of Wuhan University Wuhan 430072China Computer School of Pingdingshan University Pingdingshan 467001China

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.

关键词： cryptography post-quantum cryptography public key encryption cryptanalysis linear equations

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Effect of coral sand on the mechanical properties and hydration mechanism of magnesium potassium phosphate cement mortar

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2024年第2期25卷 116-129页

作者： Hao LIU Huamei YANG houzhen WEI Jining YU Qingshan MENG Rongtao YAN College of Civil Engineering and Architecture Guilin University of TechnologyGuilin541004China Guangxi Key Laboratory of Geomechanics and Geotechnical Engineering Guilin University of TechnologyGuilin541004China State Key Laboratory of Geomechanics and Geotechnical Engineering Institute of Rock and Soil MechanicsChinese Academy of SciencesWuhan430071China School of Intelligent Construction Wuchang University of TechnologyWuhan430002China Hydraulic Concrete Institute China Three Gorges CorporationBeijing100038China The First Railway Survey and Design Institute Group Corporation Xi’an710043China

Damaged structures on coral islands have been spalling and cracking due to the dual corrosion of tides and waves.To ensure easy access to aggregate materials,magnesium potassium phosphate cement(MKPC)and coral sand(CS)are mixed to repair damaged structures on coral islands.However,CS is significantly different from land-sourced sand in mineral composition,particle morphology,and strength.This has a substantial impact on the hydration characteristics and macroscopic properties of MKPC mortar.Therefore,in this study we investigated the compressive strength,interfacial mechanical properties,and corrosion resistance of MKPC CS mortar.Changes in the morphology,microstructure,and relative contents of hydration products were revealed by scanning electron microscope-energy dispersive spectrometer(SEM-EDS)and X-ray diffraction(XRD).The results indicated that the compressive strength increased linearly with the interfacial micro-hardness,and then stabilized after long-term immersion in pure water and Na2SO4 solution,showing excellent corrosion resistance.Compared with MKPC river sand(RS)mortar,the hydration products of CS mortar were an intermediate product 6KPO2·8H2O with a relative content of 3.9%at 1 h and 4.1%at 12 h.The hydration product MgKPO_(4)·6H_(2)O increased rapidly after 7-d curing,with an increased growth rate of 1100%.Our results showed that CS promoted the nucleation and formation of hydration products of MKPC,resulting in better crystallinity,tighter overlapping,and a denser interfacial transition zone.The results of this study provide technical support for applying MKPC mortar as a rapid repair material for damaged structures on coral islands.

关键词： Magnesium potassium phosphate cement(MKPC) Coral sand(CS) Mechanical properties Corrosion resistance Hydration mechanism

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A public key cryptosystem based on data complexity under quantum environment

引用

Science China(Information Sciences) 2015年第11期58卷 48-58页

作者： WU WanQing ZHANG HuanGuo wang houzhen MAO ShaoWu JIA JianWei LIU JinHui Computer School Wuhan University

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.

关键词： public key cryptography information security NP-complete problem complexity theory quantum computation

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：