Newsgroups: php.internals
Path: news.php.net
Xref: news.php.net php.internals:33884
Mailing-List: contact internals-help@lists.php.net; run by ezmlm
Received-SPF: pass (pb1.pair.com: domain openwall.com designates 195.42.179.200 as permitted sender)
Date: Sun, 9 Dec 2007 20:49:02 +0300
To: Peter Brodersen <penguin@php.net>
Cc: internals@lists.php.net
Message-ID: <20071209174902.GA14620@openwall.com>
References: <20071209010552.GA12561@openwall.com> <belnl3d9lsh5u3ho2s0vo9l8vha7m0ue43@4ax.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <belnl3d9lsh5u3ho2s0vo9l8vha7m0ue43@4ax.com>
User-Agent: Mutt/1.4.2.3i
Subject: Re: faster & public domain MD5 implementation
From: solar@openwall.com (Solar Designer)

On Sun, Dec 09, 2007 at 12:53:56PM +0100, Peter Brodersen wrote:
> A bit on a side note regarding the php function md5(): In general it
> is possible to supply an arbitrary number of bits as input to MD5.
> However, the implementation of md5() only takes a sting with octets as
> the smallest fragments.
> 
> Would it somehow be possible to supply an input where the number of
> bits does not add up to a number divisible by eight? Or is this
> feature of md5 simply not relevant to anybody?

I don't think there's any demand for this.  Even the reference
implementation only works on whole octets, so there are no protocol
specs or anything (that I am aware of) that would require computation
of MD5 on a bitstream of arbitrary length.

Alexander