Sciweavers

658 search results - page 78 / 132
» The Grindahl Hash Functions
Sort
View
BLISS
2009
IEEE
14 years 11 months ago
Autonomous Physical Secret Functions and Clone-Resistant Identification
Self configuring VLSI technology architectures offer a new environment for creating novel security functions. Two such functions for physical security architectures are proposed t...
Wael Adi
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 4 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
15 years 3 months ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum
ACSC
2001
IEEE
15 years 1 months ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
14 years 11 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin