检索结果-内蒙古大学图书馆

Cryptographic properties of truncated sequence generated by single cycle T-function

Journal of Information and Computational science 2013年第2期10卷 461-468页

作者： Wang, Yan Hu, Yupu Zhang, Wenzheng Department of Mathematics Xi'an University of Architecture and Technology Xi'an 710055 China School of Telecommunications Engineering Xidian University Xi'an 710071 China Science and Technology on Communication Security Laboratory Thirtieth Institute China Electronics Technology Group Corporation Chengdu 610041 China

Single cycle T-functions have received considerable attention recent years. The autocorrelation properties and the 2-adic complexity of the truncated sequence are investigated based on the special properties of single cycle T-function. The truncated sequence has better autocorrelation spectrum than that of the state output sequence, and has quiet high 2-adic complexity. The result shows that the truncated sequence of the single cycle T-function has rather good cryptographic properties. 2013 Binary Information Press.

关键词： Autocorrelation

来源：评论

学校读者我要写书评

暂无评论

New sequences of period p n and p n + 1 via projective linear groups

引用

8th China International Conference on Information security and Cryptology, INSCRYPT 2012

作者： Wang, Lin Hu, Zhi Science and Technology on Communication Security Laboratory Chengdu 610041 Sichuan China Beijing International Center for Mathematical Research Peking University Beijing 100871 China

ISBN: (纸本)9783642385186

Two pseudorandom number generators are devised based on the projective linear group over, outputting balanced sequences on meeting some statistical randomness properties. Sequences generated by the first generator have least period p n + 1 if p n ≥ 7, and linear complexity at least p n - p n - 1. Furthermore, autocorrelation of such sequences oscillates within a low amplitude except for the trivial peaks. If p n âˆ‰ {2,4,8,16}, sequences generated by the second generator have least period p n, linear complexity at least p n - 1 + 1, and good k-error linear complexity when p = 2. If p = 2 and 2 n is large enough, then for a binary sequence generated by either generator, a randomly chosen 2-tuple is almost uniformly distributed in {00,01,10,11}, the probability that a randomly chosen 3-tuple is a run of length one is approximately 1/4. For such a binary sequence and integers 0 12k ≤ m, s(t) + s(t + i 1) + s(t + i 2) + â"¯ + s(t + i k ) is equal to 0 or 1 at almost the same probability when m is far less than 2 n/2. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Autocorrelation

来源：评论

学校读者我要写书评

暂无评论

Attack on recent homomorphic encryption scheme over integers

Attack on recent homomorphic encryption scheme over integers

引用

FTRA 7th International Conference on Multimedia and Ubiquitous Engineering, MUE 2013

作者： Yang, Haomiao Kim, Hyunsung Tang, Dianhua College of Computer Science and Engineering UEST of China Chengdu 610054 China Department of Cyber Security Kyungil University Kyungpook Kyungsansi 712-701 Korea Republic of Science and Technology on Communication Security Laboratory Chengdu 610041 China

ISBN: (纸本)9789400767379

At CDCIEM 2012, Yang et al. proposed a new construction of somewhat homomorphic encryption scheme over integers, which is quite efficient in the perspective of the key size. In this paper, we present an effective lattice reduction attack on Yang et al.'s scheme, where it is easy to recover the plaintext by applying LLL algorithm. © 2013 Springer science+Business Media Dordrecht(Outside the USA).

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Improvement of chopchop attack

Improvement of chopchop attack

引用

2nd International Conference on Information Engineering and Applications, IEA 2012

作者： Ji, Qingbing Zhang, Lijun Yu, Fei China Electronics Technology Group Corporation 30 Group Science and Technology on Communication Security Laboratory Venture Road No. 6 High-tech Development Zone Chengdu 610041 China

ISBN: (纸本)9781447148463

Wired equivalent privacy (WEP) is a security protocol in the IEEE 802.11 wireless standard. At present, three attacks are frequently exploited: chopchop attack, Korek attack, and PTW attack. The first can decrypt a packet, while the latter two could recover user's key from known plaintext/ciphertext pairs. We propose more efficient combinational mode of these attacks, and also improve chopchop attack. Our chopchop version does not need to recover the integrity check value (ICV), which reduces 32 data frames forgery. Counting in case of data payload with average length 1,156 bytes, our combinational mode "chopchop + PTW" saves 1,141 bytes plaintext recovery, improving efficiency by 98 %. Furthermore, the mode "chopchop + Korek + PTW" saves 1,154 bytes plaintext recovery, receiving 99 % efficiency improvement. Meanwhile, our attack modes greatly reduce the risk of being detected. So it is more suitable for the real environment, especially when there is no client or low data communication. © 2013 Springer-Verlag.

关键词： IEEE Standards

来源：评论

学校读者我要写书评

暂无评论

A Task Scheduling Algorithm based on QoS-Driven in Cloud Computing

引用

Procedia Computer science 2013年 17卷 1162-1169页

作者： Xiaonian Wu Mengqing Deng Runlian Zhang Bing Zeng Shengyuan Zhou School of Information and Communication Guilin University of Electronic Technology Guilin 541004 China Science and Technology on Communication Security Laboratory Chengdu 610041 China

Quality of Service is an inevitable issue needing to be deal with in task scheduling of cloud computing. This paper proposes a task scheduling algorithm based on QoS-driven for cloud computing. Firstly, in order to reflect the precedence relation of tasks, the proposed algorithm computes the priority of tasks according to the special attributes of tasks, and then sorts tasks by priority. Secondly, the algorithm evaluates the completion time of each task on different services, and schedules each task onto a service which can complete the task as soon as possible according to the sorted task queue. The experimental results based on CloudSim show that the algorithm can achieve good performance and load balancing by QoS driving from both priority and completion time.

