A modular framework for building variable-input-length tweakable ciphers
We present the Protected-IV construction (PIV) a simple, modular method for building
variable-input-length tweakable ciphers. At our level of abstraction, many interesting design …
variable-input-length tweakable ciphers. At our level of abstraction, many interesting design …
ELmD: A pipelineable authenticated encryption and its hardware implementation
Authenticated encryption schemes which resist misuse of nonce at some desired level of
privacy are two-pass or Mac-then-Encrypt constructions (inherently inefficient but provide full …
privacy are two-pass or Mac-then-Encrypt constructions (inherently inefficient but provide full …
ZCZ – Achieving n-bit SPRP Security with a Minimal Number of Tweakable-Block-Cipher Calls
Abstract Strong Pseudo-random Permutations (SPRP s) are important for various
applications. In general, it is desirable to base an SPRP on a single-keyed primitive for …
applications. In general, it is desirable to base an SPRP on a single-keyed primitive for …
Efficient and reliable error detection architectures of Hash-Counter-Hash tweakable enciphering schemes
Through pseudorandom permutation, tweakable enciphering schemes (TES) constitute
block cipher modes of operation which perform length-preserving computations. The state-of …
block cipher modes of operation which perform length-preserving computations. The state-of …
STES: A Stream Cipher Based Low Cost Scheme for Securing Stored Data
The problem of securing data present on USB memories and SD cards has not been
adequately addressed in the cryptography literature. While the formal notion of a tweakable …
adequately addressed in the cryptography literature. While the formal notion of a tweakable …
A fast single-key two-level universal hash function
Universal hash functions based on univariate polynomials are well known, eg\sym
{Poly1305} and\sym {GHASH}. Using Horner's rule to evaluate such hash functions require …
{Poly1305} and\sym {GHASH}. Using Horner's rule to evaluate such hash functions require …
FAST: disk encryption and beyond
This work introduces\sym {FAST} which is a new family of tweakable enciphering schemes.
Several instantiations of\sym {FAST} are described. These are targeted towards two goals …
Several instantiations of\sym {FAST} are described. These are targeted towards two goals …
Polynomial hashing over prime order fields
This paper makes a comprehensive study of two important strategies for polynomial hashing
over a prime order field $\mathbb {F} _p $, namely usual polynomial based hashing and …
over a prime order field $\mathbb {F} _p $, namely usual polynomial based hashing and …
An Ultra-Fast Authenticated Encryption Scheme with Associated Data Using AES-OTR
Applications relying on the Ethernet IEEE 802.3 ba and IEEE802. 3b standards require
secure data encryption and authentication at extremely high speeds (at least 100 Gbit/s) …
secure data encryption and authentication at extremely high speeds (at least 100 Gbit/s) …
Disk encryption: do we need to preserve length?
In the last one and a half decade there has been a lot of activity toward development of
cryptographic techniques for disk encryption. It has been almost canonized that an …
cryptographic techniques for disk encryption. It has been almost canonized that an …