Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products

DOI10.1007/S12095-020-00451-1zbMATH Open1468.94388arXiv1912.06134OpenAlexW3048148573MaRDI QIDQ2040329FDOQ2040329

Authors: Ming Yan, Tongjiang Yan, Yu Li 

Publication date: 13 July 2021

Published in: Cryptography and Communications (Search for Journal in Brave)

Abstract: This paper contributes to compute 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.

Full work available at URL: https://arxiv.org/abs/1912.06134

Recommendations

• Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
• 2-adic complexity of two classes of generalized cyclotomic binary sequences
• On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
• Study of 2-adic complexity of a class of binary sequences with optimal autocorrelation values
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

zbMATH Keywords

pseudo-random sequencesgeneralized cyclotomic sequences2-adic complexity

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Title not available (Why is that?)
• Feedback shift registers, 2-adic span, and combiners with memory
• Title not available (Why is that?)
• Generalized cyclotomic numbers of order two and their applications
• Title not available (Why is that?)
• The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
• 2-adic complexity of binary sequences with interleaved structure
• Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
• A New Method to Compute the 2-Adic Complexity of Binary Sequences
• On the 2-Adic Complexity of the Two-Prime Generator
• $2$-Adic Complexity of Binary $m$-Sequences
• A lower bound on the 2-adic complexity of the modified Jacobi sequence

Cited In (7)

• A lower bound on the 2-adic complexity of the modified Jacobi sequence
• 2-adic complexity of two classes of generalized cyclotomic binary sequences
• Symmetric 2-adic complexity of Tang-Gong interleaved sequences from generalized GMW sequence pair
• On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
• Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
• On the 2-adic complexity of cyclotomic binary sequences of order three
• On the 4-adic complexity of the two-prime quaternary generator

This page was built for publication: Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040329)