Towards the links of cryptanalytic methods on MPC/FHE/ZK-friendly symmetric-key primitives

• Main Authors: Chen, Shiyao, Guo, Chun, Guo, Jian, Liu, Li, Wang, Meiqin, Wei, Puwen, Xu, Zeyu
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2023
• Subjects: Science::Mathematics; Symmetric-Key; Cryptanalysis
• Online Access: https://hdl.handle.net/10356/171682
• Institution: Nanyang Technological University

Symmetric-key primitives designed over the prime field Fp with odd characteristics, rather than the traditional Fn2, are becoming the most popular choice for MPC/FHE/ZK-protocols for better efficiencies. However, the security of Fp is less understood as there are highly nontrivial gaps when extending the cryptanalysis tools and experiences built on Fn2 in the past few decades to Fp. At CRYPTO 2015, Sun et al. established the links among impossible differential, zero-correlation linear, and integral cryptanalysis over Fn2 from the perspective of distinguishers. In this paper, following the definition of linear correlations over Fp by Baignères, Stern and Vaudenay at SAC 2007, we successfully establish comprehensive links over Fp, by reproducing the proofs and offering alternatives when necessary. Interesting and important differences between Fp and Fn2 are observed.-Zero-correlation linear hulls can not lead to integral distinguishers for some cases over Fp, while this is always possible over Fn2 proven by Sun et al..-When the newly established links are applied to GMiMC, its impossible differen-tial, zero-correlation linear hull and integral distinguishers can be increased by up to 3 rounds for most of the cases, and even to an arbitrary number of rounds for some special and limited cases, which only appeared in Fp. It should be noted that all these distinguishers do not invalidate GMiMC’s security claims. The development of the theories over Fp behind these links, and properties identified (be it similar or different) will bring clearer and easier understanding of security of primitives in this emerging Fp field, which we believe will provide useful guides for future cryptanalysis and design.