Results 1  10
of
153
Online Ciphers from Tweakable Blockciphers
"... Online ciphers are deterministic lengthpreserving permutations EK: ({0, 1} n) + → ({0, 1} n) + where the ith block of ciphertext depends only on the first i blocks of plaintext. Definitions, constructions, and applications for these objects were first given by Bellare, Boldyreva, Knudsen, and Na ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Online ciphers are deterministic lengthpreserving permutations EK: ({0, 1} n) + → ({0, 1} n) + where the ith block of ciphertext depends only on the first i blocks of plaintext. Definitions, constructions, and applications for these objects were first given by Bellare, Boldyreva, Knudsen
CounterinTweak: Authenticated Encryption Modes for Tweakable Block Ciphers
, 2015
"... Abstract. We propose the Synthetic CounterinTweak (SCT) mode, which turns a tweakable block cipher into a noncebased authenticated encryption scheme (with associated data). The SCT mode combines in a SIVlike manner a WegmanCarter MAC inspired from PMAC for the authentication part and a new coun ..."
Abstract
 Add to MetaCart
Abstract. We propose the Synthetic CounterinTweak (SCT) mode, which turns a tweakable block cipher into a noncebased authenticated encryption scheme (with associated data). The SCT mode combines in a SIVlike manner a WegmanCarter MAC inspired from PMAC for the authentication part and a new
Beyondbirthdaybound security based on tweakable block cipher
 In FSE
"... Abstract. This paper studies how to build a 2nbit block cipher which is hard to distinguish from a truly random permutation against attacks with q 2n=2 queries, i.e., birthday attacks. Unlike previous approaches using pseudorandom functions, we present a simple and efficient proposal using a tweak ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Abstract. This paper studies how to build a 2nbit block cipher which is hard to distinguish from a truly random permutation against attacks with q 2n=2 queries, i.e., birthday attacks. Unlike previous approaches using pseudorandom functions, we present a simple and efficient proposal using a
A general construction of tweakable block ciphers and different modes of operations
 IEEE Transactions on Information Theory
"... Abstract—This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway’s TBC construction by working over a ring and by the use of a masking sequence of functions. The ring can be instantiated ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
Abstract—This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway’s TBC construction by working over a ring and by the use of a masking sequence of functions. The ring can be instantiated
Efficient Tweakable Enciphering Schemes from (BlockWise) Universal Hash Functions
"... Abstract. We present several constructions of tweakable enciphering schemes which use a single encryption layer between two layers of universal hash function computation. The earliest known construction of this type is due to Naor and Reingold, where the encryption layer is the electronic codebook m ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
mode. A more recent work of this type is TET and is due to Halevi at Crypto 2007. We present a new construction Ψ of an invertible blockwise almost universal hash function. Using this we construct a tweakable enciphering scheme HEH. For variable length messages HEH has better efficiency than TET
ABSTRACT Elastic Block Ciphers
, 2006
"... Standard block ciphers are designed around one or a small number of block sizes. From both a practical and a theoretical perspective, the question of how to efficiently support a range of block sizes is of interest. In applications, the length of the data to be encrypted is often not a multiple of t ..."
Abstract
 Add to MetaCart
Standard block ciphers are designed around one or a small number of block sizes. From both a practical and a theoretical perspective, the question of how to efficiently support a range of block sizes is of interest. In applications, the length of the data to be encrypted is often not a multiple
Graphs connected with block ciphers
"... Abstract: A block cipher consists of round transformations. Each round transformation contains a mixing layer to create diffusion, that is, to have each output bit dependent on all input bits. Such a transformation can also be described by means of graph theory language. Here we generalize a partial ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to the problem of an ideal round transformation. Key–Words: Graphs with oriented path of length 2, Efficient design of block cipher. 1
Some Plausible Constructions of DoubleBlockLength Hash Functions
 FSE 2006, volume 4047 of LNCS
, 2006
"... Abstract. In this article, it is discussed how to construct a compression function with 2nbit output using a component function with nbit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collisionresistant ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
Abstract. In this article, it is discussed how to construct a compression function with 2nbit output using a component function with nbit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collision
How to Construct DoubleBlockLength Hash Functions
 In: Second Cryptographic Hash Workshop
, 2006
"... In this article, it is discussed how to construct a compression function with 2nbit output using a component function with nbit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collisionresistant hash functio ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
In this article, it is discussed how to construct a compression function with 2nbit output using a component function with nbit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collisionresistant hash
Message Authentication Codes from Unpredictable Block Ciphers
, 2009
"... We design an efficient mode of operation on block ciphers, SSNMAC. Our mode has the following properties, when instantiated with a block cipher f to yield a variablelength, keyed hash function H: (1) MAC Preservation. H is a secure message authentication code (MAC) with birthday security, as long ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We design an efficient mode of operation on block ciphers, SSNMAC. Our mode has the following properties, when instantiated with a block cipher f to yield a variablelength, keyed hash function H: (1) MAC Preservation. H is a secure message authentication code (MAC) with birthday security, as long
Results 1  10
of
153