From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.org/gmane.linux.lib.musl.general/1641 Path: news.gmane.org!not-for-mail From: Szabolcs Nagy Newsgroups: gmane.linux.lib.musl.general Subject: Re: Help-wanted tasks for musl Date: Sun, 19 Aug 2012 13:49:14 +0200 Message-ID: <20120819114914.GD16602@port70.net> References: <20120819042611.GA8731@brightrain.aerifal.cx> Reply-To: musl@lists.openwall.com NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: ger.gmane.org 1345376968 4001 80.91.229.3 (19 Aug 2012 11:49:28 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Sun, 19 Aug 2012 11:49:28 +0000 (UTC) To: musl@lists.openwall.com Original-X-From: musl-return-1642-gllmg-musl=m.gmane.org@lists.openwall.com Sun Aug 19 13:49:28 2012 Return-path: Envelope-to: gllmg-musl@plane.gmane.org Original-Received: from mother.openwall.net ([195.42.179.200]) by plane.gmane.org with smtp (Exim 4.69) (envelope-from ) id 1T340W-00085x-NL for gllmg-musl@plane.gmane.org; Sun, 19 Aug 2012 13:49:28 +0200 Original-Received: (qmail 12078 invoked by uid 550); 19 Aug 2012 11:49:26 -0000 Mailing-List: contact musl-help@lists.openwall.com; run by ezmlm Precedence: bulk List-Post: List-Help: List-Unsubscribe: List-Subscribe: Original-Received: (qmail 12070 invoked from network); 19 Aug 2012 11:49:26 -0000 Content-Disposition: inline In-Reply-To: <20120819042611.GA8731@brightrain.aerifal.cx> User-Agent: Mutt/1.5.21 (2010-09-15) Xref: news.gmane.org gmane.linux.lib.musl.general:1641 Archived-At: * Rich Felker [2012-08-19 00:26:11 -0400]: > Preparing MD5 and SHA crypt for integration > > See the threads on the list. Basically we need source with appropriate > license status (MIT/BSD/permissive or public domain) that's optimized > for size. > i'm looking into this fun fact: the sha based crypt (the modern one designed in 2007, but it follows the old weird md5 crypt algo) has limits on the rounds but no mention of limits on keys http://www.akkadia.org/drepper/SHA-crypt.txt eventhough step 11. is O(keylen * log(keylen)) step 14. is O(keylen^2) (!) step 16. the reference implementation uses alloca(keylen) (!!) step 21. is O(keylen * rounds) (md5 crypt is O(keylen) with fixed iteration count) and there are alignment optimizations in the reference implementation.. i guess that's some bad joke