37 search results - page 7 / 8 » fse 2007 |
112
click to vote
ICICS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In a paper published in FSE 2007, a way of obtaining nearcollisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained ex...
116
Voted
INDOCRYPT
2007
Springer
15 years 9 months ago
2007
Springer
We show that a 2112.9 collision attack exists against the FORK-256 Hash Function. The attack is surprisingly simple compared to existing published FORK-256 cryptanalysis work, yet ...
148
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
117
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
113
Voted
CANS
2009
Springer
15 years 10 months ago
2009
Springer
The XSL attack when applied on BES-128 has been shown to have an attack complexity of 2100 , which is faster than exhaustive search. However at FSE 2007, Lim and Khoo analyzed the ...