With a scheme for robust authenticated-encryption a user can select an arbitrary value λ\! ≥
0 and then encrypt a plaintext of any length into a ciphertext that's λ characters longer. The …

We present HBSH, a simple construction for tweakable length-preserving encryption which
supports the fastest options for hashing and stream encryption for processors without AES or …

We consider the generic design of a tweakable blockcipher from one or more evaluations of
a classical blockcipher, in such a way that all input and output wires are of size n bits. As a …

While understanding factors that relate to the recruitment and retention of engineering
students has garnered much attention in recent literature, little is known about the …

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 …

This paper describes several constructions of tweakable strong pseudorandom
permutations (SPRPs) built from different modes of operations of a block cipher and suitable …

This paper focuses on building a tweakable blockcipher from a classical blockcipher whose
input and output wires all have a size of n bits. The main goal is to achieve full 2^ n security …

A generalized Feistel structure (GFS) is a classical approach to construct a block cipher from
pseudorandom functions (PRFs). Coron et al. at TCC 2010 instantiated a Feistel structure …

Ristenpart and Rogaway proposed XLS in 2007 which is a generic method to encrypt
messages with incomplete last blocks. Later Andreeva et al., in 2013 proposed an …

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 …