This website does readability filtering of other pages. All styles, scripts, forms and ads are stripped. If you want your website excluded or have other feedback, use this form.

Google Scholar

Loading... The system can't perform the operation now. Try again later.


Advanced search

ArticlesCase lawProfiles My profileMy libraryAlertsMetrics Settings Sign in Sign in ArticlesScholar About 101 results (0.03 sec) My profileMy library

[HTML][HTML] MD4 message digest algorithm

RL Rivest - 1990 - [Docs] [txt|pdf] [IPR] Obsoleted by: 1320 INFORMATIONAL Network Working Group R. Rivest
Request for Comments: 1186 MIT Laboratory for Computer Science October 1990 The MD4
Message Digest Algorithm Status of this Memo This RFC is the specification of the MD4 Digest Cited by 1153 Related articles All 16 versions Cached [PDF]

Cryptanalysis of MD4

H Dobbertin - International Workshop on Fast Software Encryption, 1996 - Springer Abstract In 1990 Rivest introduced the hash function MD4. Two years later RIPEMD, a
European proposal, was designed as a stronger mode of MD4. Recently we have found an
attack against two of three rounds of RIPEMD. As we shall show in the present note, the Cited by 442 Related articles All 33 versions [PDF]

RIPEMD-160: A strengthened version of RIPEMD

H Dobbertin, A Bosselaers, B Preneel - International Workshop on Fast …, 1996 - Springer Abstract Cryptographic hash functions are an important tool in cryptography for applications
such as digital fingerprinting of messages, message authentication, and key derivation.
During the last five years, several fast software hash functions have been proposed; most of Cited by 626 Related articles All 127 versions [HTML]

[HTML][HTML] The MD5 message-digest algorithm

R Rivest - 1992 - [Docs] [txt|pdf] [draft-rsadsi-rive...] [Diff1] [Diff2] [IPR] [Errata] Updated by: 6151 INFORMATIONAL
Errata Exist Network Working Group R. Rivest Request for Comments: 1321 MIT Laboratory for
Computer Science and RSA Data Security, Inc. April 1992 The MD5 Message-Digest Algorithm Cited by 5964 Related articles All 11 versions Cached [PDF]

Collisions for the compression function of MD5

B den Boer, A Bosselaers - Workshop on the Theory and Application of of …, 1993 - Springer Abstract At Crypto'91 Ronald L. Rivest introduced the MD5 Message Digest Algorithm as a
strengthened version of MD4, differing from it on six points. Four changes are due to the two
existing attacks on the two round versions of MD4. The other two changes should Cited by 411 Related articles All 22 versions [PDF]

One way hash functions and DES

RC Merkle - Conference on the Theory and Application of …, 1989 - Springer Abstract One way hash functions are a major tool in cryptography. DES is the best known
and most widely used encryption function in the commercial world today. Generating a one-
way hash function which is secure if DES is a “good” block cipher would therefore be useful. Cited by 1029 Related articles All 9 versions [PDF]

An attack on the last two rounds of MD4

B Den Boer, A Bosselaers - Annual International Cryptology Conference, 1991 - Springer Abstract In [Rive90] the MD4 message digest algorithm was introduced taking an input
message of arbitrary length and producing an output 128-bit message digest. It is
conjectured that it is computationally infeasible to produce two messages having the same Cited by 183 Related articles All 22 versions [PDF]

HAVAL—a one-way hashing algorithm with variable length of output

Y Zheng, J Pieprzyk, J Seberry - International workshop on the theory and …, 1992 - Springer Abstract A one-way hashing algorithm is a deterministic algorithm that compresses an
arbitrary long message into a value of specified length. The output value represents the
fingerprint or digest of the message. A cryptographically useful property of a one-way Cited by 290 Related articles All 51 versions [PDF]

A design principle for hash functions

IB Damgård - Conference on the Theory and Application of …, 1989 - Springer Abstract We show that if there exists a computationally collision free function f from m bits to t
bits where m> t, then there exists a computationally collision free function h mapping
messages of arbitrary polynomial lengths to t-bit strings. Let n be the length of the message. Cited by 1307 Related articles All 11 versions [PDF]

Cryptanalysis of the Hash Functions MD4 and RIPEMD

X Wang, X Lai, D Feng, H Chen, X Yu - … on the theory and applications of …, 2005 - Springer Abstract MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most
of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996,
Dobbertin showed how to find collisions of MD4 with complexity equivalent to 2 20 MD4 Cited by 566 Related articles All 22 versions Previous 1 2 3 4 5 6 7 8 9 10 Next 12345678910 HelpPrivacyTerms