Open AccessProceedings Article
The MD5 Message-Digest Algorithm
Ronald L. Rivest
- 01 Apr 1992
- Vol. 1321, pp 1-21
TL;DR: This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.
read more
Abstract: This document describes the MD5 message-digest algorithm. The
algorithm takes as input a message of arbitrary length and produces as
output a 128-bit "fingerprint" or "message digest" of the input. This
memo provides information for the Internet community. It does not
specify an Internet standard.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
VSEARCH: a versatile open source tool for metagenomics
Torbjørn Rognes,Torbjørn Rognes,Tomas Flouri,Tomas Flouri,Ben Nichols,Christopher Quince,Christopher Quince,Frédéric Mahé +7 more
TL;DR: VSEARCH is here shown to be more accurate than USEARCH when performing searching, clustering, chimera detection and subsampling, while on a par with US EARCH for paired-ends read merging and dereplication.
RTP: A Transport Protocol for Real-Time Applications
Henning Schulzrinne,S. Casner,R. Frederick,Van Jacobson +3 more
- 01 Jul 2003
TL;DR: RTP provides end-to-end network transport functions suitable for applications transmitting real-time data over multicast or unicast network services and is augmented by a control protocol (RTCP) to allow monitoring of the data delivery in a manner scalable to large multicast networks.
The vision of autonomic computing
TL;DR: A 2001 IBM manifesto noted the almost impossible difficulty of managing current and planned computing systems, which require integrating several heterogeneous environments into corporate-wide computing systems that extend into the Internet.
7.2K
The Design and Implementation of FFTW3
Matteo Frigo,Steven G. Johnson +1 more
- 24 Jan 2005
TL;DR: It is shown that such an approach can yield an implementation of the discrete Fourier transform that is competitive with hand-optimized libraries, and the software structure that makes the current FFTW3 version flexible and adaptive is described.
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
- 01 Dec 1993
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
5.7K
References
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
A design principle for hash functions
Ivan Damgård
- 01 Jul 1989
TL;DR: Apart from suggesting a generally sound design principle for hash functions, the results give a unified view of several apparently unrelated constructions of hash functions proposed earlier, and suggests changes to other proposed constructions to make a proof of security potentially easier.
Pseudo-random generation from one-way functions
Russell Impagliazzo,Leonid A. Levin,Michael Luby +2 more
- 01 Feb 1989
TL;DR: From one-way functions of type (1) or (2) it is shown how to construct pseudo-random generators secure against small circuits or fast algorithms, respectively, and vice-versa.
935
One-way functions are necessary and sufficient for secure signatures
J. Rompel
- 01 Apr 1990
TL;DR: This paper is interested in signature schemes which are secure agMnst existential forgery under adaptive chosen message attacks, and the existence of trapdoor permutations can be shown to be necessary and sufficient for secure encryption schemes.
One-way hash functions
Bruce Schneier
- 01 Sep 1991
TL;DR: Sometimes what the authors also need is collision resistance: it is hard to find two random messages M and M1 such that H(M)=H(M1) this is called birthday attack and is based on a birthday paradox.
318