Designs, Codes and Cryptography
Издатель: Springer Nature · ISSN 0925-1022,1573-7586 · 429 статей
-
Excess coverage arrays and Levenshtein’s conjecture
Abstract A sequence covering array, denoted by ( N ; t , v ), is a set of N permutations of $$\{0, \dots , v-1 \}$$ { 0 , ⋯ , v - 1 } such that each sequence of t distinct elements of $$\{0, \dots , v-1\}$$ { 0 , ⋯ , v - 1 } is a (not...
- Towards computing canonical lifts of ordinary elliptic curves in medium characteristic
-
The regular multivariate quadratic problem
Abstract In this work, we introduce a novel variant of the multivariate quadratic problem, which is at the core of one of the most promising post-quantum alternatives: multivariate cryptography. In this variant, the solution of a given...
-
Linearization of polynomials in prime characteristic, with applications to the Golay code and Steiner system
Abstract Let F be any field containing the finite field of order q . A q -polynomial L over F is an element of the polynomial ring F [ x ] with the property that all powers of x that appear in L with nonzero coefficient have exponent a...
- On vanishing sums and cyclic Butson matrices
-
Exact values and improved bounds on the clique number of cyclotomic graphs
Abstract Let q be an odd power of a prime p , and $$S \subseteq \mathbb {F}_q^*$$ S ⊆ F q ∗ such that $$S=-S$$ S = - S and $$S/S \ne \mathbb {F}_q^*$$ S / S ≠ F q ∗ . We show that the clique number of the Cayley graph $$\operatorname...
- The enumeration and generalizations for relative one-weight codes
-
On maximal orthogonal partial Latin squares and minimal codes with specified length, minimum distance and covering radius
Abstract This paper presents a conjecture concerning the minimum possible size of a pair of maximal orthogonal partial Latin squares of a given order n . We show that in the balanced case the optimal structure is formed from a pair of...
- New MDS and self-dual generalized Roth-Lempel codes as well as their deep holes
- On the boomerang properties of $$x^{q+2}$$ over $$\mathbb {F}_{q^2}$$
- A conjecture on the minimum length of linear codes over finite fields
- On mutually $$\mu $$-intersecting quasi-Hermitian varieties with some applications
- Near-factorizations of dihedral groups
- On the support weight distributions of relative subcodes of some classes of codes
-
More on the sum-freedom of the multiplicative inverse function
Abstract In two papers entitled “Two generalizations of almost perfect nonlinearity” and “On the vector subspaces of $$\mathbb F_{2^n}$$ F 2 n over which the multiplicative inverse function sums to zero”, the first author has introduced...
- Generalizing the Bierbrauer–Friedman bound for orthogonal arrays
- Determining the weight spectrum of the Reed–Muller codes $$RM(m-6,m)$$
- Exploiting output bits and the $$\chi $$ operation in MitM preimage attacks on Keccak
- Galois LCD subspace codes
- New constructions of MDS symbol-pair codes via simple-root cyclic codes
- Multilevel inserting constructions for constant dimension subspace codes
-
The stability of the algebraic degree of Boolean functions when restricted to affine spaces
Abstract We study the n -variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension k . For cryptographic...
- On the security of two IKKR-type code-based cryptosystems
-
Ovoids in the cyclic presentation of $$\textrm{PG}(3, q )$$
Abstract We consider the cyclic presentation of $$\textrm{PG}(3, q )$$ PG ( 3 , q ) whose points are in the finite field $$\mathbb {F}_{q^4}$$ F q 4 and describe the known ovoids therein. We revisit the set $$\mathcal {O}$$ O ,...
- An optimal binary linear functional-repair storage code with efficient repair related to $$\textrm{PG}(2,8)$$
- Asymptotically optimal constant weight codes with even distance
- New centralized multi-node repair schemes for distributed storage
-
Higher-dimensional grid-imprimitive block-transitive designs
Abstract It was shown in 1989 by Delandtsheer and Doyen that, for a 2-design with v points and block size k , a block-transitive group of automorphisms can be point-imprimitive (that is, leave invariant a nontrivial partition of the...
-
Classifying generalized Howell designs
Abstract A t - $$\text {GHD}_k(s,v;\lambda )$$ GHD k ( s , v ; λ ) generalized Howell design is an $$s \times s$$ s × s array, each cell of which is either empty or contains a k -subset of elements of some set X of size v such that (i)...
- Forking sums of permutations for highly secure and efficient PRFs