In meet-in-the-middle (MITM) attacks, the sizes of the precomputation tables determine the effectiveness. In this paper, value constraints are presented to reduce the size of the precomputation table in MITM attacks on AES. Based on a differential …

Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65(8):4785–4803, 2019) proposed lifted linearized Reed–Solomon codes as suitable codes for error control in multishot network coding. We show how to construct and decode lifted interleaved …

Tang–Gong interleaved sequences constructed from the generalized GMW sequence pair are a class of binary sequences with optimal autocorrelation magnitude. In this paper, the symmetric 2-adic complexity of these sequences is investigated. We first …

In the present paper, we study relative difference sets (RDSs) and linked systems of them. It is shown that a closed linked system of RDSs is always graded by a group. Based on this result, we also define a product of RDS linked systems sharing …

A linear code C over $${\mathbb {F}}_q$$ F q is called $$\Delta $$ Δ -divisible if the Hamming weights $${\text {wt}}(c)$$ wt ( c ) of all codewords $$c \in C$$ c ∈ C are divisible by $$\Delta $$ Δ . The possible effective lengths of $$q^r$$ q r …

Signed difference sets have interesting applications in communications and coding theory. A $$(v,k,\lambda )$$ ( v , k , λ ) -difference set in a finite group G of order v is a subset D of G with k distinct elements such that the expressions …

The Boolean map $$\chi _n :\mathbb {F}_2^n \rightarrow \mathbb {F}_2^n,\ x \mapsto y$$ χ n : F 2 n → F 2 n , x ↦ y defined by $$y_i = x_i + (x_{i+1}+1)x_{i+2}$$ y i = x i + ( x i + 1 + 1 ) x i + 2 (where $$i\in \mathbb {Z}/n\mathbb {Z}$$ i ∈ Z / n …

In this paper, we give the Jacobi polynomials for first-order generalized Reed–Muller codes. We show as a corollary the nonexistence of combinatorial 3-designs in these codes.

Due to the high demands of data communication, the broadcasting system streams the data daily. This service not only sends out the message to the correct participant but also respects the security of the identity user. In addition, when delivered …

Ovoids of the parabolic quadric Q(6, q) of $$\textrm{PG}(6,q)$$ PG ( 6 , q ) have been largely studied in the last 40 years. They can only occur if q is an odd prime power and there are two known families of ovoids of Q(6, q), the Thas-Kantor …

The fixed-length Levenshtein (FLL) distance between two words $$\varvec{x}, \varvec{y}\in \mathbb {Z}_m^n$$ x , y ∈ Z m n is the smallest integer t such that $$\varvec{x}$$ x can be transformed to $$\varvec{y}$$ y by t insertions and t deletions.

A Steiner quadruple system of order $$v+1$$ v + 1 with resolvable derived designs (every derived Steiner triple system of order v at a point is resolvable), abbreviated as RDSQS $$(v+1)$$ ( v + 1 ) , has been used to construct a large set of …

High temperatures have dramatic negative effects on interconnect performance. In a bus, whenever the state transitions from “0” to “1”, or “0” to “1”, joule heating causes the temperature to rise. A low-power error-correcting cooling (LPECC) code …

The binary signed-digit (BSD) representation of integers is used for efficient integer computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence. In this paper, we show previously …

In this paper, we use multivariate polynomial rings to construct quantum error-correcting codes (QECCs) via Hermitian construction. We establish a relation between linear codes and ideals of multivariate polynomial rings. We give a necessary and …

Ascon, a family of algorithms that supports authenticated encryption and hashing, has been selected as the new standard for lightweight cryptography in the NIST Lightweight Cryptography Project. Ascon’s permutation and authenticated encryption …

Consider the Klein quadric $$Q^+(5,q)$$ Q + ( 5 , q ) in $$\text{ PG }(5,q)$$ PG ( 5 , q ) . A set of points of $$Q^+(5,q)$$ Q + ( 5 , q ) is called a quadratic set if it intersects each plane $$\pi $$ π of $$Q^+(5,q)$$ Q + ( 5 , q ) in a possibly …

We provide classification results for translation generalized quadrangles of order less than or equal to 64, and hence, for all incidence geometries related to them. The results consist of the classification of all pseudo-ovals in …

In this work we introduce PERK a compact digital signature scheme based on the hardness of a new variant of the permuted kernel problem (PKP). PERK achieves the smallest signature sizes for any PKP-based scheme for NIST category I security with 6 …

Ethereum, one of the most prominent and widely deployed blockchain systems, is undergoing a significant upgrade that adopts sharding for capacity expansion and secure multi-party computation (MPC) to enable distributed validator technology (DVT).