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

Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients

CRYPTOLOGIA 2022年第2期46卷 148-166页

作者： Edemskiy, Vladimir Wu, Chenhuang Xu, Chunxiang Novgorod State Univ Dept Appl Math & Informat Sci Veliky Novgorod Russia Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Sichuan Peoples R China Putian Univ Prov Key Lab Financial Math Putian Peoples R China Univ Elect Sci Technol China Ctr Cyber Secur Sch Comp Sci & Engn Chengdu Peoples R China

In this paper, we generalize the results about the k-error linear complexity of binary sequences derived from Euler quotients modulo pr(-1) on the q-ary sequences. We also continue the study of q-ary sequences derived from Euler quotients modulo 2p started by R. Mohammed et al. (LNCS, 11634, 2019) and investigate the k-error linear complexity of sequences derived from Euler quotients with a period 2p(r). In particular, we generalize the results of Wu et al. (IEEE Access, 8, 2020) about k-error the binary sequences derived by Euler quotients modulo 2p on the same sequences with a period 2p(r).

关键词： Euler quotients k-error linear complexity pseudorandom sequences q-ary sequences

来源：评论

学校读者我要写书评

暂无评论

On k-error linear complexity of Binary Sequences Derived From Euler Quotients Modulo 2p

引用

IEEE ACCESS 2020年 8卷 51477-51481页

作者： Wu, Chenhuang Edemskiy, Vladimir Xu, Chunxiang Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China Putian Univ Prov Key Lab Financial Math Putian 351100 Peoples R China Novgorod State Univ Dept Appl Math & Informat Sci Veliky Novgorod 173003 Russia

Pseudorandom sequences play an important role in communication and stream ciphers. In recent years, the method of generating pseudorandom sequences based on arithmetical functions has attracted increasing attention. k-error linear complexity is an important index to evaluate the stability of a sequence. Recently, J. Zhang and C. Zhao introduced binary sequences derived from Euler quotients modulo 2p (where p > 3 is an odd prime). In this paper, the k-error linear complexity of such sequences over F-2 was considered with the condition that 2 is a primitive root modulo p(2). Certain decimal sequences were used to determine the values of k-error linear complexity for all k > 0. The results showed that such sequences have good stability in terms of cryptography.

关键词： Cryptography Euler quotients k-error linear complexity binary sequences

来源：评论

学校读者我要写书评

暂无评论

On the k-error linear complexity of Subsequences of d-ary Sidel'nikov Sequences Over Prime Field Fd

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2020年第3期31卷 293-300页

作者： Yang, Minghui Wen, Jiejing Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing 100195 Peoples R China

We study the k-error linear complexity of subsequences of the d-ary Sidel'nikov sequences over the prime field F-d. A general lower bound for the k-error linear complexity is given. For several special periods, we... 详细信息

关键词： k-error linear complexity subsequences Sidel'nikov sequences

来源：评论

学校读者我要写书评

暂无评论

Analysis of the k-error linear complexity and error Sequence for 2pⁿ-Periodic Binary Sequence

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2018年第8期E101A卷 1197-1203页

作者： Niu, Zhihua kong, Deyu Ren, Yanli Du, Xiaoni Shanghai Univ Sch Comp Engn & Sci Shanghai 200444 Peoples R China Shanghai Univ Shanghai Inst Adv Commun & Data Sci Shanghai 200444 Peoples R China Shanghai Univ Sch Commun & Informat Engn Shanghai 200444 Peoples R China Northwest Normal Univ Coll Math & Informat Sci Lanzhou 730070 Gansu Peoples R China

The k-error linear complexity of a sequence is a fundamental concept for assessing the stability of the linear complexity. After computing the k-error linear complexity of a sequence, those bits that cause the linear complexity reduced also need to be determined. For binary sequences with period 2p(n), where p is an odd prime and 2 is a primitive root modulo p(2), we present an algorithm which computes the minimum number k such that the k-error linear complexity is not greater than a given constant c. The corresponding error sequence is also obtained.

关键词： periodic sequence linear complexity k-error linear complexity error sequence

来源：评论

学校读者我要写书评

暂无评论

On k-error linear complexity of Zeng-Cai-Tang-Yang Generalized Cyclotomic Binary Sequences of Period p² 1st

On <i>k</i>-error Linear Complexity of Zeng-Cai-Tang-Yang Ge...

引用

1st International Conference on Frontiers in Cyber Security (FCS)

作者： Wu, Chenhuang Xu, Chunxiang Univ Elect Sci & Technol China Ctr Cyber Secur Sch Comp Sci & Engn Chengdu 611731 Sichuan Peoples R China Putian Univ Prov Key Lab Appl Math Putian 351100 Fujian Peoples R China

ISBN: (纸本)9789811330957;9789811330940

Due to good pseudorandom properties, generalized cyclotomic sequences have been widely used in simulation, radar systems, cryptography, and so on. In this paper, we consider the k-error linear complexity of Zeng-Cai-Tang-Yang generalized cyclotomic binary sequences of period p(2), proposed in the recent paper "New generalized cyclotomic binary sequences of period p(2)", by Z. Xiao et al., who calculated the linear complexity of the sequence (Designs, Codes and Cryptography, 2018, 86(7): 1483-1497). More exactly, we determine the values of k-error linear complexity over F-2 for f = 2 and almost k > 0 in terms of the theory of Fermat quotients. Results indicate that such sequences have good stability.

关键词： Cryptography Pseudorandom sequences k-error linear complexity Generalized cyclotomic classes Fermat quotients

来源：评论

学校读者我要写书评

暂无评论

Cube Theory and k-error linear complexity Profile

引用

INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS 2016年第7期10卷 169-184页

