Beyond-Birthday-Bound Security Based on Tweakable Block Cipher

Authors:
Kazuhiko Minematsu
Affiliations:
NEC Corporation, Kawasaki, Japan
Venue:
Fast Software Encryption
Year:
2009

Citing 0
Cited 4

PolyE+CTR: a swiss-army-knife mode for block ciphers

ProvSec'11 Proceedings of the 5th international conference on Provable security
A domain extender for the ideal cipher

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
The sum of CBC MACs is a secure PRF

CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal

IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies how to build a 2n-bit block cipher which is hard to distinguish from a truly random permutation against attacks with q ≈ 2 n/2 queries, i.e., birthday attacks. Unlike previous approaches using pseudorandom functions, we present a simple and efficient proposal using a tweakable block cipher as an internal module. Our proposal is provably secure against birthday attacks, if underlying tweakable block cipher is also secure against birthday attacks. We also study how to build such tweakable block ciphers from ordinary block ciphers, which may be of independent interest.