Pages that link to "Item:Q5554046"
From MaRDI portal
The following pages link to Shift-register synthesis and BCH decoding (Q5554046):
Displaying 50 items.
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) (Q2476752) (← links)
- Concatenating indicators of flats for designing cryptographic functions (Q2487216) (← links)
- A fuzzy vault scheme (Q2491270) (← links)
- Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\) (Q2500604) (← links)
- The Berlekamp-Massey algorithm revisited (Q2502174) (← links)
- Continued fraction for formal Laurent series and the lattice structure of sequences (Q2502177) (← links)
- A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers (Q2510577) (← links)
- Counting functions and expected values for the lattice profile at \(n\) (Q2566959) (← links)
- On a family of pseudorandom binary sequences (Q2567413) (← links)
- An efficient binary sequence generator with cryptographic applications (Q2570684) (← links)
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences (Q2628309) (← links)
- On the evaluation codes given by simple \(\delta \)-sequences (Q2634585) (← links)
- Cryptographic pseudo-random sequences from the chaotic Hénon map (Q2655564) (← links)
- Some new classes of quaternary sequences with low autocorrelation property via two binary cyclotomic sequences (Q2700118) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- On algebraic properties of S-boxes designed by means of disjoint linear codes (Q2804866) (← links)
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation (Q2804904) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- An \(L\)-banded approximation to the inverse of symmetric Toeplitz matrices (Q2915350) (← links)
- Open Questions on Nonlinearity and on APN Functions (Q2949473) (← links)
- Fast Correlation Attacks: Methods and Countermeasures (Q3013077) (← links)
- Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators (Q3081290) (← links)
- PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS (Q3173473) (← links)
- A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight (Q3197752) (← links)
- Binary Pseudo-Random Sequences Theory (Q3351309) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
- On Fast and Provably Secure Message Authentication Based on Universal Hashing (Q3452360) (← links)
- Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0 (Q3457132) (← links)
- Decoder malfunction in BCH decoders (Q3489945) (← links)
- Mixer–a new stream cipher (Q3520619) (← links)
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators (Q3600338) (← links)
- Generalized Joint Linear Complexity of Linear Recurring Multisequences (Q3600447) (← links)
- A Lattice-Based Minimal Partial Realization Algorithm (Q3600448) (← links)
- Parallel Generation of ℓ-Sequences (Q3600451) (← links)
- Compact Normal Form for Regular Languages as Xor Automata (Q3637338) (← links)
- A realization approach to stochastic model reduction (Q3693402) (← links)
- Inverse scattering and minimal partial realizations (Q3833948) (← links)
- Stream Ciphering Techniques Based on n-Tuples Juxtaposition Sequences (Q3833993) (← links)
- (Q3834123) (← links)
- Minimal realization of linear systems (Q4124682) (← links)
- Refined convergents to the associated continued fractions for binary sequences (Q4308502) (← links)
- A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377) (← links)
- Growth Functions and Automatic Groups (Q4347270) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- The black-box Niederreiter algorithm and its implementation over the binary field (Q4417166) (← links)
- The irreducibility of some level 1 Hecke polynomials (Q4529717) (← links)
- On the linear complexity of product sequences of linear recurring sequences (Q4549925) (← links)
- Computing the reciprocal of units in Galois rings (Q4549929) (← links)
- A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
- Linear Span analysis of a set of periodic sequence generators (Q4608494) (← links)
