A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence
From MaRDI portal
Publication:3210180
DOI10.1007/BFB0030359zbMATH Open0722.68061MaRDI QIDQ3210180FDOQ3210180
J. Dj. Golić, Miodrag J. Mihaljević
Publication date: 1990
Published in: Advances in Cryptology — AUSCRYPT '90 (Search for Journal in Brave)
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Parallel algorithms in computer science (68W10)
Cited In (6)
- Discrete optimisation and fast correlation attacks
- Title not available (Why is that?)
- Cryptanalysis of an E0-like combiner with memory
- A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance
- A survey on fast correlation attacks
- Maximum-likelihood binary shift-register synthesis from noisy observations
This page was built for publication: A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210180)