scispace - formally typeset
Open AccessProceedings Article

The MD5 Message-Digest Algorithm

Ronald L. Rivest
- Vol. 1321, pp 1-21
Reads0
Chats0
TLDR
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.
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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Remus: a security-enhanced operating system

TL;DR: An effective mechanism is proposed to control the invocation of critical, from the security viewpoint, system calls by instrumenting the code of the system calls in such a way that the execution is granted only in the case where the invoking process and the value of the arguments comply with the rules held in an access control database.
Proceedings ArticleDOI

A configurable and extensible transport protocol

TL;DR: The design and implementation of a configurable transport protocol called CTP is presented, which allows customization of a number of properties including reliable transmission, congestion detection and control, jitter control, and message ordering.
Journal ArticleDOI

Securing the Internet routing infrastructure

TL;DR: This article surveys the up-to-date secure routing schemes.
Proceedings ArticleDOI

StegFS: a steganographic file system

TL;DR: StegFS securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence, even if the attacker is thoroughly familiar with the implementation of the file system and has gained full access to it.

Hash functions: Theory, attacks, and applications

TL;DR: In this paper, the authors survey theory and applications of cryptographic hash functions, especially their resistance to collision-finding attacks, and discuss generic attacks, attacks on iterative hash functions and recent attacks on specific functions.