Implementation of Enhanced A5/1 Stream Cipher and its Randomness Analysis by NIST Test Suite

R. Prajapat, Rajesh Bhadada, Giriraj Sharma
{"title":"Implementation of Enhanced A5/1 Stream Cipher and its Randomness Analysis by NIST Test Suite","authors":"R. Prajapat, Rajesh Bhadada, Giriraj Sharma","doi":"10.1109/iSES52644.2021.00102","DOIUrl":null,"url":null,"abstract":"Global System for Mobile (GSM) is still widely used cellular standard providing many services like Voice, SMS & Data Service with mobility. To secure information in the GSM cellular network, security is implemented at two levels i.e. initially to authorize the valid users for every location update and then during call, encryption is applied over the information being transmitted on GSM channel to protect from being intercepted and decoded by unauthorized persons. This protection is achieved by converting the original message into an encoded form (cipher form) that appears to be a random stream of symbols. Under “Challenge-Response” mechanism, A3 and A8 algorithms are used to generate triplet (RAND, SRES & Kc) for authentication of any user at GSM network. But the actual information is encrypted using A5 algorithm to generate cipher stream for better protection from interception. This A5 stream cipher has three versions: A5/1, A5/2 and A5/3. A5/1 works on Liner Feedback Shift Registers (LFSRs) with irregular clocking and generates pseudo random binary stream. These three versions of A5 algorithm are being used for encryption of information over GSM since the launching of GSM services and have been cryptographically analyzed by Reverse-Engineering. With passage of time, many hackers & crackers are becoming able to break this encryption identifying some weaknesses of these algorithms and can decrypt the original information. These stream ciphers are facing some weaknesses like poor Liner Complexity (LC) & clocking mechanism (Majority Rule), short clocking period, weak choice of clocking taps and collision problem. Because of such weaknesses, these stream ciphers can be decrypted by intruders. In this papers an attempt has been made to reduce these weaknesses and enhance the security by introducing non-linear combinational generator (NLFSRs), reuse of 32 bits SRES generated by A3 algorithm and finally combining the output stream with last 32 bits of CGI. The randomness analysis of proposed stream cipher is carried out by NIST Statistical Test Suite and it is confirmed by comparison of the randomness parameters results that the randomness of bit-stream produced by the proposed stream cipher has improved significantly hence the enhanced security can be achieved.","PeriodicalId":293167,"journal":{"name":"2021 IEEE International Symposium on Smart Electronic Systems (iSES) (Formerly iNiS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Symposium on Smart Electronic Systems (iSES) (Formerly iNiS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iSES52644.2021.00102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Global System for Mobile (GSM) is still widely used cellular standard providing many services like Voice, SMS & Data Service with mobility. To secure information in the GSM cellular network, security is implemented at two levels i.e. initially to authorize the valid users for every location update and then during call, encryption is applied over the information being transmitted on GSM channel to protect from being intercepted and decoded by unauthorized persons. This protection is achieved by converting the original message into an encoded form (cipher form) that appears to be a random stream of symbols. Under “Challenge-Response” mechanism, A3 and A8 algorithms are used to generate triplet (RAND, SRES & Kc) for authentication of any user at GSM network. But the actual information is encrypted using A5 algorithm to generate cipher stream for better protection from interception. This A5 stream cipher has three versions: A5/1, A5/2 and A5/3. A5/1 works on Liner Feedback Shift Registers (LFSRs) with irregular clocking and generates pseudo random binary stream. These three versions of A5 algorithm are being used for encryption of information over GSM since the launching of GSM services and have been cryptographically analyzed by Reverse-Engineering. With passage of time, many hackers & crackers are becoming able to break this encryption identifying some weaknesses of these algorithms and can decrypt the original information. These stream ciphers are facing some weaknesses like poor Liner Complexity (LC) & clocking mechanism (Majority Rule), short clocking period, weak choice of clocking taps and collision problem. Because of such weaknesses, these stream ciphers can be decrypted by intruders. In this papers an attempt has been made to reduce these weaknesses and enhance the security by introducing non-linear combinational generator (NLFSRs), reuse of 32 bits SRES generated by A3 algorithm and finally combining the output stream with last 32 bits of CGI. The randomness analysis of proposed stream cipher is carried out by NIST Statistical Test Suite and it is confirmed by comparison of the randomness parameters results that the randomness of bit-stream produced by the proposed stream cipher has improved significantly hence the enhanced security can be achieved.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于NIST测试套件的增强型A5/1流密码实现及其随机性分析
全球移动通信系统(GSM)仍然是广泛使用的蜂窝标准,提供许多业务,如语音,短信和数据服务的移动性。为了确保GSM蜂窝网络中的信息安全,安全措施在两个层面上实施,即最初授权有效用户进行每次位置更新,然后在通话期间,对在GSM信道上传输的信息应用加密,以防止被未经授权的人拦截和解码。这种保护是通过将原始消息转换为看起来是随机符号流的编码形式(密码形式)来实现的。在“挑战-响应”机制下,使用A3和A8算法生成三元组(RAND, SRES和Kc),用于GSM网络中任何用户的认证。但实际信息是使用A5算法加密的,以生成密码流,以更好地防止拦截。这个A5流密码有三个版本:A5/1, A5/2和A5/3。A5/1工作在具有不规则时钟的线性反馈移位寄存器(LFSRs)上,并产生伪随机二进制流。自GSM服务推出以来,这三个版本的A5算法被用于GSM上的信息加密,并通过逆向工程进行了加密分析。随着时间的推移,许多黑客和破解者能够破解这种加密,识别这些算法的一些弱点,并可以解密原始信息。这些流密码存在着线性复杂度(LC)和时钟机制(多数规则)差、时钟周期短、时钟节拍选择弱和碰撞问题等缺点。由于这些弱点,这些流密码可以被入侵者解密。本文试图通过引入非线性组合生成器(NLFSRs),重用A3算法生成的32位SRES,最后将输出流与CGI的最后32位相结合来减少这些弱点并提高安全性。通过NIST统计测试套件对所提出的流密码进行随机性分析,通过随机性参数结果的对比证实,所提出的流密码产生的比特流的随机性有了明显的提高,从而提高了安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Implementation of Self-Controlled Wheelchairs based on Joystick, Gesture Motion and Voice Recognition Dynamic Two Hand Gesture Recognition using CNN-LSTM based networks Performance Assessment of Dual Metal Graded Channel Negative Capacitance Junctionless FET for Digital/Analog field VLSI Architecture of Sigmoid Activation Function for Rapid Prototyping of Machine Learning Applications. Influence of Nanosilica in PVDF Thin Films for Sensing Applications
×
引用
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