scientific article; zbMATH DE number 2086709
From MaRDI portal
Publication:4737247
zbMATH Open1055.94018MaRDI QIDQ4737247FDOQ4737247
Authors: Matthias Krause
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2332/23320222.htm
Title of this publication is not available (Why is that?)
Recommendations
Applications of graph theory (05C90) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cited In (24)
- Extended BDD-Based Cryptanalysis of Keystream Generators
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
- Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations
- Attacking Bivium Using SAT Solvers
- Practical cryptanalysis of Bluetooth encryption with condition masking
- Cryptanalysis of an E0-like combiner with memory
- OBDD-based cryptanalysis of oblivious keystream generators
- Self-shrinking chaotic stream ciphers
- Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators
- Algebraic attacks using binary decision diagrams
- Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator
- Cryptographic properties of the hidden weighted bit function
- Concatenations of the hidden weighted bit function and their cryptographic properties
- Cryptanalysis of three mutually clock-controlled stop/go shift registers
- Improved multi-pass fast correlation attacks with applications
- Improving OBDD attacks against stream ciphers
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
- Optimising Gröbner bases on Bivium
- Generalization of the Self-Shrinking Generator in the Galois Field
- A hybrid approach (SAT+ROBDD) to cryptanalysis of stream encryption systems
- An algebraic attack to the Bluetooth stream cipher \textsc{E0}
- De Bruijn sequences and complexity of symmetric functions
- How to Strengthen Pseudo-random Generators by Using Compression
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737247)