Correlation measures of binary sequences derived from Euler quotients

09/10/2021
by   Huaning Liu, et al.
0

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 cryptographic aspects by constructing many pseudorandom binary sequences, whose linear complexities and trace representations were calculated. In this work, we further study their correlation measures by using the approach based on Dirichlet characters, Ramanujan sums and Gauss sums. Our results show that the 4-order correlation measures of these sequences are very large. Therefore they may not be suggested for cryptography.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2019

Linear Complexity of A Family of Binary pq^2-periodic Sequences From Euler Quotients

We first introduce a family of binary pq^2-periodic sequences based on t...
research
03/09/2018

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

We investigate the k-error linear complexity of pseudorandom binary sequ...
research
10/08/2019

Computing oscillatory solutions of the Euler system via K-convergence

We develop a method to compute effectively the Young measures associated...
research
10/10/2019

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

We consider the k-error linear complexity of binary sequences derived fr...
research
07/25/2021

Correlation, Linear Complexity, Maximum order Complexity on Families of binary Sequences

Correlation measure of order k is an important measure of randomness in ...
research
06/12/2018

Sequences with Low Correlation

Pseudorandom sequences are used extensively in communications and remote...
research
08/27/2020

Perfect linear complexity profile and Apwenian sequences

Sequences with perfect linear complexity profile were defined more than ...

Please sign up or login with your details

Forgot password? Click here to reset