Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1+some 2/3/84; site dual.UUCP
Path: utzoo!watmath!clyde!burl!we13!ihnp4!dual!fair
From: fair@dual.UUCP (Erik E. Fair)
Newsgroups: net.crypt
Subject: Re: secure codes
Message-ID: <260@dual.UUCP>
Date: Thu, 9-Feb-84 14:25:25 EST
Article-I.D.: dual.260
Posted: Thu Feb  9 14:25:25 1984
Date-Received: Fri, 10-Feb-84 09:04:24 EST
References: <239@vortex.UUCP>
Organization: Dual Systems, Berkeley, CA
Lines: 30

With regard to one-time encryption systems:  The logistical problems
Lauren cited are no longer relevant.  I am writing this as a founding
member of Cryptex, a new company in the cryptosystems business.
We are soon to release a system called CS-3, which is basically
a one-time cipher.  CS-3 solves most of the problems previously associated
with one-time ciphers.  The only remaining issue concerns key distribution;
CS-3 still requires that key material be distributed via a known-secure
channel such as hand courier.  However, you will find this problem exists
with every other system except public key systems and those just became
obsolete anyway.  The Merkle-Hellman trapdoor knapsack was defeated
by Rivest et. al., and their system (RSA) was defeated by a new advance
in mathematics by a Mr. Arnold in England, who discovered a new way to
factor huge prime numbers extremely rapidly.  Systems other than public
key require key information to be pre-distributed, usually in the form
of "codebooks" containing key seed numbers.   So nothing really changed after
all.  
  In any case, persons interested in finding out more about CS-3, or in
  talking about topics of general interest in cryptology, are invited to
  contact us.  Cryptex, 1442-A Walnut St., #151,; Berkeley, CA, 94709.

	George Gleason
	c/o

	Erik E. Fair

	dual!fair@BERKELEY.ARPA
	{ucbvax,ihnp4,cbosgd,amd70,zehntel,fortune,unisoft,onyx,its}!dual!fair
	Dual Systems Corporation, Berkeley, California

[I will forward Email replies to this article to George - EEF]