检索结果-南通市图书馆

Extended multivariate public key cryptosystems with secure encryption function

在线全文

学校读者我要写书评

暂无评论

Science china(information Sciences) 2011年第6期54卷 1161-1171页

作者： wang houzhen 1,2 , zhang huanguo 1,2 , wang zhangYi 1,2 & TANG Ming 1,2 1 The key laboratory of aerospace information security and trusted computing, ministry of education, School of Computer, wuhan university, wuhan 430079, china 2 State key laboratory of Software Engineering, wuhan university, wuhan 430072, china The key laboratory of aerospace information security and trusted computing Ministry of Education School of Computer Wuhan University Wuhan China State key laboratory of Software Engineering Wuhan University Wuhan China

Advances in quantum computers pose great threats on the currently used public key cryptographic algorithms such as RSA and ECC. As a promising candidate secure against attackers equipped with quantum computational power, multivariate public key cryptosystems (MPKCs) have attracted increasing attention in recently years. Unfortunately, the existing MPKCs can only be used as a multivariate signature scheme, and it remains unknown how to construct an efficient MPKC enabling secure encryption. Furthermore, some multivariate signature schemes have been shown insecure in recent years, and it is also not trivial to build MPKC which can serve as a secure signature scheme. By employing the basic MQ-trapdoors, this paper proposes a novel MPKC and shows how it can be used as a multivariate signature scheme and a multivariate encryption scheme, respectively. The goal is achieved by incorporating our new hash authentication techniques and some modification methods such as the Shamir's minus method. Thorough analysis shows that our schemes are secure and efficient. Our MPKC gives a positive response to the challenges in multivariate public key cryptography.

关键词： cryptography post-quantum cryptography MQ problem hash function

A new perturbation algorithm and enhancing security of SFLASH signature scheme

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information Sciences) 2010年第4期53卷 760-768页

作者： wang houzhen1,2, zhang huanguo1,2*, GUAN HaiMing3 & HAN HaiQing1,2 1The key laboratory of aerospace information security and trusted computing, ministry of education, wuhan university, wuhan 430072, china 2School of Computer, wuhan university, wuhan 430079, china 3Chinese Electronic Equipment System Corporation, Beijing 100039, china The key laboratory of aerospace information security and trusted computing Ministry of Education Wuhan University Wuhan China School of Computer Wuhan University Wuhan China Chinese Electronic Equipment System Corporation Beijing China

This paper introduces the concept of noise factor and noise operation, and constructs a noise group. We present a new perturbation algorithm for enhancing security of multivariate public key cryptosystems (MPKCs). European Consortium SFLASH which derives from Matsumoto-Imai scheme is a fast signature scheme intended for low cost smart cards. It was broken with the differential cryptanalysis by Dubois et al. in 2007. Taking Matsumoto-Imai system as an example, security analysis shows that the new algorithm can powerfully demolish its potential mathematical properties of the public key, and effectively avoid differential cryptanalysis without lowering the effciency of the original algorithm.

关键词： SFLASH differential cryptanalysis noise factor noise operation noise group

Design theory and method of multivariate hash function

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information Sciences) 2010年第10期53卷 1977-1987页

作者： wang houzhen 1,2 , zhang huanguo 1 , WU QianHong 1 , zhang Yu 1 , LI ChunLei 1 & zhang XinYu 1 1 The key laboratory of aerospace information security and trusted computing, ministry of education, School of Computer, wuhan university, wuhan 430072, china 2 key laboratory of Mathematics Mechanization, Beijing 100080, china The key laboratory of aerospace information security and trusted computing Ministry of Education School of Computer Wuhan University Wuhan China key laboratory of Mathematics Mechanization Beijing China

This paper proposes a novel hash algorithm whose security is based on the multivariate nonlinear polynomial equations of NP-hard problem over a finite field and combines with HAIFA iterative framework. Over the current widely used hash algorithms, the new algorithm has the following advantages: its security is based on a recognized difficult mathematical problem; the hash length can be changed freely; its design can be automated such that users may construct specific hash function meeting the actual needs. Furthermore, we discuss the security, efficiency and performance of the new algorithm. Under some related difficult mathematical assumptions and theoretical analysis, the new algorithm is proven practical by the experiment results, and capable of achieving security of an ideal hash function by choosing suitable parameters. In addition, it can also be used as a pseudo-random number generator for the good randomness of its output.

关键词： cryptology hash function MQ problem multivariate polynomials

