Welcome to the resource topic for 2019/729
Title:
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients
Authors: Jingwei Zhang, Shuhong Gao, 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.
ePrint: https://eprint.iacr.org/2019/729
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .