搜索结果: 1-9 共查到“军事学 random permutation”相关记录9条 . 查询时间(0.078 秒)
On the Streaming Indistinguishability of a Random Permutation and a Random Function
Streaming algorithm time-memory tradeoff switching lemma
2019/4/23
An adversary with SS bits of memory obtains a stream of QQ elements that are uniformly drawn from the set {1,2,…,N}{1,2,…,N}, either with or without replacement. This corresponds to sampling QQ elemen...
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
Secret-Key Cryptography Generic Group Model Non-Uniformity
2018/3/5
The random-permutation model (RPM) and the ideal-cipher model (ICM) are idealized models that offer a simple and intuitive way to assess the conjectured standard-model security of many important symme...
We study instantiating the random permutation of the block-cipher mode of operation IAPM (Integrity-Aware Parallelizable Mode) with the public random permutation of Keccak, on which the draft standard...
The Iterated Random Permutation Problem with Applications to Cascade Encryption
iterated random permutation problem block cipherlpseudorandom permutation
2015/12/30
We introduce and study the iterated random permutation
problem, which asks how hard it is to distinguish, in a black-box way, the rth
power of a random permutation from a uniformly random permutatio...
A Simple Proof of a Distinguishing Bound of Iterated Uniform Random Permutation
iterated random permutation blockcipher cascade encryption
2015/12/29
Let P be chosen uniformly from the set P := Perm(S), the set of all permutations over a
set S of size N. In Crypto 2015, Minaud and Seurin proved that for any unbounded time adversary A,
making at m...
Distinguishing a truncated random permutation from a random function
Pseudo random permutations pseudo random functions advantage
2015/12/24
An oracle chooses a function f from the set of n bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an n-bit string w, the oracle comp...
Power of a Public Random Permutation and its Application to Authenticated-Encryption
authenticated-encryption DESX IAPM
2009/4/15
In this paper, we first show that many independent pseudorandom
permutations over {0, 1}n can be obtained from a single public random
permutation and secret n bits. We next prove that a slightly mod...
A New Mode of Encryption Providing A Tweakable Strong Pseudo-Random Permutation
mode of operation tweakable encryption strong pseudo-random permutation
2008/12/12
We present PEP, which is a new construction of a tweakable strong pseudo-random permuta-
tion. PEP uses a hash-encrypt-hash approach which has recently been used in the construction
of HCTR. This ap...
A New Mode of Encryption Providing A Tweakable Strong Pseudo-Random Permutation
mode of operation tweakable encryption strong pseudo-random permutation
2008/12/11
We present PEP, which is a new construction of a tweakable strong pseudo-random permuta-
tion. PEP uses a hash-encrypt-hash approach which has recently been used in the construction
of HCTR. This ap...