Xiangyong Zeng

Hongsheng Hu, Nian Li, Yanan Wu et al.

Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the study of constacyclic codes in this context remains limited compared to classical cyclic codes. This paper provides two infinite families of $λ$-constacyclic codes over $\mathbb{F}_{q^2}$ that support infinite families of 3-designs, which generalize the results in [IEEE Trans. Inf. Theory 69(4): 2341-2354, 2023]. The parameters and weight distributions are determined completely. Besides, we study their subfield subcodes and applications on constructing entanglement-assisted quantum error-correcting codes (EAQECCs) and locally recoverable codes (LRCs). It is worthy to mention that two classes of maximal entanglement EAQECCs with a negative or a high positive net rate are derived. Moreover, two classes of distance-optimal and dimension-optimal LRCs are also obtained.

Peipei Xie, Siwei Chen, Zejun Xiang et al.

At SAC 2013, Berger et al. first proposed the Extended Generalized Feistel Networks (EGFN) structure for the design of block ciphers with efficient diffusion. Later, based on the Type-2 EGFN, they instantiated a new lightweight block cipher named Lilliput (published in IEEE Transactions on Computers, Vol. 65, Issue 7, 2016). According to published cryptanalysis results, Lilliput is sufficiently secure against theoretical attacks such as differential, linear, boomerang, and integral attacks, which rely on the statistical properties of plaintext and ciphertext. However, there is a lack of analysis regarding its resistance to physical attacks in real-world scenarios, such as fault attacks. In this paper, we present the first systematic differential fault analysis (DFA) of Lilliput under three nibble-oriented fault models with progressively relaxed adversarial assumptions to comprehensively assess its fault resilience. In Model I (multi-round fixed-location), precise fault injections at specific rounds recover the master key with a 98% success rate using only 8 faults. Model II (single-round fixed-location) relaxes the multi-round requirement, demonstrating that 8 faults confined to a single round are still sufficient to achieve a 99% success rate by exploiting Lilliput's diffusion properties and DDT-based constraints. Model III (single-round random-location) further weakens the assumption by allowing faults to occur randomly among the eight rightmost branches of round 27. By uniquely identifying the fault location from ciphertext differences with high probability, the attack remains highly feasible, achieving over 99% success with 33 faults and exceeding 99.5% with 36 faults. Our findings reveal a significant vulnerability of Lilliput to practical fault attacks across different adversary capabilities in real-world scenarios, providing crucial insights for its secure implementation.