The following pages link to Cryptography and Communications (Q267784):
Displayed 50 items.
- Further results on the nonlinearity of maximum-length NFSR feedbacks (Q267785) (← links)
- On the lifted Melas code (Q267789) (← links)
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) (Q267793) (← links)
- A Chinese remainder theorem approach to skew generalized quasi-cyclic codes over finite fields (Q267796) (← links)
- Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension (Q267798) (← links)
- Construction of self-dual codes over \(\mathbb {Z}_{2^{m}}\) (Q267801) (← links)
- New developments in \(q\)-polynomial codes (Q267804) (← links)
- Conditional differential cryptanalysis of 105 round Grain v1 (Q267806) (← links)
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method (Q267808) (← links)
- New open problems related to old conjectures by Helleseth (Q269559) (← links)
- Spectra of a class of quadratic functions: average behaviour and counting functions (Q269563) (← links)
- Quasi-perfect linear codes from planar and APN functions (Q269565) (← links)
- Further constructions of infinite families of bent functions from new permutations and their duals (Q269566) (← links)
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties (Q269570) (← links)
- Influence of addition modulo \(2^n\) on algebraic attacks (Q269574) (← links)
- Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions (Q269576) (← links)
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- On the distinctness of primitive sequences over \({\mathbb Z}/(p^{e}q)\) modulo 2 (Q276558) (← links)
- Statistical properties of half-\(\ell\)-sequences (Q276560) (← links)
- Application of Grover's algorithm to check non-resiliency of a Boolean function (Q276563) (← links)
- On covering sets for limited-magnitude errors (Q276564) (← links)
- Walsh transforms and cryptographic applications in bias computing (Q276565) (← links)
- On modes of operations of a block cipher for authentication and authenticated encryption (Q301626) (← links)
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- Linear codes from a generic construction (Q301633) (← links)
- Optimal \(p\)-ary cyclic codes with minimum distance four from monomials (Q301634) (← links)
- Matrix representations of vectorial Boolean functions and eigenanalysis (Q301638) (← links)
- Twin-Beth: security under active and concurrent attacks for the Beth identity-based identification scheme (Q301642) (← links)
- Large low probability of intercept properties of the quaternary sequence with optimal correlation property constructed by Legendre sequences (Q301645) (← links)
- Generalized cyclotomic numbers of order two and their applications (Q301646) (← links)
- On constacyclic codes over finite fields (Q301647) (← links)
- Nonlinearity measures of random Boolean functions (Q301648) (← links)
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (Q380446) (← links)
- Second weight codewords of generalized Reed-Muller codes (Q380448) (← links)
- Resilience to distinguishing attacks on WG-7 cipher and their generalizations (Q380450) (← links)
- Revisiting iterated attacks in the context of decorrelation theory (Q458736) (← links)
- Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64 (Q458737) (← links)
- Computing Walsh coefficients from the algebraic normal form of a Boolean function (Q458740) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Preface: Special functions and codes (Q502396) (← links)
- Bent functions linear on elements of some classical spreads and presemifields spreads (Q502398) (← links)
- Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets (Q502401) (← links)
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) (Q502403) (← links)
- A construction of codes with linearity from two linear codes (Q502404) (← links)
- Linear codes with few weights from weakly regular bent functions based on a generic construction (Q502405) (← links)
- Some cyclic codes with prime length from cyclotomy of order 4 (Q502406) (← links)
- A class of linear codes with a few weights (Q502407) (← links)