Sciweavers

4 search results - page 1 / 1
» The Sum of PRPs Is a Secure PRF
Sort
View
EUROCRYPT
2000
Springer
13 years 8 months ago
The Sum of PRPs Is a Secure PRF
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...
Stefan Lucks
ASIACRYPT
2000
Springer
13 years 8 months ago
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
Anand Desai, Sara K. Miner
FSE
2006
Springer
132views Cryptology» more  FSE 2006»
13 years 8 months ago
New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
In this paper, we define and analyze a new blockcipher mode of operation for encryption, CENC, which stands for Cipher-based ENCryption. CENC has the following advantages: (1) bey...
Tetsu Iwata
TIT
2010
130views Education» more  TIT 2010»
12 years 11 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar