14th International Conference on Science, Engineering and Technology | |
Enhancement of A5/1 encryption algorithm | |
自然科学;工业技术 | |
Elin Thomas, Ria^1 ; Chandhiny, G.^1 ; Sharma, Katyayani^1 ; Santhi, H.^1 ; Gayathri, P.^1 | |
School of Computer Science and Engineering, VIT University, Vellore | |
632014, India^1 | |
关键词: A5/1 algorithms; Encryption algorithms; Integral part; Mobile communications; Pseudo-random numbers; Time complexity; Various attacks; | |
Others : https://iopscience.iop.org/article/10.1088/1757-899X/263/4/042084/pdf DOI : 10.1088/1757-899X/263/4/042084 |
|
来源: IOP | |
【 摘 要 】
Mobiles have become an integral part of today's world. Various standards have been proposed for the mobile communication, one of them being GSM. With the rising increase of mobile-based crimes, it is necessary to improve the security of the information passed in the form of voice or data. GSM uses A5/1 for its encryption. It is known that various attacks have been implemented, exploiting the vulnerabilities present within the A5/1 algorithm. Thus, in this paper, we proceed to look at what these vulnerabilities are, and propose the enhanced A5/1 (E-A5/1) where, we try to improve the security provided by the A5/1 algorithm by XORing the key stream generated with a pseudo random number, without increasing the time complexity. We need to study what the vulnerabilities of the base algorithm (A5/1) is, and try to improve upon its security. This will help in the future releases of the A5 family of algorithms.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
Enhancement of A5/1 encryption algorithm | 491KB | download |