[14757] in cryptography@c2.net mail archive
RE: Are there...one-way encryption algorithms
daemon@ATHENA.MIT.EDU (Amir Herzberg)
Sun Nov 16 15:50:57 2003
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Reply-To: <amir@herzberg.name>
From: "Amir Herzberg" <inbox@amir.herzberg.name>
To: "'Enzo Michelangeli'" <em@em.no-ip.com>,
<cryptography@metzdowd.com>
Date: Sun, 16 Nov 2003 16:44:39 +0200
In-Reply-To: <01d001c3a98e$b60a89e0$0200a8c0@em.noip.com>
Enzo asked,
> Are there one-way encryption algorithms guaranteed to be injective
> (i.e., deterministically collision-free)? Or are there
> theoretical reasons against their existence?
>
> I'm looking for algorithms where every piece of code and data
> is public, thus excluding conventional enciphering with a secret key.
Sounds like you look for One Way Permutations... which of course exist
(if one-way functions do). But before we get into details, it'll be
useful if you specify your needs more precisely since imprecision is the
mother of weaknesses and break-ins.
BTW I've updated my foils on encryption and hashing which cover much of
this topic (see in site if interested).
Best, Amir Herzberg
http://amir.herzberg.name
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
