[3481] in cryptography@c2.net mail archive

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

Moh on *A New Public Key Encryption System* W4:15 GatesB03

daemon@ATHENA.MIT.EDU (Bill Frantz)
Thu Oct 15 01:52:10 1998

Date: Wed, 14 Oct 1998 21:00:52 -0800
To: cryptography@c2.net
From: Bill Frantz <frantz@netcom.com>

I'm sorry I missed this one.

>Date: Wed, 14 Oct 1998 09:22:54 -0700 (PDT)
>From: ee380 <ee380@shasta.Stanford.EDU>
>Reply-To: ee380 <ee380@shasta.Stanford.EDU>
>To: colloq@cs.stanford.edu
>Subject: Moh on *A New Public Key Encryption System*  W4:15 GatesB03
>Sender: owner-colloq-local-list@lists.Stanford.EDU
>Precedence: bulk
>
>
>
>		EE380 Computer Systems Colloquium
>
>		      Fall Quarter 1998-1999
>
>			  Lecture #4
>
>Date:		Wednesday, Oct 14,1998
>
>Time:		4:15-5:30 pm
>
>Location:	NEC Auditorium (B03)
>		Gates Computer Science Building
>
>SITN:		See SITN Schedule for details...
>
>Internet:	Live on the Net!  See instructions on the Web page
>		http://www-leland.stanford.edu/class/ee380
>  **********************************************************************
>
>Title:          A New Public-Key System with Signature and
>		Master Key
>
>Speaker:	Prof Tzuong-Tsieng Moh
>		Purdue University, Indiana
>
>
>About the talk:
>
>The classical public key systems rely on non-polynomial
>functions of one variable. Higher security and faster speed can
>be achieved by using polynomials of several variables. We will
>demonstrate this phenomenon in this talk.
>
>Let m, n, r, s be positive integers. Let K be a finite field of
>2m elements. Let fs,...,f2, f1 be s tame (equivalently,
>triangular) automorphisms, which are elementary and easily
>computable, of the (n+r)-dimensional affine space Kn+r. Let the
>composition automorphism be g=fs...f2f1.  The automorphism g and
>some of the fi's will be hidden.
>
>Let the restriction of g to the n dimensional subspace
>be g'=(h1,...,hn+r): Kn--> K n+r. The field K and the
>polynomial map (h1,..., hn+r) will be announced as the public
>key.
>
>
>Given a plaintext (x1,...,xn) in Kn, let yi=hi(x1,...,xn), then the
>ciphertext will be (y1,...,yn+r).
>
>
>Given tame automorphisms fi and (y1,...,yn+r), it is easy to find
>fi-1(y1,...,yn+r).  Therefore, the plaintext can be recovered by taking
>(x1,...,xn,0...0) =f1-1f2-1...fs-1( y1,...,yn+r). The private key will
>be the set of map {f1-1,...,fs-1}.
>
>The security of the system rests in part on the difficulty of finding
>the map g from the partial information provided by the map g' and the
>factorization of the map g into a product (i.e., composition) of tame
>automorphisms fi.
>
>No mathematical background beyond high school is required.
>
>About the speaker:
>
>Tzuong-Tsieng Moh is a mathematician working in the fields of
>Algebraic Geometry and Commutative Algebra. He had been
>affiliated with Purdue U, U of Minnesota, Princeton Institute of
>Advanced Study, Harvard U, MSRI (Berkeley) etc.. Lately, he
>finds that it is interesting to work on some real problems in
>the real world. In this talk he will present a fast new
>public-key system which is based on some elementary results of
>high dimensional affine spaces.
>
>
>Contact information:
>T. Moh
>Department of Mathematics, Purdue U, W. Laf., IN 47906
>765-494-1930
>ttm@math.purdue.edu
>
>************************************************************************
>* EE380 is the Computer Systems Laboratory Colloquium.  The Colloquium *
>* meets most Wednesdays throughout the normal academic year. The class *
>* is broadcast over SITN and taped for late viewing in the Engineering *
>* Library.  EE380 is now available live on the Internet!               *
>*                                                                      *
>* For additional information please consult the class web page         *
>*            http://www-leland.stanford.edu/class/ee380                *
>************************************************************************
>
>+----------------------------------------------------------------------------+
>| This message was sent via the Stanford Computer Science Department         |
>| colloquium mailing list.  To be added to this list send an arbitrary       |
>| message to colloq-subscribe@cs.stanford.edu.  To be removed from this list,|
>| send a message to colloq-unsubscribe@cs.stanford.edu. For more information,|
>| send an arbitrary message to colloq-request@cs.stanford.edu. For directions|
>| to Stanford, check out http://www-forum.stanford.edu                       |
>+-------------------------------------------------------------------------xcl+
>

-------------------------------------------------------------------------
Bill Frantz       | Macintosh: Didn't do every-| Periwinkle -- Consulting
(408)356-8506     | thing right, but did know  | 16345 Englewood Ave.
frantz@netcom.com | the century would end.     | Los Gatos, CA 95032, USA



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