Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions
From MaRDI portal
Cited in
(20)- Evaluating Bernstein-Rabin-Winograd polynomials
- Tweakable enciphering schemes using only the encryption function of a block cipher
- Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
- \textsf{FAST}: disk encryption and beyond
- Tweaking key-alternating Feistel block ciphers
- XHX -- a framework for optimally secure tweakable block ciphers from classical block ciphers and universal hashing
- Efficient recursive diffusion layers for block ciphers and hash functions
- Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch
- How to build fully secure tweakable blockciphers from classical blockciphers
- More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
- Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes
- An Improved Security Bound for HCTR
- A new multi-linear universal hash family
- scientific article; zbMATH DE number 1951621 (Why is no real title available?)
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- Polynomial hashing over prime order fields
- Efficient instances of docked double decker with AES, and application to authenticated encryption
- On one construction of operating modes of block ciphers for information protection on block-oriented system storage devices
- Type-2 generalized Feistel structures based on tweakable block ciphers, reconsidered
- Another look at XCB
This page was built for publication: Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974036)
