A New Guess-and-Determine Method for Cryptanalysis of the GSM Encryption

IF 1.7 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Complexity Pub Date : 2023-02-18 DOI:10.1155/2023/7249127
Ashish Jain, Inderjeet Kaur, Akhilesh Kumar Sharma, Nirmal Kumar Gupta, Partha Chakraborty
{"title":"A New Guess-and-Determine Method for Cryptanalysis of the GSM Encryption","authors":"Ashish Jain,&nbsp;Inderjeet Kaur,&nbsp;Akhilesh Kumar Sharma,&nbsp;Nirmal Kumar Gupta,&nbsp;Partha Chakraborty","doi":"10.1155/2023/7249127","DOIUrl":null,"url":null,"abstract":"<div>\n <p>Cryptanalysis is the process of finding flaws or oversights in an encryption algorithm. Nearly, all encryption algorithms are carefully examined through cryptanalysis to determine the security of the system in which the encryption algorithm has been employed. A5/1 is a well-known encryption algorithm which is inbuilt in mobile phone for securing GSM communication, and therefore, cryptanalysis of this algorithm is also important. A5/1 consists of three linear feedback registers of lengths 23, 22, and 19 bits. Due to the nonlinear clocking mechanism of A5/1, cryptanalytic attacks of guess-and-determine (GD) nature are efficient and more successful. In this paper, we propose a new low keystream GD attack on GSM encryption algorithm A5/1. The basic idea of GD attack is guessing some portion of the registers of A5/1 and determining remaining portion of the registers via the relationship between the register’s state and the known intercepted keystream. The guessed and determined register’s state is validated by running the cipher forward from that state. If the intercepted keystream matches the generated keystream, we accept it. Otherwise, we discard and try the attack again. The computational complexity and the success rate of the proposed attack are O (2<sup>52</sup>) and 96.6%, respectively.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2023 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2023-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/7249127","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2023/7249127","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Cryptanalysis is the process of finding flaws or oversights in an encryption algorithm. Nearly, all encryption algorithms are carefully examined through cryptanalysis to determine the security of the system in which the encryption algorithm has been employed. A5/1 is a well-known encryption algorithm which is inbuilt in mobile phone for securing GSM communication, and therefore, cryptanalysis of this algorithm is also important. A5/1 consists of three linear feedback registers of lengths 23, 22, and 19 bits. Due to the nonlinear clocking mechanism of A5/1, cryptanalytic attacks of guess-and-determine (GD) nature are efficient and more successful. In this paper, we propose a new low keystream GD attack on GSM encryption algorithm A5/1. The basic idea of GD attack is guessing some portion of the registers of A5/1 and determining remaining portion of the registers via the relationship between the register’s state and the known intercepted keystream. The guessed and determined register’s state is validated by running the cipher forward from that state. If the intercepted keystream matches the generated keystream, we accept it. Otherwise, we discard and try the attack again. The computational complexity and the success rate of the proposed attack are O (252) and 96.6%, respectively.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GSM加密分析中一种新的猜测-确定方法
密码分析是在加密算法中发现缺陷或疏忽的过程。几乎所有的加密算法都是通过密码分析来仔细检查的,以确定采用加密算法的系统的安全性。A5/1是一种众所周知的用于保护GSM通信安全的内置加密算法,因此对该算法的密码分析也很重要。A5/1由三个长度为23、22和19位的线性反馈寄存器组成。由于A5/1的非线性时钟机制,猜测和确定(GD)性质的密码分析攻击是高效和成功的。本文提出了一种新的针对GSM加密算法A5/1的低密钥流GD攻击方法。GD攻击的基本思想是猜测A5/1寄存器的一部分,并通过寄存器状态与已知截获密钥流之间的关系确定寄存器的剩余部分。通过从该状态向前运行密码来验证猜测和确定的寄存器状态。如果拦截的密钥流与生成的密钥流匹配,我们就接受它。否则,我们放弃并再次尝试攻击。该算法的计算复杂度为0(252),攻击成功率为96.6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
期刊最新文献
Neural Scale-Free Network: A Novel Neural Network to Predict the Emergence of Hub Nodes in Complex Networks Dynamic Analysis of a Periodic Impulsive Switching Model for a Stage-Structured Single Population With Hibernation Habits Analytical Solutions of Heat-Like Equation Using Elzaki Transform Variational Iteration Method: Black–Scholes Equation Fractional Age-Structured Modeling of Measles: Application of Inverse Methods Advancing 4-Part Evolutionary Harmony Through Analysis of Human–Machine Approaches to Teaching–Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1