Hailun Yan

Dr. Hailun Yan


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 April 2023
Verified
Book Chapter
Closed access
PDF file
LQLingyue Qin
Lingyue Qin
JHJialiang Hua
Jialiang Hua
XDXiaoyang Dong
Xiaoyang Dong
Hailun YanHailun Yan
Hailun Yan
XWXiaoyun Wang
Xiaoyun Wang

17 February 2023 in Designs, Codes and Cryptography
Verified
Journal Article
Open access
PDF file
WQWenxiao Qiao
Wenxiao Qiao
Hailun YanHailun Yan
Hailun Yan
SSSiwei Sun
Siwei Sun
LHLei Hu
Lei Hu
JJJiwu Jing
Jiwu Jing
LowMC is a family of block ciphers proposed by Albrecht et al. at EUROCRYPT 2015, which is tailored specifically for FHE and MPC applications. At ToSC 2018, a difference enumeration attack was given for the cryptanalysis of low-data instances of full LowMCv2 with few applied S-boxes per round. Recently at CRYPTO 2021, an efficient algebraic technique was proposed to attack 4-round LowMC adopting a full S-box layer. Following these works, we present a new difference enumeration attack framework, which is based on our new observations on the LowMC S-box, to analyze LowMC instances with a full S-box layer. As a result, with only 3 chosen plaintexts, we can attack 4-round LowMC instances which adopt a full S-box layer with block size of 129, 192, and 255 bits, respectively. We show that all these attacks have either a lower time complexity or a higher success probability than those reported in the CRYPTO paper.

27 November 2023 in Electronics
Verified
Journal Article
Open access
PDF file
TWTong Wu
Tong Wu
XMXiaochen Ma
Xiaochen Ma
Hailun YanHailun Yan
Hailun Yan
Cloud computing plays an essential role in various fields. However, the existing cloud services face a severe challenge, which is how to share the data among a large scale of devices securely. In this paper, we introduce a cloud-based privacy-preserving data sharing scheme, derived from identity-based matchmaking encryption. In our scheme, the access policies are designed by both the sender and receiver simultaneously, to support bilateral access control. To improve efficiency, we delegate the match algorithm to the cloud server, reducing the computation cost and communication overhead on end devices without revealing the users’ privacy. Through formal security analysis, we show that our scheme holds security, authenticity, and privacy. Finally, we evaluate our scheme by conducting extensive experiments, indicating that our scheme is more efficient than the other data-sharing schemes in ME-based services in a real-world dataset.

25 September 2025 in IACR Transactions on Symmetric Cryptology
Verified
Journal Article
Open access
PDF file
BWBaofeng Wu
Baofeng Wu
WKWen Kong
Wen Kong
DKDewei Kong
Dewei Kong
Hailun YanHailun Yan
Hailun Yan
We introduce the rotational-add diffusion layers aimed for applications in the design of arithmetization-oriented (AO) symmetric ciphers, such as fully homomorphic encryption (FHE)-friendly symmetric ciphers. This generalizes the rotational-XOR diffusion layers which have been utilized in the design of many important conventional symmetric ciphers like SHA-256, SM4, ZUC and Ascon. A rotational-add diffusion layer is defined over the finite field Fp for arbitrary prime p, enabling implementations using only rotations and modular additions/subtractions. The advantage of using such diffusion layers in AO ciphers is that, the costs of scalar multiplications can be reduced since the appearing scalars include only ±1, thus the total costs depend on sizes of the rotation offsets. In this paper, we investigate characterizations and constructions of lightest rotational-add diffusion layers over (Fmp)n that are maximum distance separable (MDS) with a focus on the case n = 4. It turns out that the minimum achievable size of the rotation offsets is 5 subject to the MDS property constraint. We specify a large class of rotational-add diffusion layers with 5 rotations and traverse all possible patterns of appearance of the scalars ±1. In four cases we can derive computationally tractable necessary and sufficient conditions for the rotational-add diffusion layers to attain the MDS property. These conditions enable explicit characterization of suitable primes p for given parameters. Leveraging these results, we construct three distinct families of rotational-add MDS diffusion layers applicable to AO ciphers. Although a rotational-add diffusion layer with 7 rotations and only additions has already been used in the design of the FHEfriendly block cipher YuX recently, to our knowledge, our work presents the first systematic theoretical characterization of rotational-add MDS diffusion layers and provides explicit constructions of them.

1 March 2026 in SCIENTIA SINICA Informationis
Verified
Journal Article
Open access
PDF file
ZLZhao Liang
Zhao Liang
YHYimin He
Yimin He
Hailun YanHailun Yan
Hailun Yan
LZLiang Zhao
Liang Zhao
JZJianbiao Zhang
Jianbiao Zhang
LZLi Zheng
Li Zheng
近年来, 中间相遇(MitM)攻击在 AES 类结构和海绵型结构的密码分析中均取得了显著进展. 作为 SHA-3 竞赛的决赛入围者, JH 杂凑函数采用了 基于置换的压缩函数结构,其设计思想与 Even–Mansour 结构相近, 并结合了广义的 AES 设计方法论. 本文针对 JH 的置换提出了一种 MitM 攻击建模框架, 并利用混合整数线性规划(MILP)方法自动搜索, 成功找到了一条覆盖 13 轮的 MitM 特征. 在此基础上, 我们对缩减至 13/42 轮的 JH-512 进行了 MitM 原像攻击, 时间复杂度为 2^320, 相比当前已知最佳的 10 轮 2^325 原像攻击进一步改进. 虽然完整版 JH 依然被认为是安全的, 但本文提出的方法为 JH 及同类原语的密码分析提供了新的思路与工具支持.