A construction of new classes of filter generators without equivalent states

DOI10.4213/MVK133MaRDI QIDQ5152369zbMATH OpenOpenAlexFDO

Authors D. N. Bylkov

Publication date 20 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk133

zbMATH Keywords

coordinate sequencesfiltering of linear recurrenceslinear recurrent sequences over residue rings

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• A New Attack on the Filter Generator
• On nonlinear filter generators
• A Survey of Recent Attacks on the Filter Generator
• Attacking the Filter Generator over GF(2 m )
• The Linear Vector Space Spanned by the Nonlinear Filter Generator

Cites work

• A class of injective compressing maps on linear recurring sequences over a Galois ring
• A solution of the Harer-Zagier equation
• An algorithm to restore a linear recurring sequence over the ring \(R = \mathbb Z_{p^n}\) from a linear complication of its highest coordinate sequence
• Compression Mappings on Primitive Sequences Over<tex>$Z/(p^e)$</tex>
• Further Result of Compressing Maps on Primitive Sequences Modulo Odd Prime Powers
• Further Results on the Distinctness of Binary Sequences Derived From Primitive Sequences Modulo Square-Free Odd Integers
• scientific article; zbMATH DE number 1245626 (Why is no real title available?)
• scientific article; zbMATH DE number 2120400 (Why is no real title available?)
• Injective maps on primitive sequences over \(\mathbb Z/(p^e)\)
• Injectivity of Compressing Maps on Primitive Sequences Over ${\BBZ}/(p^{e})$
• Kerdock code in a cyclic form
• Linear recurring sequences over Galois rings
• Linear recurring sequences over rings and modules
• On the Distinctness of Binary Sequences Derived From Primitive Sequences Modulo Square-Free Odd Integers
• On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
• On the distinctness of modular reductions of primitive sequences over \(\mathbb Z/(2^{32}-1)\)
• Reconstruction of a linear recurrence of maximal period over a Galois ring from its highest coordinate sequence
• Reconstruction of linear recurrent sequence over prime residue ring from its image
• Uniqueness of the distribution of zeroes of primitive level sequences over \(\mathbb Z/(p^e)\)

Cited in

(5)

• Equivalent keys of a nonlinear filter generator using a power residue symbol
• Upper bound on the number of equivalent oscillator-notch filter circuits: A group theoretic approach
• The complexity of initial state recovery for a class of filter generators
• The method for constructing uniform planar approximations of the filter generator
• Properties of substitutions generated by a class of filtering generators;Свойства подстановок, порождаемых одним классом фильтрующих генераторов

This page was built for publication: A construction of new classes of filter generators without equivalent states

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