Length-doubling ciphers and tweakable ciphers

Authors:
Haibin Zhang
Affiliations:
Dept. of Computer Science, University of California, Davis
Venue:
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Year:
2012

Citing 20
Cited 0

How to construct pseudorandom permutations from pseudorandom functions

SIAM Journal on Computing - Special issue on cryptography
Tweakable Block Ciphers

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
LFSR-based Hashing and Authentication

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Unbalanced Feistel Networks and Block Cipher Design

Proceedings of the Third International Workshop on Fast Software Encryption
On the Construction of Variable-Input-Length Ciphers

FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Elastic block ciphers: method, security and instantiations

International Journal of Information Security
Intel's New AES Instructions for Enhanced Performance and Security

Fast Software Encryption
Invertible universal hashing and the TET encryption mode

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On tweaking Luby-Rackoff blockciphers

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
The security of the extended codebook (XCB) mode of operation

SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Online ciphers from tweakable blockciphers

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
The software performance of authenticated-encryption modes

FSE'11 Proceedings of the 18th international conference on Fast software encryption
Efficient constructions of variable-input-length block ciphers

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
HCH: a new tweakable enciphering scheme using the hash-encrypt-hash approach

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
HCTR: a variable-input-length enciphering mode

CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
A new mode of encryption providing a tweakable strong pseudo-random permutation

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
EME*: extending EME to handle arbitrary-length messages with associated data

INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
The security of triple encryption and a framework for code-based game-playing proofs

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
How to Enrich the Message Space of a Cipher

FSE'07 Proceedings of the 14th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

We motivate and describe a mode of operation HEM (resp., THEM) that turns a n-bit blockcipher into a variable-input-length cipher (resp., tweakable cipher) that acts on strings of [n..2n−1] bits. Both HEM and THEM are simple and intuitive and use only two blockcipher calls, while prior work at least takes three. We prove them secure in the sense of strong PRP and tweakable strong PRP, assuming the underlying blockcipher is a strong PRP.