密码学报（中英文）2025，Vol.12Issue(1)：39-48,10.DOI:10.13868/j.cnki.jcr.000738
Pholkos算法的不可能差分分析
Impossible Differential Cryptanalysis of Pholkos
摘要
Abstract
Pholkos is a family of tweakable block ciphers proposed by Bossert et al.at CT-RSA 2022.This study generalizes an 8-round impossible differential proposed by the designer into a class of 8-round impossible differentials,and constructs a model of impossible differential attack on 11-round Pholkos.The formula of complexity of the impossible differential attack against 11-round of Pholkos-256-256 is presented depending on the active bytes of the 8-round distinguisher.Combined with the key expansion algorithm,the security analysis result is obtained of the longest round number against Pholkos-256-256 currently,with 2208.0 chosen-plaintexts,2185.5 11-round encryptions,and 2150.0 bytes memory.关键词
分组密码/密码分析/不可能差分分析/Pholkos算法Key words
block cipher/cyptanalysis/impossible differential cryptanalysis/Pholkos分类
计算机与自动化引用本文复制引用
周锴,王薇..Pholkos算法的不可能差分分析[J].密码学报（中英文）,2025,12(1):39-48,10.基金项目
国家重点研发计划(2018YFA0704702,2022YFB2701700) （2018YFA0704702,2022YFB2701700）
山东省自然科学基金(ZR2020MF053)National Key Research and Development Program of China(2018YFA0704702,2022YFB2701700) （ZR2020MF053）
Natural Science Foundation of Shandong Province(ZR2020MF053) （ZR2020MF053）