作者： Zhou, Jianqin Liu, Wanquan Wang, Xifeng Curtin Univ Dept Comp Perth WA 6102 Australia Anhui Univ Technol Comp Sci Sch Maanshan 243002 Peoples R China

The linear complexity and k-error linear complexity of a sequence have been used as important measures for keystream strength. In order to study k-error linear complexity of binary sequences with period 2(n), a new tool called cube theory is developed. In this paper, we first give a general decomposition approach to decompose a binary sequence with period 2(n) into some disjoint cubes. Second, a counting formula for m-cubes with the same linear complexity is derived, which is equivalent to the counting formula for k-error vectors. The counting formula of 2(n)-periodic binary sequences which can be decomposed into more than one cube is also investigated, which extends an important result by Etzion et al.. Finally, we study 2(n)-periodic binary sequences with the given k-error linear complexity profile. Consequently, the complete counting formula of 2(n)-periodic binary sequences with given k-error linear complexity profile of descent points 2, 4 and 6 is derived. The periodic sequences having the prescribed k-error linear complexity profile with descent points 1, 3, 5 and 7 are also briefly discussed.

关键词： Periodic sequence linear complexity k-error linear complexity cube theory

来源：评论

学校读者我要写书评

暂无评论

The Distribution of 2ⁿ-Periodic Binary Sequences with Fixed k-error linear complexity 1

引用

12th International Conference on Information Security Practice and Experience (ISPEC)

作者： Pan, Wenlun Bao, Zhenzhen Lin, Dongdai Liu, Feng Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing 100093 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

ISBN: (数字)9783319491516

ISBN: (纸本)9783319491516;9783319491509

The linear complexity and k-error linear complexity of sequences are important measures of the strength of key-streams generated by stream ciphers. Fu et al. studied the distribution of 2(n)-periodic binary sequences with 1-error linear complexity in their SETA 2006 paper. Recently, people have strenuously promoted the solving of this problem from k = 2 to k = 4 step by step. Unfortunately, it still remains difficult to obtain the solutions for larger k. In this paper, we propose a new sieve method to solve this problem. We first define an equivalence relationship on error sequences and build a relation between the number of sequences with given k-error linear complexity and the number of pair-wise non-equivalent error sequences. We introduce the concept of cube fragment and build specific equivalence relation based on the concept of the cube classes to figure out the number of pair-wise non-equivalent error sequences. By establishing counting functions for several base cases and building recurrence relations for different cases of k and L, it is easy to manually get the complete counting function when k is not too large. And an efficient algorithm can be derived from this method to solve the problem using a computer when k is large.

关键词： Sequence linear complexity k-error linear complexity Counting function Cube theory

来源：评论

学校读者我要写书评

暂无评论

On the k-error linear complexity of binary sequences derived from polynomial quotients

引用

Science China(Information Sciences) 2015年第9期58卷 83-97页

作者： CHEN ZhiXiong NIU ZhiHua WU ChenHuang School of Mathematics Putian University School of Computer Engineering and Science Shanghai University

The k-error linear complexity is an important cryptographic measure of pseudorandom sequences in stream ciphers. In this paper, we investigate the k-error linear complexity of p2-periodic binary sequences defined from the polynomial quotients modulo p, which are the generalizations of the well-studied Fermat ***, first we determine exact values of the k-error linear complexity over the finite field F2 for these binary sequences under the assumption of 2 being a primitive root modulo p2, and then we determine their k-error linear complexity over the finite field Fp. Theoretical results obtained indicate that such sequences possess‘good’ error linear complexity.

关键词： cryptography Fermat quotients polynomial quotients binary sequences linear complexity k-error linear complexity

来源：评论

学校读者我要写书评

暂无评论

On the Second Descent Points for the k-error linear complexity of 2~n-Periodic Binary Sequences

On the Second Descent Points for the K-Error Linear Complexi...

引用

2016 International Conference on Communications, Information Management and Network Security (CIMNS2016)

作者： Jianqin Zhou Xifeng Wang Wanquan Liu School of Computer Science Anhui Univ.of Technology Department of Computing Curtin University

ISBN: (纸本)9781510830981

In this paper, a constructive approach for determining CELCS（critical error linear complexity spectrum） for the kerror linear complexity distribution of 2~n-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point（critical point） distribution of the k-error linear complexity for 2~n-periodic binary sequences is characterized. As a by product, it is proved that the maximum k-error linear complexity is 2~n-(2) over all 2~n-periodic binary sequences, where 2<=k < 2 and l < n. With these results, some work by Niu et al. are proved to be incorrect.

关键词： periodic sequence linear complexity k-error linear complexity k-error linear complexity distribution

来源：评论

学校读者我要写书评

暂无评论

The k-error linear complexity distribution for -periodic binary sequences

引用

DESIGNS CODES AND CRYPTOGRAPHY 2014年第1期73卷 55-75页

作者： Zhou, Jianqin Liu, Wanquan Anhui Univ Technol Sch Comp Sci Maanshan 243002 Peoples R China Hangzhou Dianzi Univ Telecommun Sch Hangzhou 310018 Peoples R China Curtin Univ Dept Comp Perth WA 6102 Australia

The linear complexity and the -error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, we investigate the -error linear complexity distribution of -periodic binary sequences in this paper based on Games-Chan algorithm. First, for , the complete counting functions for the -error linear complexity of -periodic binary sequences (with linear complexity less than ) are characterized. Second, for , the complete counting functions for the -error linear complexity of -periodic binary sequences with linear complexity are presented. Third, as a consequence of these results, the counting functions for the number of -periodic binary sequences with the -error linear complexity for and are obtained.

关键词： Periodic sequence linear complexity k-error linear complexity k-error linear complexity distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：