Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FSE
2007
Springer
142views Cryptology» more  FSE 2007»
12 years 1 months ago
A New Class of Weak Keys for Blowfish
The reflection attack is a recently discovered self similarity analysis which is usually mounted on ciphers with many fixed points. In this paper, we describe two reflection attack...
Orhun Kara, Cevat Manap
FSE
2007
Springer
128views Cryptology» more  FSE 2007»
12 years 1 months ago
Differential-Linear Attacks Against the Stream Cipher Phelix
The previous key recovery attacks against Helix obtain the key with about 288 operations using chosen nonces (reusing nonce) and about 1000 adaptively chosen plaintext words (or 23...
Hongjun Wu, Bart Preneel
FSE
2007
Springer
155views Cryptology» more  FSE 2007»
12 years 4 months ago
Algebraic Immunity of S-Boxes and Augmented Functions
Simon Fischer 0002, Willi Meier
FSE
2007
Springer
140views Cryptology» more  FSE 2007»
12 years 4 months ago
An Analytical Model for Time-Driven Cache Attacks
Kris Tiri, Onur Aciiçmez, Michael Neve, Fle...
FSE
2007
Springer
192views Cryptology» more  FSE 2007»
12 years 4 months ago
Algebraic Cryptanalysis of 58-Round SHA-1
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article5 is to sophisticate and improve Wang’s attack by using algebraic tech...
Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, Hi...
FSE
2007
Springer
152views Cryptology» more  FSE 2007»
12 years 4 months ago
The 128-Bit Blockcipher CLEFIA (Extended Abstract)
Taizo Shirai, Kyoji Shibutani, Toru Akishita, Shih...
FSE
2007
Springer
104views Cryptology» more  FSE 2007»
12 years 4 months ago
Security Analysis of Constructions Combining FIL Random Oracles
Yannick Seurin, Thomas Peyrin
FSE
2007
Springer
144views Cryptology» more  FSE 2007»
12 years 4 months ago
New Message Difference for MD4
Yu Sasaki, Lei Wang, Kazuo Ohta, Noboru Kunihiro
FSE
2007
Springer
104views Cryptology» more  FSE 2007»
12 years 4 months ago
How to Enrich the Message Space of a Cipher
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
Thomas Ristenpart, Phillip Rogaway
FSE
2007
Springer
114views Cryptology» more  FSE 2007»
12 years 4 months ago
Cryptanalysis of Achterbahn-128/80
María Naya-Plasencia
books