Optimized and robust implementation of mobile networks confidentiality and integrity functions - Archive ouverte HAL
Article Dans Une Revue Computers & Security Année : 2021

Optimized and robust implementation of mobile networks confidentiality and integrity functions

Résumé

In mobile networks, sensitive information is transmitted over the radio link between the Base Station (BS) and the Mobile Station (MS). Therefore, a security mechanism based on confidentiality and integrity functions is designed to protect the anonymity of users’. More precisely, the confidentiality function was standardized by the Third Generation Partnership Project (3GPP) to protect users’ data and the integrity function to protect control (signaling) data. However, both functions are based on the same kernel algorithm. For example, the functions used in the Universal Mobile Telecommunications System (UMTS) network are based on the algorithm, namely the KASUMI block cipher. In this work, we proposed an optimized function that combines the confidentiality and integrity functions in one Running-Block-Cipher and ensures the same functionalities as the basic functions (UMTS F8 and F9 functions). We used an architectural synthesis technique that allows for achieving a significant reduction in the area occupied on the hardware device. The designed architecture was implemented on Xilinx Virtex Field Programmable Gate Arrays (FPGA) technology. The synthesis results after a place-and-route and comparison with previous works show the good performance of the proposed architecture in terms of throughput, consumed energy, and occupied hardware logic resources.

Dates et versions

hal-03807474 , version 1 (18-12-2021)
hal-03807474 , version 2 (21-11-2022)

Identifiants

Citer

Mahdi Madani, Camel Tanougast. Optimized and robust implementation of mobile networks confidentiality and integrity functions. Computers & Security, 2021, 100, pp.102093. ⟨10.1016/j.cose.2020.102093⟩. ⟨hal-03807474v1⟩
66 Consultations
34 Téléchargements

Altmetric

Partager

More