Paper 2019/729
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients
Jingwei Zhang, 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.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Cryptographylinear complexitybinary sequencesEuler quotients.
- Contact author(s)
- zhaochan3 @ mail sysu edu cn
- History
- 2019-06-20: received
- Short URL
- https://ia.cr/2019/729
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/729,
author = {Jingwei Zhang and Shuhong Gao and Chang-An Zhao},
title = {Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients},
howpublished = {Cryptology ePrint Archive, Paper 2019/729},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/729}},
url = {https://eprint.iacr.org/2019/729}
}
