The following pages link to (Q3813755):
Displaying 50 items.
- On the size of Kakeya sets in finite vector spaces (Q396866) (← links)
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)? (Q623241) (← links)
- On the security of the Lucas function (Q673987) (← links)
- Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences (Q689947) (← links)
- On the peak-to-average power ratio of \(M\)-sequences (Q814768) (← links)
- On linear complexity of sequences over \(\text{GF}(2^n)\) (Q818141) (← links)
- Two-tuple balance of non-binary sequences with ideal two-level autocorrelation (Q858308) (← links)
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd (Q868885) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- On Niho type cross-correlation functions of \(m\)-sequences (Q946884) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- Polynomial description of binary linear codes and related properties (Q1181004) (← links)
- Optimal algorithms for total exchange without buffering on the hypercube (Q1195935) (← links)
- Cross-correlations of geometric sequences in characteristic two (Q1309829) (← links)
- A simple method to estimate the maximum nontrivial correlation of some sets of sequences (Q1320445) (← links)
- The vulnerability of geometric sequences based on fields of odd characteristic (Q1324757) (← links)
- Using transforming matrices to generate DNA clone grids (Q1406037) (← links)
- Randomized algorithms over finite fields for the exact parity base problem. (Q1578505) (← links)
- On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions (Q1718633) (← links)
- Mutually unbiased bases, generalized spin matrices and separability (Q1886537) (← links)
- AOP arithmetic architectures over GF(2\(^m\)) (Q1888264) (← links)
- Linear recurring sequences over modules (Q1906803) (← links)
- Linear recurring sequences over rings and modules (Q1915326) (← links)
- \(\sigma\)-Automata and Chebyshev-polynomials (Q1978501) (← links)
- State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
- Approximate unitary 3-designs from transvection Markov chains (Q2168080) (← links)
- A search for good pseudo-random number generators: survey and empirical studies (Q2172858) (← links)
- On equivalence between known families of quadratic APN functions (Q2197990) (← links)
- New characterizations for the multi-output correlation-immune Boolean functions (Q2198404) (← links)
- The Fourier spectral characterization for the correlation-immune functions over \(\mathbb{F}_p \) (Q2202901) (← links)
- On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions (Q2202906) (← links)
- On the inverses of Kasami and Bracken-Leander exponents (Q2211339) (← links)
- New quadratic bent functions in polynomial forms with coefficients in extension fields (Q2321948) (← links)
- Classification of finite fields with applications (Q2323448) (← links)
- On the algebraic construction of cryptographically good \(32 \times 32\) binary linear transformations (Q2349621) (← links)
- On inversion in \(\mathbb Z_{{2^n}-1}\) (Q2434405) (← links)
- On the subfield subcodes of Hermitian codes (Q2436577) (← links)
- A new class of monomial bent functions (Q2469484) (← links)
- Periodic binary harmonic functions on lattices (Q2474258) (← links)
- A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900) (← links)
- The generalized Goertzel algorithm and its parallel hardware implementation (Q2481284) (← links)
- Affine equivalence in the AES round function (Q2486749) (← links)
- On the algebraic degree of iterated power functions (Q2692966) (← links)
- (Q3305164) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- Parallel Generation of ℓ-Sequences (Q3600451) (← links)
- Remarks on the Schoof-Elkies-Atkin algorithm (Q4396461) (← links)
- On the linear complexity of product sequences of linear recurring sequences (Q4549925) (← links)
- (Q4618410) (← links)
- Attacks Against Filter Generators Exploiting Monomial Mappings (Q4639472) (← links)
