A probabilistic cryptanalytic method for a time-variant permutation generator

DOI10.1016/S0020-0190(01)00146-6MaRDI QIDQ1603353zbMATH OpenOpenAlexFDO

Authors J. Dj. Golić

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(01)00146-6

zbMATH Keywords

CryptanalysisIterative algorithmsKeystream generatorRecursive probabilities

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 3919629
• Time-analysis of pseudorandom bit generators
• Randomized stopping times and provably secure pseudorandom permutation generators
• An analytic approach to secure pseudo-random generation
• scientific article; zbMATH DE number 1612513
• Cryptanalytic Attack on Cryptographic Sequence Generators: The Class of Clock-Controlled Shrinking Generators
• The iterated random permutation problem with applications to cascade encryption
• A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
• Pseudorandom functions and permutations provably secure against related-key attacks

Cites work

• Analysis Methods for (Alleged) RC4
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 854547 (Why is no real title available?)
• Linear models for a time-variant permutation generator
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
• Recent advances in stream cipher cryptanalysis

Cited in

(2)

• scientific article; zbMATH DE number 1612513 (Why is no real title available?)
• Linear models for a time-variant permutation generator

This page was built for publication: A probabilistic cryptanalytic method for a time-variant permutation generator

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