On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers

  • Ermaliza Razali
  • Raphael C. -W. Phan
  • Marc Joye
Conference paper

DOI: 10.1007/978-3-540-75670-5_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4784)
Cite this paper as:
Razali E., Phan R.C.W., Joye M. (2007) On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers. In: Susilo W., Liu J.K., Mu Y. (eds) Provable Security. ProvSec 2007. Lecture Notes in Computer Science, vol 4784. Springer, Berlin, Heidelberg


Security of commonly used block ciphers is typically measured in terms of their resistance to known attacks. While the provable security approach to block ciphers dates back to the first CRYPTO conference (1981), analysis of modern block cipher proposals basically do not benefit fully from this, except for a few cases. This paper considers the security of recently proposed PRP-RKA secure block ciphers and discusses how they relate to existing types of attacks on block ciphers.


Provable security pseudorandom permutation (PRPkey recovery (KRblock cipher related key attacks (RKA


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ermaliza Razali
    • 1
  • Raphael C. -W. Phan
    • 2
  • Marc Joye
    • 3
  1. 1.Information Security Research (iSECURES) Lab, Swinburne University of Technology, Sarawak campus, KuchingMalaysia
  2. 2.Laboratoire de sécurité et de cryptographie, EPFL, Station 14 - Building INF, 1015 LausanneSwitzerland
  3. 3.Thomson R&D France, Technology Group, Corporate Research, Security Laboratory, 1 avenue de Belle Fontaine, 35576 Cesson-Sévigné CedexFrance

Personalised recommendations