Evolutionary approach to secure mobile telecommunication networks

Abdelkader Ghazli, Adda Alipacha, Naima Hadj Said


A series of encryption algorithms called A5 is used to secure mobile telephone communications, producing a pseudo-random sequence that will be XORed with the data flowing in the air interface in order to secure them. These algorithms are essentially composed of shift registers with linear feedback, controlled generally by a function or with another register in order to favor the randomness character of the keystream generated. Evolutionary algorithms are bioinspired calculation methods, used much more to find optimal solutions. They are a family of algorithms whose principle is inspired by the theory of evolution, which consists in evolving a set of solutions to a problem given in order to find better results. This paper presents an improvement of the A5/1 algorithm by an evolutionary approach based on the use of Particle Swarm Optimization Algorithm (PSO) in order to limit some weaknesses and drawbacks found in the conventional A5/1 version, which have been cryptanalysed and several attacks have been published such as time memory trade off attacks, guess and determine attacks, biased birthday attackĀ and the random subgraph attack. Our approach does not change the architecture of the A5/1 but it just serves to improve its shifting system by an evolutionary approach, which guarantees the quality of the keystream generated and makes it more complex and more secure so it can be be used in future mobile telecommunication networks.


A5/1; Evolutionary; LFSR; Mobile network; PSO; Security; Stream cipher;

DOI: http://doi.org/10.11591/ijeecs.v24.i1.pp%25p


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics