[2047] in cryptography@c2.net mail archive

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

RSA Conference: Apple Crypto

daemon@ATHENA.MIT.EDU (Steve Schear)
Fri Jan 16 10:42:14 1998

In-Reply-To: <v03007806b0e4452eba6f@[168.161.105.216]>
Date: Fri, 16 Jan 1998 00:03:29 -0800
To: cryptography@c2.net
From: Steve Schear <schear@lvdi.net>

Although Apple Computer isn't known for its pursuits of leading-edge=
 cryptography, Dr. Richard Crandall, Chief Cryptographer, presented three=
 approaches being considered by Apple: Fast Elliptic Encryption (FEE),=
 CHAotic-Dynamical encryption (CHAD) and Compryption or holisitic=
 (single-pass) compress/encrypt algorithm.

1. Apple claims to own U.S. patents on three significant FEE algorithms:=
 5159632. 5463690 and 5581616.  Crandall claims FEE is one of the fastest=
 possible ECC algorithms for signature (ECDSA or ElGamel), embedding of=
 plaintext (FEED) and curve-order calculation.

2. CHAD uses the computational complexity of the n-body classical physics. =
 The  claim is that the sensitivity of a final chaotic dynamical state to=
 its initial conditions may serve as a problem in the same difficulty range=
 as factoring or descrete-log.  This area has received some attention in the=
 past few years (I believe including by the U.S. Navy) See also http://www.e=
fd.lth.se/~d92ms/chaoscrypt.html

3. Comcryption, Crandall claims, is based on a new discovery that there=
 exist "galaxies" of reasonably efficient entropy compressors, which can be=
 selected by an n-bit key to yield a lossless, single-pass Comcryptor.

(As an aside, in 1989-1990 a mathematician and I unsucessfully attempted to=
 losslessly compress/encrypt images by finding the longest matching runs of=
 input data against the output sequences of pseudo-random generators=
 conditioned to favor the correlation values of the image portion under=
 consideration (called this a White Hole algorithm.)  To improve coding=
 efficiency I used a Hilbert space-filling curve to transform the image to a=
 one dimensional string while preserving the two dimensional image=
 correlation characteristics. Output of the compressor would be the=
 correlation coefficient, seed, displacement and run length values for the=
 generator. Anybody care to take up where I left off?)

--Steve


PGP mail preferred, see  	http://www.pgp.com and
				http://web.mit.edu/network/pgp.html

RSA fingerprint: FE90 1A95 9DEA 8D61  812E CCA9 A44A FBA9
RSA key: http://keys.pgp.com:11371/pks/lookup?op=3Dindex&search=3D0x55C78B0D
---------------------------------------------------------------------
Steve Schear              | tel: (702) 658-2654
CEO                       | fax: (702) 658-2673
=46irst ECache Corporation  |
7075 West Gowan Road      |
Suite 2148                |
Las Vegas, NV 89129       | Internet: schear@lvdi.net
---------------------------------------------------------------------

	I know not what course others may take; but as for me,=20
	give me ECache or give me debt!

	"It's your Cache=81"



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