Parametric Guess and Determine Attack on Stream Ciphers

Orhun Kara, Ebru Küçükkubas
{"title":"Parametric Guess and Determine Attack on Stream Ciphers","authors":"Orhun Kara, Ebru Küçükkubas","doi":"10.1109/PIMRCW.2019.8880834","DOIUrl":null,"url":null,"abstract":"Due to the rapid evolution and usage of IoT devices in the world, the need for lightweight cryptography for resource-constrained devices gained a great importance. Although it has been common in the cryptology community that stream ciphers are supposed to be more efficient in speed and area than block ciphers, it has been seen in the last 10–15 years that most of ciphers designed for resource-constrained devices to take up less area and less energy on hardware-based platforms, such as ASIC or FPGA, are lightweight block ciphers. On the other hand, the design and analysis of stream ciphers using keyed internal update function is put forward against this belief and it has become one of the popular study subjects in the literature in the last few years. Plantlet, proposed in 2017, and its predecessor Sprout, proposed in 2015, are famous algorithms as examples of stream ciphers using keyed internal update function. Sprout was broken after a short time by many researchers but Plantlet hasn't been succesfully broken yet. Traditionally, key stream generators of stream ciphers update their internal states only by using their current internal state. Since the use of the key in the internal update is a new approach, the security analysis of this approach is not fully understood. In this study, the security analysis of the key stream generators with keyed update function has been studied. A new attack algorithm for internal state recovery and key recovery has been developed and mounted on Plantlet algorithm as an instance of stream ciphers with keyed update function.","PeriodicalId":158659,"journal":{"name":"2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRCW.2019.8880834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Due to the rapid evolution and usage of IoT devices in the world, the need for lightweight cryptography for resource-constrained devices gained a great importance. Although it has been common in the cryptology community that stream ciphers are supposed to be more efficient in speed and area than block ciphers, it has been seen in the last 10–15 years that most of ciphers designed for resource-constrained devices to take up less area and less energy on hardware-based platforms, such as ASIC or FPGA, are lightweight block ciphers. On the other hand, the design and analysis of stream ciphers using keyed internal update function is put forward against this belief and it has become one of the popular study subjects in the literature in the last few years. Plantlet, proposed in 2017, and its predecessor Sprout, proposed in 2015, are famous algorithms as examples of stream ciphers using keyed internal update function. Sprout was broken after a short time by many researchers but Plantlet hasn't been succesfully broken yet. Traditionally, key stream generators of stream ciphers update their internal states only by using their current internal state. Since the use of the key in the internal update is a new approach, the security analysis of this approach is not fully understood. In this study, the security analysis of the key stream generators with keyed update function has been studied. A new attack algorithm for internal state recovery and key recovery has been developed and mounted on Plantlet algorithm as an instance of stream ciphers with keyed update function.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
流密码的参数猜测与确定攻击
由于世界上物联网设备的快速发展和使用,对资源受限设备的轻量级加密的需求变得非常重要。虽然在密码学社区中,流密码被认为在速度和面积上比分组密码更有效是很常见的,但在过去的10-15年里,大多数为资源受限设备设计的密码在基于硬件的平台(如ASIC或FPGA)上占用的面积和能量更少,是轻量级的分组密码。另一方面,基于键控内部更新功能的流密码设计和分析正是基于这一信念而提出的,并成为近年来文献中热门的研究课题之一。Plantlet于2017年提出,其前身Sprout于2015年提出,是使用键控内部更新功能的流密码的著名算法。Sprout在很短的时间内就被许多研究者打破了,但Plantlet还没有被成功打破。传统上,流密码的密钥流生成器仅通过使用其当前的内部状态来更新其内部状态。由于在内部更新中使用密钥是一种新的方法,因此对这种方法的安全性分析还没有完全了解。本文对具有键控更新功能的密钥流生成器进行了安全性分析。提出了一种新的内部状态恢复和密钥恢复攻击算法,并以具有密钥更新功能的流密码为例,将其安装在Plantlet算法上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Generalized Spatial Modulation in Highly Correlated Channels Cramer-Rao Lower Bounds for Magnetic Localization of a Wireless Capsule Endoscope based on the Magnetic Dipole Model Long Term Max-min Fairness Guarantee Mechanism: Adaptive Task Splitting and Resource Allocation in MEC-enabled Networks Energy Metamorphic Testing for Android Applications Full Duplex for Next Generation of 802.11
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1