713 search results - page 59 / 143 » Dispersing Hash Functions |
CVRMED
1997
Springer
15 years 1 months ago
1997
Springer
Recently the entropy-similarity measure has been introduced for the registration of image pairs prior to subtraction in medical imaging e.g. digital subtraction angiography (DSA). ...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
FSE
2010
Springer
15 years 2 months ago
2010
Springer
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
FSE
2008
Springer
14 years 11 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
IEICET
2008
14 years 9 months ago
2008
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with a...