检索结果-南通市图书馆

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 4.0072, China 2 key laboratory of Mathematics Mechanization, Beijing 100080, China 1. The key laboratory of Aerospace information security and Trusted Computing Ministry of Education School of Computer Wuhan University Wuhan 430072 China2. Key Laboratory of Mathematics Mechanization Beijing 100080 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

Paillier's trapdoor function hides Θ(n) bits

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2011年第9期54卷 1827-1836页

作者： SU Dong & Lü KeWei State key laboratory of information security,Graduate University of Chinese Academy of Sciences,Beijing 10004.,China 1. State key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China

In this paper,we re-examine the bit security of Paillier’s trapdoor *** show that given a random w=gcyN mod N2 ∈ZN2* the most significant bit of its class c is a hard-core predicate,under a standard assumption that is computing composite residuosity class is *** the simultaneous security,we prove that n number of the class c’s bits are simultaneously hard-core under the standard assumption,where n is the length of c.

关键词： Paillier’s trapdoor function hard-core predicate hard-core function simultaneous security most significant bit

Conjugate adjoining problem in braid groups and new design of braid-based signatures

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2010年第3期53卷 524-536页

作者： WANG LiCheng1,2, WANG LiHua2, CAO ZhenFu3, YANG YiXian1 & NIU XinXin1 information security Center, State key laboratory of Networking and Switching {4., Beijing University of Posts and Telecommunications, Beijing 100876, China 2National Institute of information and Communications {4., Tokyo 184.8795, Japan 3Trusted Digital {4. laboratory, Shanghai Jiao Tong University, Shanghai 20024., China 1. information security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China2. National Institute of Information and Communications Technology Tokyo 184-8795 Japan3. Trusted Digital Technology Laboratory Shanghai Jiao Tong University Shanghai 200240 China

The development of quantum computation casts serious threats to the securities of most existing public-key cryptosystems. Braid-based cryptography is one of the alternatives that have potential advantages in resisting quantum attacks. In this paper, the state of the art of braid cryptography is surveyed, and then a new cryptographic problem-conjugate adjoining problem related to braid groups is proposed. Based on this problem, we design a new braid-based signature scheme. This scheme is efficient and provably secure in the random oracle model. Further, we present the comparison between braid-based signatures and RSA-based ones. The signing process of the braid-based schemes is more efficient than that of RSA-based ones, while the verifying process of the braid-based ones is observably slow. Hence, braid-based signatures are suitable for scenarios where the signing process has to be as quick as possible but delays are permitted in the verifying process, for example, in off-line e-cash systems. The key sizes in braid-based schemes are considerably large-about 2K bits in the case of secret keys and 12K bits in the case of public keys. However, braid operations are much simpler and more efficient than modular exponential operations. Therefore, braid-based schemes can be embedded into devices with low computational ability and large memory space. The capability of braid cryptosystems to resist currently known quantum attacks is also discussed from the perspective of hidden subgroup problems.

关键词： braid group conjugate adjoining problem digital signature provable security resistance to quantum attack

On the number of rotation symmetric Boolean functions

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2010年第3期53卷 537-545页

作者： FU ShaoJing1, LI Chao1,2 & QU LongJiang1,3 1Science College of National University of Defense technology, Changsha 4.0073, China 2State key laboratory of information {4., Beijing 100039, China 3National Mobile Communications Research laboratory, Southeast University, Nanjing 210096, China 1. Science College of National University of Defense technology Changsha 410073 China2. State Key Laboratory of Information Security Beijing 100039 China3. National Mobile Communications Research Laboratory Southeast University Nanjing 210096 China

Rotation symmetric Boolean functions (RSBFs) have been used as components of different cryptosystems. This class of functions are invariant under circular translation of indices. In this paper, we investigated balanced RSBFs and 1st order correlation immune RSBFs. Based on constructive techniques, we give an accurate enumeration formula for n-variable balanced RSBFs when n is a power of a prime. Furthermore, an original and efficient method to enumerate all n-variable (n prime) 1st order correlationimmune functions is presented. The exact number of 1st order correlation immune RSBFs with 11 variables is 692504.1565504.8825225250374.29764.11077684.73805520800 and the number of 13 variables has 189 digits. Then for more variables, we also provide a significant lower bound on the number of 1st order correlation immune RSBFs.

关键词： cryptography rotation symmetry correlation immunity balancedness

Capability of evolutionary cryptosystems against differential cryptanalysis

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2011年第10期54卷 1991-2000页

作者： ZHANG HuanGuo 1,2 ,LI ChunLei 1,2 & TANG Ming 1,2 1 School of Computer,Wuhan University,Wuhan 4.0072,China 2 key laboratory of Aerospace information security and Trusted Computing of Ministry of Education,Wuhan University,Wuhan 4.0072,China 1. School of Computer Wuhan University Wuhan 430072 China2. Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education Wuhan University Wuhan 430072 China

The evolutionary cryptosystem is a new *** paper studies its security level resisting against differential *** is shown that the evolutionary cryptosystem possesses higher resistance than its initial fixed cryptosystem against differential *** the basis of the relationship among the data complexity,the bit advantage and the success rate of differential cryptanalysis,it is proven that more data is needed for attacking the evolutionary cryptosystem when the bit advantage and success rate are ***,it is shown that the time complexity for attacking the evolutionary cryptosystem is higher than that of differential attacking its initial fixed cryptosystem with the same amount of plaintext-ciphertext *** research indicates that the evolutionary cryptosystem is more robust than its initial fixed cryptosystem against differential cryptanalysis.

关键词： information security cryptology evolutionary cryptosystem cryptanalysis differential cryptanalysis

Evolutionary cryptography against multidimensional linear cryptanalysis

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2011年第12期54卷 2585-2597页

作者： ZHANG HuanGuo 1,2 , LI ChunLei 1,2 & TANG Ming 1,2 1 School of Computer, Wuhan University, Wuhan 4.0079, China 2 key laboratory of Aerospace information security and Trusted Computing of Ministry of Education of China, Wuhan University, Wuhan 4.0079, China 1. School of Computer Wuhan University Wuhan 430079 China2. Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education of China Wuhan University Wuhan 430079 China

The evolutionary cryptosystem is a new cryptosystem proposed by a Chinese researcher recently. This paper studies its security level resisting against multidimensional linear cryptanalysis in this paper. It is shown that the evolutionary cryptosystem possesses higher resistance than its initial fixed cryptosystem does for resisting against multidimensional linear cryptanalysis. Multidimensional generalizations of Matsui's Algorithm 1 and Algorithm 2 based on log-likelihood ratio (LLR) statistics are introduced. By the relationship among the data complexity N , the bit advantage a and the success rate P S of these two multidimensional generalized algorithms, it is proven that more data is needed for attacking the evolutionary cryptosystem than that is needed for attacking its initial fixed cryptosystem when the bit advantage and success rate are identical. Moreover, it is shown that both time complexity and memory complexity for attacking the evolutionary cryptosystem are higher than that of attacking its initial fixed cryptosystem with the same data complexity. The research indicates that the evolutionary cryptosystem is more robust than its initial fixed cryptosystem against the multidimensional linear cryptanalysis.

关键词： information security cryptology evolutionary cryptosystem cryptanalysis multidimensional linear cryptanalysis

Competent predicate abstraction in model checking

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2011年第2期54卷 258-267页

作者： LI Li1,2,3, SONG XiaoYu4. GU Ming2,3 & LUO XiangYu2,3 1Department of Computer Science & technology, Tsinghua University, Beijing 100084. China 2key laboratory for information System {4., Ministry of Education of China, Beijing 100084. China 3School of Software, Tsinghua University, Beijing 100084. China 4.epartment of ECE, Portland State University, Portland, Oregon 97207, USA 1. Department of Computer Science & technology Tsinghua University Beijing 100084 China2. Key Laboratory for Information System Security Ministry of Education of China Beijing 100084 China3. School of Software Tsinghua University Beijing 100084 China4. Department of ECE Portland State University Portland Oregon 97207 USA

The paper presents a new approach to computing the abstract state and a maximum weight heuristic method for finding the shortest counter-example in verification of imperative programs. The strategy is incorporated in a verification system based on the counterexample-guided abstraction refinement method. The proposed method slashes both the size of the abstract state space and the number of invokes of a decision procedure. A number of benchmarks are employed to evaluate the effectiveness of the approach.

关键词： program model checking predicate abstraction weight heuristic

Dynamic tree-based authenticated group key exchange protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2010年第8期53卷 1591-1602页

作者： LI Hui 1,2 , WU ChuanKun 1 & TENG JiKai 1,2 1 State key laboratory of information security, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China 2 Graduate University of Chinese Academy of Sciences, Beijing 10004., China 1. State key laboratory of information security Institute of Software Chinese Academy of Sciences Beijing 100190 China2. Graduate University of Chinese Academy of Sciences Beijing 100049 China

Authenticated group key exchange protocols allow a group of users over a public network to establish a shared secret key for the subsequent cryptographic goals. In this paper, we extend BD-II scheme into a dynamic setting, and propose a tree-based authenticated key exchange protocol which is more suitable for dynamic groups in such as ad hoc networks. Our protocol is proven secure in random-oracle model. Additionally, we analyze the costs of our protocols in both communication and computation terms, and compare its performance with three well-known protocols.

关键词： tree-based group key exchange dynamic provable security

Power functions with low uniformity on odd characteristic finite fields

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China Mathematics 2010年第8期53卷 1931-1940页

作者： ZHA ZhengBang 1,3 & WANG XueLi 2 1 School of Mathematical Sciences,Luoyang Normal University,Luoyang 4.1022,China 2 School of Mathematical Sciences,South China Normal University,guangzhou 510631,China 3 State key laboratory of information {4.,Graduate University of Chinese Academy of Sciences,Beijing 10004.,China 1. School of Mathematical Sciences Luoyang Normal University Luoyang 471022 China3. State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China2. School of Mathematical Sciences South China Normal University Guangzhou 510631 China

In this paper,we give some new low differential uniformity of some power functions defined on finite fields with odd *** corollaries of the uniformity,we obtain two families of almost perfect nonlinear functions in GF... 详细信息

关键词： almost perfect nonlinear function differential uniform function finite field

维普期刊数据库