1997-10-20 - RE: One-Way Functions

Header Data

From: Ian Clysdale <iancly@entrust.com>
To: “‘semprini@theschool.com>
Message Hash: 2370d8436ba6ee705e57ca29502df8adf77cb5cc72f590f2130f54403050ce60
Message ID: <c=CA%a=%p=NorTel_Secure_Ne%l=APOLLO-971020142804Z-3174@mail.entrust.com>
Reply To: _N/A

UTC Datetime: 1997-10-20 14:53:59 UTC
Raw Date: Mon, 20 Oct 1997 22:53:59 +0800

Raw message

From: Ian Clysdale <iancly@entrust.com>
Date: Mon, 20 Oct 1997 22:53:59 +0800
To: "'semprini@theschool.com>
Subject: RE: One-Way Functions
Message-ID: <c=CA%a=_%p=NorTel_Secure_Ne%l=APOLLO-971020142804Z-3174@mail.entrust.com>
MIME-Version: 1.0
Content-Type: text/plain



Yes, there are a number of other one-way functions.  The Diffie-Hellman
algorithm relies on the difficulty in taking logarithms versus finding
an exponent.  Elliptic-curve cryptography relies on some rather
complicated group theory.  Look either of those up to find out some more
information.

If you're interested in learning about this kind of stuff, I HIGHLY
recommend Bruce Schneier's Applied Cryptography.  Another good book is
the Handbook of Applied Cryptography by Paul Van Oorschot, Alfred
Menenzes and Scott Vanstone.

								ian

>----------
>From: 	semprini@theschool.com[SMTP:semprini@theschool.com]
>Sent: 	Monday, October 20, 1997 4:04 AM
>To: 	cypherpunks@toad.com
>Subject: 	One-Way Functions
>
>I've read tons about how DES, PGP, and all of those programs use a 
>one-way function involves the difficulty of factoring out numbers. 
>Are there other one-way functions?
>
>--Dylan
>






Thread