Sciweavers

60 search results - page 8 / 12
» A Family of Trapdoor Ciphers
Sort
View
IACR
2011
139views more  IACR 2011»
12 years 7 months ago
Improved Meet-in-the-Middle Cryptanalysis of KTANTAN
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
Lei Wei, Christian Rechberger, Jian Guo 0001, Hong...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
14 years 7 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
FSE
1994
Springer
176views Cryptology» more  FSE 1994»
13 years 11 months ago
Improved Characteristics for Differential Cryptanalysis of Hash Functions Based on Block Ciphers
In this paper we present an improvement of the differential attack on hash functions based on block ciphers. By using the specific properties of the collision attack on hash functi...
Vincent Rijmen, Bart Preneel
FSE
1999
Springer
101views Cryptology» more  FSE 1999»
13 years 11 months ago
Mod n Cryptanalysis, with Applications Against RC5P and M6
We introduce “mod n cryptanalysis,” a form of partitioning attack that is effective against ciphers which rely on modular addition and bit rotations for their security. We dem...
John Kelsey, Bruce Schneier, David Wagner
DCC
2001
IEEE
14 years 7 months ago
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
Iiro S. Honkala, Andrew Klapper