scientific article; zbMATH DE number 2086709
From MaRDI portal
Publication:4737247
Recommendations
Cited in
(25)- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
- Cryptanalysis of an E0-like combiner with memory
- Practical cryptanalysis of Bluetooth encryption with condition masking
- An algebraic attack to the Bluetooth stream cipher \textsc{E0}
- Algebraic attacks using binary decision diagrams
- Generalization of the Self-Shrinking Generator in the Galois Field
- Improving OBDD attacks against stream ciphers
- Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations
- Attacking Bivium Using SAT Solvers
- Improved multi-pass fast correlation attacks with applications
- Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator
- How to Strengthen Pseudo-random Generators by Using Compression
- Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators
- Cryptographic properties of the hidden weighted bit function
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
- Cryptanalysis of three mutually clock-controlled stop/go shift registers
- Concatenations of the hidden weighted bit function and their cryptographic properties
- A hybrid approach (SAT+ROBDD) to cryptanalysis of stream encryption systems
- Extended BDD-Based Cryptanalysis of Keystream Generators
- Optimising Gröbner bases on Bivium
- De Bruijn sequences and complexity of symmetric functions
- Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
- Self-shrinking chaotic stream ciphers
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
- OBDD-based cryptanalysis of oblivious keystream generators
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)