关键词： Cloud computing Task scheduling Quality of service Priority

来源：评论

学校读者我要写书评

暂无评论

A Trust Evaluation Model for Cloud Computing

引用

Procedia Computer science 2013年 17卷 1170-1177页

作者： Xiaonian Wu Runlian Zhang Bing Zeng Shengyuan Zhou School of Information and Communication Guilin University of Electronic Technology Guilin 541004 China Science and Technology on Communication Security Laboratory Chengdu 610041 China

Trust has attracted extensive attention in social science and computer science as a solution to enhance the security of the system. This paper proposes a trust evaluation model based on D-S evidence theory and sliding windows for cloud computing. The timeliness of the interaction evidence as the first-hand evidence is reflected by introducing sliding windows. The direct trust of entities is computed based on the interaction evidence by D-S evidence theory. The conflict of the recommendation trust as the second-hand evidence is eliminated with a help of an improved fusion approach as far as possible. Finally, the combination of the recommendation trust exposes the credibility of entities. Experimental results show that the proposed model is effective and extensible.

关键词： Cloud computing Trust evaluation Evidence theory Sliding windows

来源：评论

学校读者我要写书评

暂无评论

Generation and tate pairing computation of ordinary elliptic curves with embedding degree one

Generation and tate pairing computation of ordinary elliptic...

引用

15th International Conference on Information and communications security, ICICS 2013

作者： Hu, Zhi Wang, Lin Xu, Maozhi Zhang, Guoliang Beijing International Center for Mathematical Research Peking University Beijing 100871 China LMAM School of Mathematical Sciences Peking University Beijing 100871 China Science and Technology on Communication Security Laboratory Chengdu 610041 China

ISBN: (纸本)9783319027258

We generalize Boneh-Rubin-Silverberg method [3] to construct ordinary elliptic curves with embedding degree one, which provides composite order groups for cryptographic protocols based on such bilinear groups. Our construction is more efficient and almost optimal for parameter setting. In addition, we analyze the non-degeneracy of symmetric pairing derived from the reduced Tate pairing on such curves, and prove that its non-degeneracy only relies on the existence of distortion maps. Based on this observation, we propose a new method for computing the reduced Tate pairing on ordinary curves with embedding degree one. Compared with previous methods, our formulae provide faster computation of the reduced Tate pairing on such curves, which also implies that the reduced Tate pairing may be preferred to use as symmetric pairing instead of the modified Weil pairing in certain cases. © Springer International Publishing 2013.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Unified and Complete Point Addition Formula for Elliptic Curves

引用

电子学报(英文版) 2012年第2期21卷 345-349页

作者： ZHANG Lijun WANG Kunpeng WANG Hong Science and Technology on Communication Security Laboratory Chengdu 610041 China State Key Laboratory of Information Security GUCAS Beijing 100049 China

As is well known, the unified point addition formula is useful for resisting side channel attacks in elliptic curve cryptography. Furthermore, if the unified formula is complete, which means it is valid for any two points, then there are no exceptional cases to be described particularly. This feature is especially preferable for elegant codes of elliptic crypto-algorithms. Therefore, the unified and also complete point addition formula can provide the advantage for good security and convenient implementation. In this paper, we exploit sufficient and necessary condition for the existence of unified and complete point addition formula on several known elliptic curve models such as Weierstrass cu- bics, Jacobi quartics, Edwards curves, etc.. Moreover, we study another form of elliptic curves called Selmer curves. For practical application, we finally give some numerical examples of cryptographic secure Selmer curves.

关键词：椭圆曲线加密加法公式维尔斯特拉斯统一公式加密算法曲线模型密码安全安全性

来源：评论

学校读者我要写书评

暂无评论

New bounds on the sum-of-squares indicator

New bounds on the sum-of-squares indicator

引用

2012 7th International ICST Conference on communications and Networking in China, CHINACOM 2012

作者： Zhou, Yu Dong, Xinfeng Zhang, Wenzheng Zeng, Bing Science and Technology on Communication Security Laboratory Chengdu 610041 China

ISBN: (纸本)9781467326995

The two indicators the sum-of-squares indicator and the absoluate indicator between two different Boolean functions f and g are introduced by Yu Zhou, Min Xie, Guozhen Xiao, On the global avalanche characteristics of two Boolean functions and the higher order nonlinearity. Information sciences. 180(2010) 256-265, to measure of cryptographic behavior in a global manner. In this paper, we derive a new bound on the sum-of-squares indicator. Moreover, we obtain some bounds on the sum-of-squares indicator of a Boolean function f by using two decomposition functions f1, f2. Finally, we give a method to construct balanced Boolean functions with n(n >= 6) variables by the disjoint spectra functions, where n is an even integer, satisfying strict avalanche criterion, high nonlinearity and lower GAC. © 2012 IEEE.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Searching short recurrences of nonlinear shift registers via directed acyclic graphs 7

Searching short recurrences of nonlinear shift registers via...

引用

7th China International Conference on Information security and Cryptography, Inscrypt 2011

作者： Wang, Lin Shen, Bing Qiao, Tongxu Science and Technology on Communication Security Laboratory Chengdu 610041 Sichuan China No.30 Institute of CETC Chengdu 610041 Sichuan China

ISBN: (纸本)9783642347030

Finding a recurrence of a shift register gives its equivalent shift register in Fibonacci configuration and hence helps to decide whether different nonlinear shift registers are equivalent, i.e., whether they generate the same set of output sequences. We define a dependence graph of a shift register and it is a directed acyclic graph related to the shift register. We show that existence of a dependence graph with a special property of a nonlinear shift register ensures existence of a short recurrence of the sequence generated by the nonlinear shift register. We also present an algorithm to search dependence graphs of a nonlinear shift register. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Shift registers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：