检索结果-南通市图书馆

Cryptanalysis of a Key Exchange Protocol Based on Commuting Matrices

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第5期26卷 947-951页

作者： JIA Jianwei LIU Jinhui zhang huanguo Computer School of Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education

A key exchange protocol is considered *** scheme is based on a set of m commuting square singular matrices of dimension n×n over a finite field,and its security is claimed to rely on the hardness of the matrix version discrete logarithm ***,the proposal’s design allows for a clean attack *** show that the key exchange protocol is vulnerable to a linear algebra attack which only requires polynomial time to obtain the equivalent keys for all given public *** conduct a detailed analysis on the attack method and provide some improved suggestions on the key exchange protocol based on commuting matrices.

关键词： Cryptography Key exchange protocol Cryptanalysis Discrete logarithm problem Linear equations

Cryptanalysis of Cryptosystems Based on General Linear Group

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2016年第6期13卷 217-224页

作者： Jianwei Jia Jinhui Liu huanguo zhang Computer School of Wuhan University WuhanHubei 430072China Key Laboratory of Aerospace Information security and trusted computing Ministry of Education Wuhan UniversityWuhan 430072HubeiProvinceChina

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 *** 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.

关键词： cryptography post quantum computational cryptography cryptanalysis non-abelian algebraic structures linear equations

在线全文

学校读者我要写书评

暂无评论

CYBERSPACE SECURITY

China Communications 2016年第11期13卷 68-69页

作者： huanguo zhang Yi Mu computer school in wuhan university school of computer science and software engineering centre for computer and information security research at university of wollongong

With rapid development and wide application of information technology,mankind is entering into an information *** world where people live and work has been changed to a brand new triple-dimensional space that consists of the physical world,the human society and the *** is well known that the cyberspace is an essential environment of human existence and development and it

关键词：网络空间安全人类社会信息技术信息时代三维空间赛扬

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

Evolutionary Cryptography Theory-Based Generating Method for Secure ECs

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2017年第5期22卷 499-510页

作者： Chao Wang Feng Hu huanguo zhang Jie Wu the Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information EngineeringShanghai University the Department of Computer and Information Sciences Temple University the Key Lab of Aerospace Information Security and Trusted Computing Wuhan University

Ant Colony Optimization （AGO） has the character of positive feedback, distributed searching, and greedy searching. It is applicable to optimization grouping problems. Traditional cryptographic research is mainly based on pure mathematical methods which have complicated theories and algorithm. It seems that there is no relationship between cryptography and ACO. Actually, some problems in cryptography are due to optimization grouping problems that could be improved using an evolutionary algorithm. Therefore, this paper presents a new method of solving secure curve selection problems using ACO. We improved Complex Multiplication （CM） by combining Evolutionary Cryptography Theory with Weber polynomial solutions. We found that ACO makes full use of valid information generated from factorization and allocates computing resource reasonably. It greatly increases the performance of Weber polynomial solutions. Compared with traditional CM, which can only search one root once time, our new method searches all roots of the polynomial once, and the average time needed to search for one root reduces rapidly. The more roots are searched, the more ECs are obtained.

关键词： ECs Weber polynomial evolutionary algorithm ant algorithm complex multiplication

Research in Computer Viruses and Worms

在线全文

学校读者我要写书评

暂无评论

China Communications 2007年第2期4卷 90-96页

作者： Peng Guojun zhang huanguo Wang Lina Wuhan Univ Comp Sch Wuhan 430072 Peoples R China

Viruses and worms have become so common that most computer users now accept them as a fact of *** paper introduces the definitions and difference of the computer viruses and *** main research problems about the computer viruses and worms in recent years are also summarized and discussed in *** the developing trend of the computer virus and worms is proposed.

关键词： propagation detection containment worms

Simple Method for Realizing Weil Theorem in Secure ECC Generation

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2017年第5期22卷 511-519页

作者： Feng Hu Chao Wang huanguo zhang Jie Wu the Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information EngineeringShanghai University the Department of Computer and Information Sciences Temple University the Key Lab of Aerospace Information Security and Trusted Computing Wuhan University

How to quickly compute the number of points on an Elliptic Curve （EC） has been a longstanding challenge. The computational complexity of the algorithm usually employed makes it highly inefficient. Unlike the general EC, a simple method called the Weil theorem can be used to compute the order of an EC characterized by a small prime number, such as the Kobltiz EC characterized by two. The fifteen secure ECs recommended by the National Institute of Standards and Technology （NIST） Digital Signature Standard contain five Koblitz ECs whose maximum base domain reaches 571 bits. Experimental results show that the computation speed decreases for base domains exceeding 600 bits. In this paper, we propose a simple method that combines the Weil theorem with Pascals triangle, which greatly reduces the computational complexity. We have validated the performance of this method for base fields ranging from 2l^100 to 2^1000. Furthermore, this new method can be generalized to any ECs characterized by any small prime number.

关键词： Elliptic Curves (ECs) Pascal's triangle Weil theorem

Enhancing Security of the Reduced-Operation Two-Factor Authentication by Using Ambient WiFi

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第3期27卷 625-633页

作者： LIU Dong CHEN Jing DU Ruiying zhang huanguo Key Laboratory of Aerospace Information Security and the Trusted Computing Ministry of Education School of ComputerWuhan University Science and Technology on Communication Security Laboratory North Automatic Control Technique Research Institute Collaborative Innovation Center of Geospatial Technology

Recently several reduced-operation two Factor authentication(2FA) methods have been proposed to improve the usability of traditional 2FA. The existing works cannot protect the user’s password from online guessing attack and offline dictionary attack. They cannot resist the identity fraud attack caused by co-located attackers who have obtained the victim’s password. To solve these problems, we provide a Wi Fi-based 2FA approach which can enhance security of the reduced-operation 2FA but not increase the complexity of the operation for a *** analyze our approach’s security in terms of identity fraud attack resistance, salt guessing attack resistance, and password guessing attack resistance. We also implement a prototype system and test its performance in various scenarios, e.g. lab, library, and dormitory. The security analysis and experimental results show the effectiveness of our scheme for authentication.

关键词： Two factor authentication(2FA) Proximate authentication Fuzzy vault

Differentiating Malicious and Benign Android App Operations Using Second-Step Behavior Features

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第5期28卷 944-952页

作者： LI Pengwei FU Jianming XU Chao CHENG Binlin zhang huanguo School of Information Engineering Nanjing Audit University School of Cyber Science and Engineering Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan University College of Computer Science and Technology Hubei Normal University

Security-sensitive operations in Android applications(apps for short) can either be benign or malicious. In this work, we introduce an approach of static program analysis that extracts "second-step behavior features", i.e., what was triggered by the security-sensitive operation, to assist app analysis in differentiating between malicious and benign operations. Firstly, we summarized the characteristics of malicious operations, such as spontaneity, independence, stealthiness and continuity,which can be used to classify the malicious operations and benign ones. Secondly, according to these characteristics,Second step behavior features(SSBFs for short) have been presented, including structural features and semantic features. Thirdly, an analysis prototype named SSdroid has been implemented to automatically extract SSBFs of security-sensitive operations. Finally, experiments on 9285 operations from both benign and malicious apps show that SSBFs are effective and usefulness. Our evaluation results suggest that the second-step behavior can greatly assist in Android malware detection.

关键词： Android malware Security-sensitive operations Static program analysis Classification