Saxena, N. and Chaudhari, N.S., 2017. Secure Algorithms for SAKA Protocol in the GSM Network. In: 10th Wireless and Mobile Networking Conference (WMNC), 25-27 September 2017, Valencia, Spain.
Full text available as:
|
PDF
WPC_paper1.pdf - Accepted Version Available under License Creative Commons Attribution Non-commercial No Derivatives. 453kB | |
Copyright to original material in this document is with the original owner(s). Access to this content through BURO is granted on condition that you use it only for research, scholarly or other non-commercial purposes. If you wish to use it for any other purposes, you must contact BU via BURO@bournemouth.ac.uk. Any third party copyright material in this document remains the property of its respective owner(s). BU grants no licence for further use of that third party material. |
Abstract
This paper deals with the security vulnerabilities of the cryptographic algorithms A3, A8, and A5 existing in the GSM network. We review these algorithms and propose new secure algorithms named NewA3, NewA8, and NewA5 algorithms with respect to the A3, A8, and A5 algorithms. Our NewA5 algorithm is based on block ciphers, but we also propose NewA5 algorithm with Cipher Feedback, Counter, and Output Feedback modes to convert block cipher into stream cipher. However, stream cipher algorithms are slower than the block cipher algorithm. These new algorithms are proposed to use with a secure and efficient authentication and key agreement (AKA) protocol in the GSM network. The proposed architecture is secure against partition attack, narrow pipe attack, collision attack, interleaving attack, and man-in-the-middle attack. The security analysis of the proposed algorithms are discussed with respect to the cryptanalysis, brute force analysis, and operational analysis. We choose the NewA3 and NewA8 algorithms for challenge-response and key generation, respectively. Furthermore, the NewA5 is suitable for encryption as it is efficient than the existing A5/1 and A5/2 algorithms. In case when stream cipher algorithms are required to use, our new algorithms, NewA5-CTR, NewA5-CFB, and NewA5-OFB can be used for specific applications. These algorithms are completely secure and better than the existing A5/1 and A5/2 in terms of resistant to attacks.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Group: | Faculty of Science & Technology |
ID Code: | 29835 |
Deposited By: | Symplectic RT2 |
Deposited On: | 09 Oct 2017 15:00 |
Last Modified: | 14 Mar 2022 14:07 |
Downloads
Downloads per month over past year
Repository Staff Only - |