[13166] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: The Pure Crypto Project's Hash Function

daemon@ATHENA.MIT.EDU (Rich Salz)
Sat May 3 12:40:31 2003

X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Sat, 3 May 2003 07:33:39 -0400 (EDT)
From: Rich Salz <rsalz@datapower.com>
To: Ralf Senderek <ralf@senderek.de>
Cc: "cryptography@metzdowd.com" <cryptography@metzdowd.com>
In-Reply-To: <Pine.LNX.4.31.0305021939530.1990-100000@safe.senderek.de>

> The project's intention is to provide
> encryption and signing with the smallest amount of readable
> code possible using only one basic crypto primitive,
> a function ModExp(A,B,C) which calculates A**B mod C.

That seems like a bad design goal.

Isn't it better to have clean implementations of known algorithms that
have been widely understood and studied by the cryptographic community?
Smallest lines of code doesn't imply "most secure."
	/r$



---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com

home help back first fref pref prev next nref lref last post