Minimal linear equivalent analysis of a variable-memory binary sequence generator

DOI10.1109/18.50390zbMATH Open0702.94012OpenAlexW2143190289MaRDI QIDQ3481641

Miodrag J. Mihaljević, J. Dj. Golić

Publication date: 1990

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.50390

zbMATH Keywords

linear feedback shift registersvariable memorybinary sequence generatorfast binary sequences of large period and linear complexitymemory-based nonlinear generatorspread-spectrum and cryptographic applications

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Communication, information (94A99)

Related Items (2)

On period of multiplexed sequences ⋮ Edit distance correlation attacks on clock-controlled combiners with memory

This page was built for publication: Minimal linear equivalent analysis of a variable-memory binary sequence generator

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