Tweakable Enciphering Schemes from Hash-Sum-Expansion
From MaRDI portal
Publication:5458214
DOI10.1007/978-3-540-77026-8_19zbMath1153.94413OpenAlexW1527081975MaRDI QIDQ5458214
Toshiyasu Matsushima, Kazuhiko Minematsu
Publication date: 11 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77026-8_19
Related Items (6)
How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers ⋮ Tweakable enciphering schemes using only the encryption function of a block cipher ⋮ An Improved Security Bound for HCTR ⋮ Tweaking key-alternating Feistel block ciphers ⋮ Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal ⋮ Tweakable Pseudorandom Permutation from Generalized Feistel Structure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Modern cryptography, probabilistic proofs and pseudo-randomness
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Luby-Rackoff Ciphers from Weak Round Functions?
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Faster Luby-Rackoff ciphers
- Advances in Cryptology - CRYPTO 2003
- Improved Security Analysis of XEX and LRW Modes
- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
- The Security of the Extended Codebook (XCB) Mode of Operation
- HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Progress in Cryptology - INDOCRYPT 2004
- Information Security and Cryptology
- Information Security and Cryptology - ICISC 2005
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Tweakable Enciphering Schemes from Hash-Sum-Expansion