Sciweavers

1696 search results - page 14 / 340
» Permuted function matching
Sort
View
CRYPTO
1992
Springer
156views Cryptology» more  CRYPTO 1992»
15 years 2 months ago
DES is not a Group
We prove that the set of DES permutations (encryption and decryption for each DES key) is not closed under functional composition. This implies that, in general, multiple DES-encry...
Keith W. Campbell, Michael J. Wiener
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
15 years 4 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
IACR
2011
149views more  IACR 2011»
13 years 9 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
JCT
2008
53views more  JCT 2008»
14 years 10 months ago
A major index for matchings and set partitions
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
William Y. C. Chen, Ira M. Gessel, Catherine H. Ya...
EOR
2008
85views more  EOR 2008»
14 years 10 months ago
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti