102
Voted
PAIRING
2007
Springer
15 years 9 months ago
2007
Springer
102
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
93
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
132
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
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...
93
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
97
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
114
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
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...
117
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
FSE
2007
Springer
15 years 9 months ago
2007
Springer
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2 /2n , where n is the block size in bits ...