Evolutionary cryptography theory based generating method for a secure Koblitz elliptic curve and its improvement by a hidden Markov models

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information Sciences) 2012年第4期55卷 911-920页

作者： wang Chao 1,zhang huanguo 2,3 & LIU LiLi 4 1.key Lab of Specialty Fiber Optics and Optical Access Network,ministry of education,Shanghai university,Shanghai 200072,china 2 Computer School of wuhan university,wuhan 430072,china 3 key laboratory of aerospace information security and trusted computing ministry of education,wuhan 430072,china 4 Huawei Technologies CO.LTD.,Shanghai 201206,china key Lab of Specialty Fiber Optics and Optical Access Network Ministry of Education Shanghai University Shanghai China Computer School of wuhan university Wuhan China key laboratory of aerospace information security and trusted computing ministry of education Wuhan China Huawei Technologies CO. LTD. Shanghai China

Considering potential attacks from cloud-computing and quantum-computing,it is becoming nec-essary to provide higher security elliptic *** hidden Markov models are introduced for designing the trace-vector computation algorithm to accelerate the search for elliptic curve (EC) *** present a new algorithm for secure Koblitz EC generation based on evolutionary cryptography *** algorithm is tested by selecting a secure Koblitz EC over the field F(2 2000),with experiments showing that both the base field and base point of the secure curve generated exceed the parameter range for Koblitz curves recommended by *** base fields generated go beyond 1900 bits,which is higher than the 571 bits recommended by *** also find new secure curves in the range F(2 163)-F(2 571) recommended by *** perform a detailed security analysis of those secure curves,showing that those we propose satisfy the same security criteria as NIST.

关键词： secure EC selection evolutionary cryptography theory ant colony algorithm Koblitz EC HMM

Research on trusted computing and its development

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information Sciences) 2010年第3期53卷 405-433页

作者： SHEN ChangXiang1, zhang huanguo1?, wang HuaiMin3, wang Ji3, ZHAO Bo2, YAN Fei2, YU FaJiang2, zhang LiQiang2 & XU MingDi21Beijing university of Technology, Beijing 100124, china 2School of Computer, wuhan university, key laboratory of aerospace information security and trusted computing of ministry of education, wuhan 430072, china 3School of Computer, National university of Defence Technology, Changsha 430074, china Beijing university of Technology Beijing China School of Computer National University of Defence Technology Changsha China key laboratory of aerospace information security and trusted computing of ministry of education School of Computer Wuhan University Wuhan China

trusted computing is a novel technology of information system security. It has become a new tide in worldwide information security area and achieved inspiring accomplishment. In china, the initiative research of trusted computing is not late, and the achievements are plentiful and substantial. Our country is in the front rank of the world in trusted computing. This paper comprehensively illustrates the recent development in theory and technology of trusted computing, introduces some improvements in trusted computing in our country, and proposes our opinions and viewpoints towards the existing problems in trusted computing and its future development.

关键词： information security trusted computing trusted computing platform trustworthy software trusted network connection

A New Secure Password Authentication Scheme Using Smart Cards

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2008年第6期13卷 739-743页

作者： wang Bangju1,2, wang Yuhua3, zhang huanguo1 1. School of Computer, wuhan university/key laboratory of aerospace information security and Trust computing of ministry of education, wuhan 430072, hubei, china 2. School of Science, Huazhong Agricultural university, wuhan 430070, hubei, china 3. College of information Science and Engineering, Henan university of Technology Zhengzhou 450001, Henan, china School of Computer Wuhan University/Key Laboratory of Aerospace Information Security and Trust Computing of Ministry of Education Wuhan China School of Science Huazhong Agricultural University Wuhan China College of information Science and Engineering Henan University of Technology Zhengzhou China

Thirteen security requirements for an ideal password authentication scheme using smart cards are listed and a new smart card based password authentication scheme with identity anonymity is proposed. The new scheme can satisfy all the listed ideal security requirements and has the following merits：（1） it can resist all the attacks listed in introduction; （2） less storage memory requirement due to no verification table stored in server; （3） low computational cost due to hash functions based operations; （4） even if the smart card is lost, the new system is still secure; （5） As user identity is anonymous, this scheme is more practical. The new proposed scheme can be applied in source constraint networks.

关键词： password password authentication hash function attack smart card

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.

关键词： information security cryptogra-phy RSA fixed-point quantum computing

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 ***-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 *** first lattice-based cryptosystem was proposed by Ajtai and Dwork[2],whose security is based on the lattice problems in the *** their seminal work,several latticebased cryptosystems have been proposed till now,

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

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