The complexity of initial state recovery for a class of filter generators

DOI10.4213/MVK153MaRDI QIDQ5152380zbMATH OpenOpenAlexFDO

Authors F. M. Malyshev

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/mvk153

zbMATH Keywords

filter generatorpseudo-random sequencerecurrent sequence

Mathematics Subject Classification ID

Recurrences (11B37) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A New Attack on the Filter Generator
• Generalization of one method of a filter generator key recovery
• Attacking the Filter Generator over GF(2 m )
• Attacking the Filter Generator by Finding Zero Inputs of the Filtering Function
• A construction of new classes of filter generators without equivalent states

Cited in

(2)

• Криптографически слабые функции усложнения для трехчленных линейных рекуррентных последовательностей
• The method for constructing uniform planar approximations of the filter generator

This page was built for publication: The complexity of initial state recovery for a class of filter generators

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