A Simple and Unified Method of Proving Unpredictability

Mridul Nandi

Paper 2006/264

A Simple and Unified Method of Proving Unpredictability

Mridul Nandi

Abstract

Recently Bernstein has provided a simpler proof of unpredictability of CBC construction which is giving insight of the construction. Unpredictability of any function intuitively means that the function behaves very closely to a uniform random function. In this paper we make a unifying and simple approach to prove unpredictability of many existing constructions. We first revisit Bernstein's proof. Using this idea we can show a simpler proof of unpredictability of a class of DAG based construction, XCBC, TMAC, OMAC and PMAC. We also provide a simpler proof for stronger bound of CBC and a simpler proof of security of on-line Hash-CBC. We note that there is a flaw in the original security proof of Hash-CBC. This paper will help to understand security analysis of unpredictability of many constructions in a simpler way.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): mridul nandi @ gmail com
History: 2006-08-08: received
Short URL: https://ia.cr/2006/264
License: CC BY

BibTeX

@misc{cryptoeprint:2006/264,
      author = {Mridul Nandi},
      title = {A Simple and Unified Method of Proving Unpredictability},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/264},
      year = {2006},
      url = {https://eprint.iacr.org/2006/264}
}