activity
20182021
collaborators

6 papers

math.NT2021

Correlation measures of binary sequences derived from Euler quotients

Huaning Liu, Zhixiong Chen, Chenhuang Wu

Fermat-Euler quotients arose from the study of the first case of Fermat's Last Theorem, and have numerous applications in number theory. Recently they were studied from the cryptog…

cs.IT2020

Asymptotically optimal codebooks derived from generalised bent functions

Qiuyan Wang, Yang Yan, Chenhuang Wu +1

Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes…

cs.IT2020

A kind of quaternary sequences of period and their linear complexity

Qiuyan Wang, Chenhuang Wu, Minghui Yang +1

Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over with period is constr…

cs.IT2020

Multisequences with high joint nonlinear complexity from function fields

Yang Yan, Qiuyan Wang, Chenhuang Wu

Multisequences over finite fields play a pushing role in the applications that relate to parallelization, such as word-based stream ciphers and pseudorandom vector generation. It i…

cs.CR2019

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

Chenhuang Wu, Vladimir Edemskiy, Chunxiang Xu

We consider the -error linear complexity of binary sequences derived from Eluer quotients modulo ( is an odd prime), recently introduced by J. Zhang and C. Zhao. We ad…

cs.CR2018

On -error linear complexity of pseudorandom binary sequences derived from Euler quotients

Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke +1

We investigate the -error linear complexity of pseudorandom binary sequences of period derived from the Euler quotients modulo , a power o…