Abstract
Within many cryptographic systems a key expansion function is used in order to derive more keying material from the master secret. The derived additional keys may be needed for multiple entities or for different cryptographic purposes such as privacy and authenticity. In this paper we wish to examine the soundness of the key expansion functions on the view point of provable security framework. Especially we focus on the key expansion functions using PRFs(pseudorandom functions) which are recommended by NIST, and show that the variant of Double-Pipeline Iteration mode using PRPs(pseudorandom permutations) is secure, while the variants of Counter and Feedback modes using PRPs are insecure. In practice secure block ciphers such as AES can be regarded as PRPs.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. J. Computer and System Sciences 61(3), 362–399 (2000)
Bellare, M., Rogaway, P.: Introduction to Mordern Cryptography, http://cseweb.ucsd.edu/~mihir/cse207/classnotes.html
FIPS 198-1, The Keyed-Hash Message Authentication Code, HMAC (2008)
Gilbert, H.: The security of one-block-to-many modes of operation. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 376–395. Springer, Heidelberg (2003)
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. of the ACM 33(4), 210–217 (1986)
Krawczyk, H.: Cryptographic extraction and key derivation: The HKDF scheme. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 631–648. Springer, Heidelberg (2010)
Luby, M., Rackoff, C.: How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Comput. 17, 373–386 (1988)
Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. Cryptology 12, 29–66 (1999)
NIST Special Publication 800-108, Recommendation for Block Cipher Modes of Operation - The CMAC Mode for Authentication (May 2005)
NIST Special Publication 800-56C, Recommendation for Key Derivation through Extraction-then-Expansion (November 2011)
NIST Special Publication 800-108, Recommendation for Key Derivation Using Pseudorandom Functions (October 2009)
Patarin, J.: How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In: Rueppel, R.A. (ed.) Advances in Cryptology - EUROCRYPT 1992. LNCS, vol. 658, pp. 256–266. Springer, Heidelberg (1993)
3rd Generation Partnership Project, Specification of the MILENAGE algorithm set: An example algorithm set for the 3GPP authentication and key generation functions f1, f1*, f2, f3, f4, f5 and f5*, http://www.3gpp.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kang, JS., Kim, N., Ju, W., Yi, OY. (2014). A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations. In: Naccache, D., Sauveron, D. (eds) Information Security Theory and Practice. Securing the Internet of Things. WISTP 2014. Lecture Notes in Computer Science, vol 8501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43826-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-43826-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43825-1
Online ISBN: 978-3-662-43826-8
eBook Packages: Computer ScienceComputer Science (R0)