Sciweavers

92 search results - page 5 / 19
» Compressed Pairings
Sort
View
FSE
2011
Springer
263views Cryptology» more  FSE 2011»
12 years 11 months ago
Practical Near-Collisions on the Compression Function of BMW
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
Gaëtan Leurent, Søren S. Thomsen
AAAI
2000
13 years 8 months ago
Statistics-Based Summarization - Step One: Sentence Compression
When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one...
Kevin Knight, Daniel Marcu
TVLSI
2010
13 years 2 months ago
C-Pack: A High-Performance Microprocessor Cache Compression Algorithm
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
Xi Chen, Lei Yang, Robert P. Dick, Li Shang, Haris...
SACRYPT
2009
Springer
162views Cryptology» more  SACRYPT 2009»
14 years 2 months ago
Practical Pseudo-collisions for Hash Functions ARIRANG-224/384
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
Jian Guo, Krystian Matusiewicz, Lars R. Knudsen, S...
IWSEC
2007
Springer
14 years 1 months ago
How to Find Many Collisions of 3-Pass HAVAL
The hash function HAVAL is an Australian extension of well known Merkle-Damg˚ard hash functions such as MD4 and MD5. It has three variants, 3-, 4- and 5-pass HAVAL. On 3-pass HAVA...
Kazuhiro Suzuki, Kaoru Kurosawa