Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

ASIACRYPT
1992
Springer

favoriteEmaildiscussreport

133views Cryptology» more ASIACRYPT 1992»

On the Power of Memory in the Design of Collision Resistant Hash Functions

13 years 8 months ago

On the Power of Memory in the Design of Collision Resistant Hash Functions

Download www.cosic.esat.kuleuven.be

Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinting". This paper proposes a new efficient class of hash functions based on a block cipher that allows for a tradeoff between security and speed. The principles behind the scheme can be used to optimize similar proposals.

Bart Preneel, René Govaerts, Joos Vandewall

Real-time Traffic

ASIACRYPT 1992 | Cryptology | Digital Signature Schemes | Hash Functions | Resistant Hash Functions |

claim paper

Related Content

» Enhanced Target Collision Resistant Hash Functions Revisited

» How to Build a Hash Function from Any CollisionResistant Function

» Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking

» A FailureFriendly Design Principle for Hash Functions

» Cryptanalysis of Grindahl

» Indexing Internal Memory with Minimal Perfect Hash Functions

» On Building Hash Functions from Multivariate Quadratic Equations

» The Grindahl Hash Functions

» Hash Functions Based on Three Permutations A Generic Security Analysis

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1992
Where	ASIACRYPT
Authors	Bart Preneel, René Govaerts, Joos Vandewalle

Comments (0)