A Unified Key Recovery Framework for Impossible Boomerang Attacks: Applications to Full-Round-ARADI and SKINNYe v2

计算机科学 钥匙(锁) 计算机安全 可观测性 密码学 组分(热力学) 冗余(工程) 稳健性(进化) 雷达跟踪器 期限(时间)
作者
Lin Jiao,Xichao Hu,Dengguo Feng,Yongqiang Li,Senpeng Wang,Yonglin Hao,Xinxin Gong
出处
期刊:IEEE Transactions on Information Theory [Institute of Electrical and Electronics Engineers]
卷期号:: 1-1
标识
DOI:10.1109/tit.2026.3693296
摘要

The impossible boomerang attack is a powerful cryptanalytic technique, but existing key recovery methods face several limitations that restrict its applicability. Specifically, the key pre-guessing is coarse-grained, S-box details are ignored in the differential propagation, the complexity estimation and the key guessing order determination remain rudimentary. To overcome these issues, we introduce three key improvement measures. First, we propose a flexible partial key and difference pre-guessing technique based on directed graphs, enabling selective identification of required keys and differences for generating partial pairs and quartets. Second, we propose a pre-sieving technique to early eliminate invalid quartets by exploiting cipher-specific details. Third, we introduce an automatic key-guessing strategy based on the same directed graphs to efficiently determine valid guessing orders. We integrate these techniques to develop a unified key recovery framework for impossible boomerang attacks, accompanied by a formal and precise characterization of the overall complexity. This is the first framework to support flexible key and difference pre-guessing while incorporating block cipher details during key recovery for impossible boomerang attacks. Crucially, it enables the automatic generation of detailed recovery steps, a capability missing in prior work. As applications, under the four related-key/tweakey setting, we apply the framework to ARADI, a low-latency cipher proposed by the National Security Agency (NSA), and SKINNYe v2, a threshold-implementation-friendly cipher proposed at EUROCRYPT 2020. For ARADI, we achieve the first full-round attack with 2130 data, 2253.78 time, and 2235.75 memory complexity. For SKINNYe v2, we present the first 34-round impossible boomerang attack with 266 data, 2253.75 time, and 2239.75 memory complexity. These results demonstrate the framework’s significance and its substantial improvement in advancing the impossible boomerang attack.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
蜡笔小z完成签到 ,获得积分10
刚刚
liu发布了新的文献求助50
刚刚
真真假假发布了新的文献求助10
1秒前
Jing完成签到,获得积分10
1秒前
小马甲应助积极的荔枝采纳,获得10
2秒前
郭莹莹发布了新的文献求助10
2秒前
青青完成签到,获得积分10
2秒前
香蕉觅云应助ly采纳,获得10
2秒前
神了发布了新的文献求助20
3秒前
3秒前
3秒前
sandse7en完成签到 ,获得积分10
3秒前
wsq完成签到 ,获得积分10
3秒前
零下十五度完成签到 ,获得积分10
3秒前
家雁菱发布了新的文献求助10
4秒前
顺利的小伙完成签到 ,获得积分20
4秒前
Winter完成签到,获得积分10
4秒前
小陈同学完成签到 ,获得积分10
4秒前
Accept2024完成签到,获得积分10
4秒前
科研通AI6.1应助muyi采纳,获得10
5秒前
可爱的函函应助像与采纳,获得10
5秒前
吃葡萄皮完成签到,获得积分10
5秒前
lv完成签到,获得积分10
7秒前
7秒前
我还能学发布了新的文献求助10
8秒前
勤奋花瓣完成签到 ,获得积分10
9秒前
英姑应助郑大大yx采纳,获得10
9秒前
孤海未蓝完成签到,获得积分10
10秒前
vinni完成签到,获得积分10
11秒前
11秒前
撒西不理完成签到,获得积分10
12秒前
Jenny完成签到,获得积分10
12秒前
bigboss完成签到 ,获得积分10
12秒前
Moonpie应助永远的得胜同志采纳,获得10
12秒前
快乐疯样完成签到,获得积分10
12秒前
luoyan完成签到,获得积分10
12秒前
充电宝应助林布林采纳,获得10
12秒前
沄殇发布了新的文献求助10
12秒前
雨田完成签到,获得积分10
13秒前
laber应助滕祥采纳,获得50
13秒前
高分求助中
Clinical Epidemiology: The Essentials, 6e 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
The Graphene Handbook (2019 Edition) 800
Adhesion Science: Principles & Practice 800
Signals, Systems, and Signal Processing 610
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 600
久松真一著作集〈第5巻〉禅と芸術 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6556146
求助须知:如何正确求助?哪些是违规求助? 8340203
关于积分的说明 17868273
捐赠科研通 5674329
什么是DOI,文献DOI怎么找? 2940461
邀请新用户注册赠送积分活动 1916369
关于科研通互助平台的介绍 1786923