Publication

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

2007
Conference paper
Abstract

Security of a modern block cipher is commonly measured in terms of its 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 typically do not ben- efit fully from this besides the proof of security for DESX by Kilian and Rogaway, and recent work on the notions of PRP-RKA initiated by Bel- lare and Kohno. We consider the security of recently proposed PRP-RKA secure block ciphers. We discuss implications of the proven theorems and how they relate to existing types of attacks on block ciphers. Our results are the first known cryptanalysis of these provably secure ciphers.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.