Home > Research > Publications & Outputs > Security enhancements for A5/1 without loosing ...

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems. / Komninos, N.; Honary, Bahram; Darnell, Mike.
3G Mobile Communication Technologies, 2002. Third International Conference on (Conf. Publ. No. 489). London, UK: IEEE, 2002. p. 324-328.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Komninos, N, Honary, B & Darnell, M 2002, Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems. in 3G Mobile Communication Technologies, 2002. Third International Conference on (Conf. Publ. No. 489). IEEE, London, UK, pp. 324-328. https://doi.org/10.1049/cp:20020413

APA

Komninos, N., Honary, B., & Darnell, M. (2002). Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems. In 3G Mobile Communication Technologies, 2002. Third International Conference on (Conf. Publ. No. 489) (pp. 324-328). IEEE. https://doi.org/10.1049/cp:20020413

Vancouver

Komninos N, Honary B, Darnell M. Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems. In 3G Mobile Communication Technologies, 2002. Third International Conference on (Conf. Publ. No. 489). London, UK: IEEE. 2002. p. 324-328 doi: 10.1049/cp:20020413

Author

Komninos, N. ; Honary, Bahram ; Darnell, Mike. / Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems. 3G Mobile Communication Technologies, 2002. Third International Conference on (Conf. Publ. No. 489). London, UK : IEEE, 2002. pp. 324-328

Bibtex

@inproceedings{0156aedf87e643c9af572ac4d2dbe431,
title = "Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems",
abstract = "A5/1 is the strong encryption algorithm which protects the air interface of the GSM cellular network. However, in the Fast Software Encryption Workshop 2000, two attacks, the biased birthday attack and the random subgraph attack against A5/1 were presented. We propose new security enhancements to improve A5/1 encryption algorithm from the biased birthday attack and random subgraph attack in order to be used in future mobile communication systems. The improvements that make both attacks impractical are based on the clocking mechanism of the registers, and their key setup routine. Furthermore, we have increased the linear complexity of A5/1 to make the solution of the linear equations impractical in real time systems. Finally, both original and modified versions of A5/1 were implemented easily in a complex programmable logic device (CPLD). The modified version of A5/1 is fast, easy to implement, and most important small in size which makes it ideal for future mobile terminals.",
author = "N. Komninos and Bahram Honary and Mike Darnell",
year = "2002",
month = may,
doi = "10.1049/cp:20020413",
language = "English",
isbn = "0-85296-749-7",
pages = "324--328",
booktitle = "3G Mobile Communication Technologies, 2002. Third International Conference on (Conf. Publ. No. 489)",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Security enhancements for A5/1 without loosing hardware efficiency in future mobile systems

AU - Komninos, N.

AU - Honary, Bahram

AU - Darnell, Mike

PY - 2002/5

Y1 - 2002/5

N2 - A5/1 is the strong encryption algorithm which protects the air interface of the GSM cellular network. However, in the Fast Software Encryption Workshop 2000, two attacks, the biased birthday attack and the random subgraph attack against A5/1 were presented. We propose new security enhancements to improve A5/1 encryption algorithm from the biased birthday attack and random subgraph attack in order to be used in future mobile communication systems. The improvements that make both attacks impractical are based on the clocking mechanism of the registers, and their key setup routine. Furthermore, we have increased the linear complexity of A5/1 to make the solution of the linear equations impractical in real time systems. Finally, both original and modified versions of A5/1 were implemented easily in a complex programmable logic device (CPLD). The modified version of A5/1 is fast, easy to implement, and most important small in size which makes it ideal for future mobile terminals.

AB - A5/1 is the strong encryption algorithm which protects the air interface of the GSM cellular network. However, in the Fast Software Encryption Workshop 2000, two attacks, the biased birthday attack and the random subgraph attack against A5/1 were presented. We propose new security enhancements to improve A5/1 encryption algorithm from the biased birthday attack and random subgraph attack in order to be used in future mobile communication systems. The improvements that make both attacks impractical are based on the clocking mechanism of the registers, and their key setup routine. Furthermore, we have increased the linear complexity of A5/1 to make the solution of the linear equations impractical in real time systems. Finally, both original and modified versions of A5/1 were implemented easily in a complex programmable logic device (CPLD). The modified version of A5/1 is fast, easy to implement, and most important small in size which makes it ideal for future mobile terminals.

U2 - 10.1049/cp:20020413

DO - 10.1049/cp:20020413

M3 - Conference contribution/Paper

SN - 0-85296-749-7

SP - 324

EP - 328

BT - 3G Mobile Communication Technologies, 2002. Third International Conference on (Conf. Publ. No. 489)

PB - IEEE

CY - London, UK

ER -