How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
OCB: a block-cipher mode of operation for efficient authenticated encryption
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
How to Protect DES Against Exhaustive Key Search
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
On Fast and Provably Secure Message Authentication Based on Universal Hashing
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
A Block-Cipher Mode of Operation for Parallelizable Message Authentication
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Towards Making Luby-Rackoff Ciphers Optimal and Practical
FSE '99 Proceedings of the 6th 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
Mercy: A Fast Large Block Cipher for Disk Sector Encryption
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Cryptanalysis of the Mercy Block Cipher
FSE '01 Revised Papers from the 8th International Workshop 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
The security and performance of the galois/counter mode (GCM) of operation
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
An Improved Security Bound for HCTR
Fast Software Encryption
Tweakable Pseudorandom Permutation from Generalized Feistel Structure
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Efficient tweakable enciphering schemes from (block-wise) universal hash functions
IEEE Transactions on Information Theory
On Some Weaknesses in the Disk Encryption Schemes EME and EME2
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Improving upon the TET mode of operation
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Invertible universal hashing and the TET encryption mode
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Tweakable enciphering schemes from hash-sum-expansion
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Efficient implementations of some tweakable enciphering schemes in reconfigurable hardware
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
The security of the extended codebook (XCB) mode of operation
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Symmetric nonce respecting security model and the MEM mode of operation
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
HCH: a new tweakable enciphering scheme using the hash-encrypt-hash approach
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
A new mode of encryption providing a tweakable strong pseudo-random permutation
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
A domain extender for the ideal cipher
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Double ciphertext mode: a proposal for secure backup
International Journal of Applied Cryptography
Double ciphertext mode: a proposal for secure backup
International Journal of Applied Cryptography
Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Tweakable enciphering schemes using only the encryption function of a block cipher
Information Processing Letters
Length-doubling ciphers and tweakable ciphers
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
How to Enrich the Message Space of a Cipher
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
| Hi-index | 0.06 |
This paper proposes a blockcipher mode of operation, HCTR, which is a length-preserving encryption mode. HCTR turns an n-bit blockcipher into a tweakable blockcipher that supports arbitrary variable input length which is no less than n bits. The tweak length of HCTR is fixed and can be zero. We prove that HCTR is a strong tweakable pseudorandom permutation ( $\widetilde{sprp}$), when the underlying blockcipher is a strong pseudorandom permutation (sprp). HCTR is shown to be a very efficient mode of operation when some pre-computations are taken into consideration. Arbitrary variable input length brings much flexibility in various application environments. HCTR can be used in disk sector encryption, and other length-preserving encryptions, especially for the message that is not multiple of n bits.