Cryptology ePrint Archive: Report 2019/729

Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients

Jingwei Zhang and Shuhong Gao and Chang-An Zhao

Abstract: We first introduce a family of binary $pq^2$ -periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q - 1$. The minimal polynomials and linear complexities are determined for the proposed sequences provided that $2^{q-1} \not \equiv 1 \pmod q^2$ . The results show that the proposed sequences have high linear complexities.

Category / Keywords: secret-key cryptography / Cryptography, linear complexity, binary sequences, Euler quotients.

Date: received 19 Jun 2019

Contact author: zhaochan3 at mail sysu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20190620:114919 (All versions of this report)

Short URL: ia.cr/2019/729


[ Cryptology ePrint archive ]