Journal ArticleDOI
Some comments on damgard's hashing principle
TLDR
A general principle given by Damgard for constructing hash functions is modified and used to show how the security of block cipher hashing can be improved.Abstract:
A general principle given by Damgard for constructing hash functions is modified and used to show how the security of block cipher hashing can be improved. A small correction to Damgard's work is made.read more
Citations
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Book ChapterDOI
The State of Cryptographic Hash Functions
TL;DR: The state of the art for cryptographic hash functions is described, different definitions are compared, and the few theoretical results on hash functions are discussed.
Book ChapterDOI
The knapsack hash function proposed at Crypto'89 can be broken
Paul Camion,Jacques Patarin +1 more
TL;DR: It is shown that a probabilistic algorithm can break this scheme with a number in the region of 232 computations, which means the proposed hash function is not very secure.
Journal Article
Cryptographic primitives for information authentication - state of the art
TL;DR: The state of the art for cryptographic primitives that are used for protecting the authenticity of information are described: cryptographic hash functions and digital signature schemes; the first class can be divided into Manipulation Detection Codes (MDCs) and Message Authentication Codes (or MACs).
BookDOI
Lectures on Data Security
TL;DR: The objective of this paper is to give an elementary introduction to fundamental concepts, techniques and results of Secure.
References
More filters
Book ChapterDOI
The MD4 Message-Digest Algorithm
TL;DR: The MD4 message digest algorithm takes an input message of arbitrary length and produces an output 128-bit "fingerprint" or "message digest", in such a way that it is (hopefully) computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest.