检索结果-南通市图书馆

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 1. key lab of specialty fiber optics and optical access network Ministry of Education Shanghai University Shanghai 200072 China2. Computer School of Wuhan University Wuhan 430072 China3. Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan 430072 China4. Huawei Technologies CO. LTD. Shanghai 201206 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

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

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

Koblitz Elliptic Curves Generating Based on Evolutionary Cryptography Theory and Verifying Parameters Recommended by NIST

在线全文

学校读者我要写书评

暂无评论

china Communications 2011年第4期8卷 41-49页

作者：王潮张焕国刘礼黎 key lab of specialty fiber optics and optical access network Ministry of Education Shanghai University key laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Computer School Wuhan University Huawei Technologies Co. Ltd

Elliptic curve cryptography is one of the most important public-key *** Koblitz Curve is a special kind of elliptic curve in ECC and its security mainly depends on the base *** on Evolutionary Cryptography theory,which becomes a principal concept for cryptography design and cryptanalysis,we propose a new algorithm for secure EC generation based on Ant Colony Optimization(ACO)to accelerate the search process of safe base *** preliminarily deal with secure Koblitz curve selecting over the field F(2800).Experiments show that the base field and base point of secure curves generated by ant colony algorithm have gone beyond the parameter range of Koblitz curves recommended by *** can present many new secure Koblitz curves,including base field and base point,which are not recommended by *** maximum size of our secure Koblitz curve has gone beyond *** algorithm in this paper follows the same cryptography criteria recommended by the ***,it can resist current *** analysis and experimental results prove that the new algorithm is effective and successful,and it is the first successful practice of Evolutionary Cryptography theory in public cryptography research.

关键词： evolutionary cryptography ECC secure curves ACO

Byzantine Fault-Tolerant Routing for Large-Scale Wireless Sensor networks Based on Fast ECDSA

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2015年第6期20卷 627-633页

作者： Jiawei Xu Keda wang chao wang Feng Hu Zhenhua zhang Shiyi Xu Jie Wu Department of Communication and Information Engineering Shanghai University china Information Security Research Institute Ltd. Huawei Institute of Computer Engineering and Science Shanghai University Department of Computer and Information Sciences Temple University

Wireless sensor networks are a favorite target of Byzantine malicious attackers because of their limited energy, low calculation capability, and dynamic topology, and other important characteristics. The Byzantine Generals Problem is one of the classical problems in the area of fault tolerance, and has wide application, especially in distributed databases and systems. There is a lot of research in agreement and replication techniques that tolerate Byzantine faults. However, most of this work is not suited to large-scale wireless sensor networks, due to its high computational complexity. By introducing Fast ECDSA(Elliptic Curve Digital Signature Algorithm), which can resist timing and energy attacks, and reduce the proportion of verifying signature algorithm to generating signature algorithm to 1.2 times, we propose a new Byzantine fault-tolerant routing algorithm for large-scale wireless sensor networks with double-level hierarchical architecture. In different levels, the algorithm runs different BFT *** and simulation results have proved that this algorithm has high security and the number of communication rounds between clusters is reduced by 1/3, which balances the network load. At the same time, the application of Fast ECDSA improves the security level of the network without burdening it.

关键词： wireless sensor networks Byzantine Generals Proble