Sciweavers

175 search results - page 13 / 35
» Bounds for Permutation Rate-Distortion
Sort
View
ASIACRYPT
2001
Springer
14 years 5 days ago
Provable Security of KASUMI and 3GPP Encryption Mode f8
Within the security architecture of the 3GPP system there is a standardised encryption mode f8 based on the block cipher KASUMI. In this work we examine the pseudorandomness of the...
Ju-Sung Kang, Sang Uk Shin, Dowon Hong, Okyeon Yi
JDA
2008
122views more  JDA 2008»
13 years 7 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
ASIACRYPT
1991
Springer
13 years 11 months ago
Limitations of the Even-Mansour Construction
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
Joan Daemen
DCC
2005
IEEE
13 years 9 months ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
Shengtian Yang, Peiliang Qiu
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 7 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková