Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!ceres.physics.uiowa.edu!iowasp.physics.uiowa.edu!ns-mx!umaxc.weeg.uiowa.edu!drenze Newsgroups: comp.compression Subject: Re: public key encryption Message-ID: <5119@ns-mx.uiowa.edu> From: drenze@umaxc.weeg.uiowa.edu (Douglas Renze) Date: 29 Mar 91 15:54:40 GMT Reply-To: drenze@umaxc.weeg.uiowa.edu (Douglas Renze) Sender: news@ns-mx.uiowa.edu References: Organization: U of Iowa, Iowa City, IA Lines: 41 In article schultz@halley.est.3m.com (John C. Schultz) writes: >I am looking for a technique of implementing a digital signature. >One technique I am aware of is called public key encryption as in >"A Method for Obtaining Digital Signatures and Public Key Crypto Systems", >Comm. ACM, 21, 2, Feb 1978. > >This is a fairly old article however and I am looking for relevant, more >recent work/references. (Source code would be nice too!) Alternatively, does >anyone know of other, perhaps simpler, techniques for secure digital >signatures. The one drawback that I am aware of with public key encryption is >that the "key" is a very long integer (100 digits?) which makes it rather >difficult to remember. > >Thanks. >-- >John C. Schultz EMAIL: schultz@halley.serc.3m.com >3M Company, Building 518-01-1 WRK: +1 (612) 733-4047 >1865 Woodlane Drive, Dock 4, Woodbury, MN 55125 > How to include the taste of Glendronach in a multi-media system? I, too, am interested in this article--I've been trying to get ahold of it for about a year, but my U's libraries don't have it, and MIT (where it was supposed to have come from) was no help. If somebody can point me to the article (or send me a copy of it if you have time to scan it in--please???) or some sample source, I'd be much obliged. Also I would add to John's description of the algorithm for those who might be interested. If my understanding of it is correct, it is based upon a combination of a unique "trap-door" function and its complementary function, as well as an extremely long prime number. My understanding is that it's not *quite* as secure as the DES encryption algorithm, but when you're talking mere centuries of CPU time to break it rather than millenia (OK...so maybe that's an exaggeration ;) I don't quite see that it makes much of a difference. Thanx in advance for any help you might be able to provide. Peace and Long Life, Doug internet: drenze@umaxc.weeg.uiowa.edu Delphi: drenze