Work

On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p

Year: 2019

Type: preprint

Abstract: We consider the $k$-error linear complexity of binary sequences derived from Eluer quotients modulo $2p$ ($p>3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of $k$-error linear complexity for all $k>0$. Our results indicate that such sequences have good stability from the viewpoint of cryptography.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1910.04607

Authors: Wu, Chenhuang, Edemskiy, Vladimir, Xu, Chunxiang

Institutions: University of Electronic Science and Technology of China, Putian University, Yaroslav-the-Wise Novgorod State University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, Russian Foundation for Basic Research

Awards: G2067983305, 云存储中加密数据的安全去重方法研究, G7946354190, G8363781700

OpenAlex ID: W2980165112

Cites: 23

Cited by:

Related to: 10