Improved fast correlation attacts using parity-check equations of weight 4 and 5
From MaRDI portal
Publication:3374940
Recommendations
Cited in
(46)- Finding low-weight polynomial multiples using the rho method
- The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
- A necessary and sufficient condition for a class of nonsingular Galois NFSRs
- Walsh transforms and cryptographic applications in bias computing
- Correlation attacks on stream ciphers: computing low-weight parity checks based on error-correcting codes
- Cryptanalysis of an E0-like combiner with memory
- 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
- A generic method for investigating nonsingular Galois NFSRs
- Fast Correlation Attacks: Methods and Countermeasures
- On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
- Fast correlation attacks on nonlinear filter generators
- Constructing de Bruijn sequences based on a new necessary condition
- A new construction of odd-variable rotation symmetric Boolean functions with good cryptographic properties
- A new construction of odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
- The cycle structure of \(\mathrm{NFSR}(f^d)\) and its applications
- Cryptography and Coding
- scientific article; zbMATH DE number 1418295 (Why is no real title available?)
- Revisiting Correlation-Immunity in Filter Generators
- Fast computation of linear approximation over certain composition functions and applications to SNOW 2.0 and SNOW 3G
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Topics in Cryptology – CT-RSA 2004
- A survey on fast correlation attacks
- A new approach for finding low-weight polynomial multiples
- Improved multi-pass fast correlation attacks with applications
- A fast correlation attack on LILI-128
- Attacks against filter generators exploiting monomial mappings
- The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity
- Linearity properties of binary FCSR sequences
- Cryptanalysis of Achterbahn-128/80 with a New Keystream Limitation
- Results on multiples of primitive polynomials and their products over GF(2)
- Correlation (Fast) Attack against Nonlinear Combination Generator
- Hyper-bent functions and cyclic codes
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Iterative optimum symbol-by-symbol decoding and fast correlation attacks
- Efficient and extensive search for precise linear approximations with high correlations of full SNOW-V
- On the efficiency of the probabilistic neutral bits method in statistical cryptanalysis of synchronous stream ciphers
- Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions
- Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers
- Correlation attacks on combination generators
- An algorithmic framework for the generalized birthday problem
- Practical cryptanalysis of Bluetooth encryption with condition masking
- A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
- Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers
- An Improved Fast Correlation Attack on Stream Ciphers
- GL-S-NFSR: a new NFSR structure and its period properties
This page was built for publication: Improved fast correlation attacts using parity-check equations of weight 4 and 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374940)