Abstract
The KASUMI block cipher and the confidentiality (f8) and integrity (f9) algorithms using KASUMI in feed back cipher modes have been standardized by the 3GPP. We designed compact and high-speed implementations and then compared several prototypes to existing designs in ASICs and FPGAs. Making good use of the nested structure of KASUMI, a lot of function blocks are shared and reused. The data paths of the f8 and f9 algorithms are merged using only one 64-bit selector. An extremely small size of 3.07 Kgates with a 288 Mbps throughput is obtained for a KASUMI core using a 0.13- μm CMOS standard cell library. Even simultaneously supporting both the f8 and f9 algorithms, the same throughput is achieved with 4.89 Kgates. The fastest design supporting the two algorithms achieves 1.6 Gbps with 8.27 Kgates.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Matsui, “New Block Encryption Algorithm MISTY,” Fast Software Encryption’ 97 (FSE97), LCNS1267, pp. 54–68, 1997.
N. K. Moshopoulos, F. Karoubalis, and K.Z. Pekmestzi, “On the Hardware Implementation of the 3GPP Confidentiality and Integrity Algorithm,” Information Security Conference 2001 (ISC2001), LNCS 2200, pp.248–265, 2001.
ISO/IEC 9797-1:1999, “Information technology-Security techniques-Message Authentication Codes (MACs)-Part 1: Mechanisms using a block cipher.”
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Satoh, A., Morioka, S. (2002). Small and High-Speed Hardware Architectures for the 3GPP Standard Cipher KASUMI. In: Chan, A.H., Gligor, V. (eds) Information Security. ISC 2002. Lecture Notes in Computer Science, vol 2433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45811-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-45811-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44270-7
Online ISBN: 978-3-540-45811-1
eBook Packages: Springer Book Archive