搜索结果: 1-10 共查到“军事学 random permutations”相关记录10条 . 查询时间(0.078 秒)
Pseudorandom functions are traditionally built upon block ciphers, but with the trend of permutation based cryptography, it is a natural question to investigate the design of pseudorandom functions fr...
Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the χ2 Method
random permutation indifferentiable security χ2 method
2018/3/6
The construction XORPXORP (bitwise-xor of outputs of two independent nn-bit random permutations) has gained broad attention over the last two decades due to its high security.
An Improved Affine Equivalence Algorithm for Random Permutations
Affine equivalence problem block cipher Even-Mansour cipher
2018/2/1
Our algorithm is based on a new structure (called a \emph{rank table}) which is used to analyze particular algebraic properties of a function that remain invariant under invertible affine transformati...
Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time
Card shuffling format-preserving encryption
2014/3/10
We describe a security-preserving construction of a random permutation of domain size N from a random function, the construction tolerating adversaries asking all N plaintexts, yet employing just \The...
(Non-)Random Sequences from (Non-)Random Permutations - Analysis of RC4 stream cipher
Bias Cryptography Distinguisher Probability Distribution Pseudo-Random Permutation Pseudo-Random Word Random Sequences RC4 Sequences Stream Ciphers.
2012/3/26
RC4 has been the most popular stream cipher in the history of symmetric key cryptography till date. Its internal state contains a pseudo-random permutation over all $n$-bit words (typically $n = 8$) a...
Statistics of Random Permutations and the Cryptanalysis Of Periodic Block Ciphers
Generating Functions EGF OGF Random Permutations
2009/6/12
A block cipher is intended to be computationally indistinguishable from a random permutation
of appropriate domain and range. But what are the properties of a random permutation? By
the aid of expon...
A Proof of Security in O(2n) for the Xor of Two Random Permutations
Pseudorandom functions pseudorandom permutations security beyond the birthday bound
2009/6/2
Xoring two permutations is a very simple way to construct pseudorandom functions from
pseudorandom permutations. The aim of this paper is to get precise security results for this
construction. Since...
Generic Attacks for the Xor of k Random Permutations
Pseudorandom functions pseudorandom permutations Luby-Rackoff backwards
2009/6/2
Xoring the output of k permutations, k 2 is a very simple way to construct pseudo-random
functions (PRF) from pseudo-random permutations (PRP). Moreover such construction has
many applications in ...
Pseudorandom Functions (PRFs), introduced by Goldreich, Goldwasser and Micali [9], allow one
to eciently simulate the computation of a function which is indistinguishable from a truly random functio...
Threshold and Proactive Pseudo-Random Permutations
Distributed Block Ciphers Distributed Luby-Rackoff Construction Oblivious Pseudo-Random Functions Threshold Cryptography
2008/10/21
We construct a reasonably efficient threshold and proactive
pseudo-random permutation (PRP). Our protocol needs only O(1) communication
rounds. It tolerates up to (n − 1)/2 of n dishonest s...