December 2003 - cypherpunks-legacy

FWD: Re: David Sternlight's Slurs About Folks With "2.3a" Keys
by Black Unicorn 17 Dec '03

17 Dec '03

In article <evidenceCq3902.BGF(a)netcom.com> you write: >David Sternlight (strnlght(a)netcom.com) wrote: >: In article <199405191106.FAA01087(a)spot.colorado.edu>, >: Richard Johnson <alt.fan.david-sternlight.usenet(a)decwrl.dec.com> wrote: > >: By publishing a private e-mail, both beker and Johnson are in violation of >: my copyright in that message, since it was a private communication and no >: permission was given to republish. > >Actually, David, since you did not register your copyrighted material >with the U.S. Copyright Office before the alleged infringement (I don't >know for sure that you actually authored that work, and you can't prove >that you did because you didn't sign it using *pgp*!!!), you are limited >to recovering your actual damages (such as lost profits), which in my >estimation would be zero...... Moreover, the re-print here is probably >justified as fair use for purposes of comment and criticism... which is >exactly what seems to be occuring here. > >Anyway, you have a difficult burden of establishing that the document >that you claim to be yours is actually yours, as any number of other >people could also claim to have written it. > >Its a funny thing about the net... You can't be sure who wrote what... > >By the way, in your letter, you claim that you discovered a PGP key from >version 2.3a.... Now, how do you know that this was a PGP key? DId you >run it through PGP to verify that it was? Or are you just assuming that, >because it looks like a PGP public key, that it is??? > >: Thus beker has now committed a new violation of his netcom agreement, and >: Johnson shows he has bad judgement. What's more, by trying to make what >: should be a private matter, to be decided by netcom based on their own >: rules, into a public cause celebre, and by writing to netcom as Johnson did >: to intervene in a private matter, he has made the situation worse for beker, >: not better. > >We shall see... > >: Netcom is perfectly capable of telling me to go peddle my papers if I'm >: wrong. > >Please let us know when they do that, David. > > >-- >------------------------------------------------------------------------- >Evidence, Inc. | The Internet Cops are watching, >Evidence(a)Nowhere.Nil | aren't they? >------------------------------------------------------------------------- >"Have you ever had your phones tapped by the government? YOU WILL and >the company that'll bring it to you..... AT&T" >------------------------------------------------------------------------- > -- 073BB885A786F666 nemo repente fuit turpissimus - potestas scientiae in usu est 6E6D4506F6EDBC17 quaere verum ad infinitum, loquitur sub rosa - wichtig!

1 0

Re: Patent infringement (fwd)
by gtoal＠an-teallach.com 17 Dec '03

17 Dec '03

: This is the argument Schiller's message on 2.6 foreshadowed. However, : there are some counterarguments you can make: : - It's not clear that RSADSI has actually said that merely posting a key with : the words "Version: 2.3a" in and of itself constitutes inducement or : conspiracy to infringe the patent. Schiller speculated that running a key : server which accepted pre-2.4 keys could represent contributory infringement : but I haven't seen any statements from Bidzos that agree with this, let : alone the stronger statement Sternlight is making. Excuse me folks - I think we're missing a big point here: there's no such crime as 'conspiracy to infringe' nor is it a civil offense. What PKP are talking about is agrravated damages - *if* you are *breaking* one of their patents, eg by *running* pgp, then because you are encouraging others to do so by, say, also offering a keyserver service, they can ask for larger damages because they'll say you're *flagrantly* violating their patent and encouraging others to do so. However, if you're *not* violating their patent, there's nothing they can do about the 'encouraging others to do so' part. Running a keyserver, as long as it doesn't run pgp to do its key management, is not infringing PKP's patents, and they can't do anything about it - it's a question of publishing and free speech. It's not even the more restricted commercial speech - keyservers aren't a business. I think if you read the MIT announcements closely you'll see what they say is compatible with this view. G

1 0

other stuff David Sternlight has posted
by Tom Allard 17 Dec '03

17 Dec '03

Favorite posts from David Sternlight: ------- Forwarded Message Newsgroups: sci.crypt Date: Sun, 08 May 94 05:34:13 -0400 From: strnlght(a)netcom.com (David Sternlight) Subject: Re: Someone Get The Classified Docs and Post Them Please! [...] Something did snap, and it did so with the death of Richard Nixon. On thinking of his achievements, and the way he was savagely hounded by the left all his life (not without cause, but not deserving of the extreme demonizing he got), I decided it was time to stop pussy-footing around here, and start calling jerks, cowards, hoodlums, and defamers for what they were. [...] David ------- End of Forwarded Message

1 0

Re: Restoring the list membership
by gtoal＠an-teallach.com 17 Dec '03

17 Dec '03

: I'll wait for two days in case anyone on this list has strong objections to : returning the membership to status quo ante. If not, I'll send the form letter. I think it was an excellent opportunity to cull the dead wood. How about instead of resubbing all 500+, you just send them all a mail telling them what happened and how to resub. That way we only get the interested ones back... G

3 2

Sternlight, period.
by Bill Garland 17 Dec '03

17 Dec '03

I don't know about the rest of you, but there is more than enough Sternlight shit on t.p.crypto and a.s.pgp for my taste. At least on newsgroups I can use Kill files, but cypherpunks is mail. Cypherpunks write code. Sternlight is not code. Cryptography is all economics. Sternlight is not economical. Time is the stuff life is made of. Sternlight is a waste of time. Those of you who want to read t.p.crypto, please do. If it is relative to cypherpunks, okay, crosspost or cc, but with so bloody much mail, I'd rather not have my time wasted by Sternlight stuff. At least with Extropians mail, I could do a ::exclude, but here we are defenseless, and the noise level is already high enough what with Detweiller on the way into manic phase again, even if only tmp'orarily...any chance Cypherpunks will ever get this? Just grumbling... have a nice weekend... Hey, it's finally spring here! Our first long weekend and traditional start of summer - Victoria Day. "It's the twenty-fourth of May And I've got to get away..." -Buddy Wassiname and the Other Fellow ObCrypto: Thanks for the explanations of D-H key exchange. /----------------------------------------------------------------------\ | I am an Extropian. | Macronic Systems, Inc. offers Ideas for Sale ! | | BEST: DO_IT_SO ! | Go for it : Pledge a Digital US Dollar now. | | CryptoAnarchist. | Send PGP key for more information. | | Cypherpunk. | Get in on the ground floor. Invest Now. Trust me! | | Owner : MSInc., |---------------------------------------------------| | HEx, INFO_Banque | Day Job : Bill Garland = bill(a)kean.ucs.mun.ca | \__________________________________o o_________________________________/

1 0

Is crypto cash patented?
by jamesd＠netcom.com 17 Dec '03

17 Dec '03

We can now legally us freely redistributable RSA code, subject to certain restrictions, inside and outside the US. This was never a problem for users but it was big problem for writers. Mosaic will include PGP in the fall, providing a user friendly interface to PGP. One problem remains. I seem to recall that token based crypto cash has been patented. Does anyone have any comments or knowledge on the status of these patents and their relevance to magic money. If you are going to say magic money is illegal everywhere it might be preferable to mail me directly rather than to state it on the list. -- --------------------------------------------------------------------- | We have the right to defend ourselves and our James A. Donald | property, because of the kind of animals that we | are. True law derives from this right, not from jamesd(a)netcom.com | the arbitrary power of the omnipotent state.

2 1

Wow, intelligent remailer
by danisch＠ira.uka.de 17 Dec '03

17 Dec '03

Wow, what an intelligent remailer: I sent a ping to remail(a)hacktic.nl and he answered "PONG" Did they employ a human to do the remailing job? (The Netherlands, you know...) Hadmut

2 1

Ignore This Message
by mpd1＠ix.netcom.com 17 Dec '03

17 Dec '03

Test Message.

1 0

Re: Is crypto cash patented?
by pcw＠access.digex.net 17 Dec '03

17 Dec '03

>The blind signature algorithm is patented by David Chaum. > >Eric I'm also told that Citibank is processing a patent for a form of digital cash that was, for most intents and purposes, anonymous. The patent is still in process, which means you can find out what's in it. But I'm told that they filed it in Europe more than 1.5 years ago, which means it should be open to public inspection. I wish I knew more. If anyone knows how to fish it out of the bureaucracy, I would like to hear more.

1 0

Re: Sternlight, Period.
by Bill Garland 17 Dec '03

17 Dec '03

Many thanks to Cypherpunks who told me how to filter mail on Unix. I will have to learn unix sooner or later, I guess... I am on VMS here, and I guess I could have my c/p mail gatewayed if I wanted to, and then use the news reader. Or recently our system manager installed Pine, so maybe I could use that. Still, I could read t.p.crypto too, when I want to, if I want to. I hope to get a unix machine to play with very soon, with its own Internet address - even if it's only a 286 box with linux. We may also get an alpha box sometime this year, and it may run unix or open-vms. I'll have more control over these machines than I do over our vax cluster. My own news feed and mail address - I will then be able to (1) run a remailer and (2) run a reputation market (3) do some digital cash experiments (4) gateway mail wherever and whenever I want and (5) set up ftp site/www/home page stuff, start using secure mosaic, and (6) write some code. Meanwhile, since I do have a MicroVax at my disposal, - and I should know the answer to this - can I run PGP on VMS? I don't want to rely on a timesharing machine to hold my INFO_Banque keys, for example, but to do some other stuff. Are all the cypherpunk remailers unix scripts? Our connection to the outside world was recently upgraded to T1 from 56K, so there is room for more traffic and I wouldn't mind running a remailer. However, in the longer term I will get my own commercial site on the telephone company's brand new fiber optic cable to the mainland - it will no doubt be better than T1. /----------------------------------------------------------------------\ | I am an Extropian. | Macronic Systems, Inc. offers Ideas for Sale ! | | BEST: DO_IT_SO ! | Go for it : Pledge a Digital US Dollar now. | | CryptoAnarchist. | Send PGP key for more information. | | Cypherpunk. | Get in on the ground floor. Invest Now. Trust me! | | Owner : MSInc., |---------------------------------------------------| | HEx, INFO_Banque | Day Job : Bill Garland = bill(a)kean.ucs.mun.ca | \__________________________________o o_________________________________/

1 0

FAQ: Where to get PGP latest version
by mpj＠netcom.com 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- WHERE TO GET THE PRETTY GOOD PRIVACY PROGRAM (PGP) (Last modified: 20 May 1994 by Mike Johnson) WHAT IS THE LATEST VERSION? Platforms | Released | Version | Notes & restrictions | by | | Other restrictions may apply. - ----------------------------------------------------------------------------- Dos & Unix | MIT | 2.5 | Uses RSAREF 2.0. Not for use in any | | BETA | application that you get paid for. | | | Patents licensed for personal use only. | | | Not for export from the USA or Canada. - ----------------------------------------------------------------------------- DOS & Unix | Viacrypt | 2.4 | Legal for both personal and | | | commercial use. Not for export from | | | the USA and Canada. - ----------------------------------------------------------------------------- Amiga | | 2.3a2 | Use extremely limited by patents in USA. - ----------------------------------------------------------------------------- Macintosh | | 2.3aV1.2 | Source code retained by | | | Christoph_Pagalies(a)hh2.maus.de | | | Use extremely limited by patents in USA. - ----------------------------------------------------------------------------- Macintosh | | 2.3 | Use extremely limited by patents in USA. - ----------------------------------------------------------------------------- All others | Peter | 2.3a | Use extremely limited by patents in USA. | Gutman | | This is the current version of choice | | | outside of the USA. - ----------------------------------------------------------------------------- WHERE CAN I GET VIACRYPT PGP? If you are a commercial user of PGP in the USA or Canada, contact Viacrypt in Phoenix, Arizona, USA. The commecial version of PGP is fully licensed to use the patented RSA and IDEA encryption algorithms in commercial applications, and may be used in corporate environments in the USA and Canada. It is fully compatible with, functionally the same as, and just as strong as the freeware version of PGP. Due to limitations on ViaCrypt's RSA distribution license, ViaCrypt only distributes executable code and documentation for it, but they are working on making PGP available for a variety of platforms. Call or write to them for the latest information. The latest version number for their version of PGP is 2.4. Viacrypt's licensing and price information is as follows: ViaCrypt PGP for MS-DOS 1 user $ 99.98 ViaCrypt PGP for MS-DOS 5 users $ 299.98 ViaCrypt PGP for MS-DOS 20 users or more, call ViaCrypt ViaCrypt PGP for UNIX 1 user $ 149.98 ViaCrypt PGP for UNIX 5 users $ 449.98 ViaCrypt PGP for UNIX 20 users or more, call ViaCrypt ViaCrypt PGP for WinCIM/CSNav 1 user $ 119.98 ViaCrypt PGP for WinCIM/CSNav 5 user $ 359.98 ViaCrypt PGP for WinCIM/CSNav 20 users or more, call ViaCrypt If you wish to place an order please call 800-536-2664 during the hours of 8:30am to 5:00pm MST, Monday - Friday. They accept VISA, MasterCard, AMEX and Discover credit cards. If you have further questions, please feel free to contact: Paul E. Uhlhorn Director of Marketing, ViaCrypt Products Mail: 2104 W. Peoria Ave Phoenix AZ 85029 Phone: (602) 944-0773 Fax: (602) 943-2601 Internet: viacrypt(a)acm.org Compuserve: 70304.41 WHERE CAN I GET THE PGP FROM MIT THAT USES RSAREF? MIT-PGP is for U. S. use only (due to some archaic export control laws), but interoperates with PGP 2.3 and 2.3a. This is the right version to use if you want to use it for personal (not for services you get paid for) electronic mail privacy in the USA and Canada. Version 2.5 interoperates with the other PGP 2.x products, but MIT is working on a version 2.6 that produces messages that version 2.3a cannot read to encourage USA users to stop using PGP 2.3, which could infringe on RSADSI's patents when used in certain ways. I don't know, yet if they will make any attempt to interoperate fully with the 100% legal (in the USA and Canada) Viacrypt PGP 2.4. MIT has stopped distributing version 2.5 to prepare for the release of 2.6. When 2.6 comes out, this following procedure MIGHT work: 1. Read ftp://net-dist.mit.edu/pub/PGP/license.txt and agree to it. 2. Telnet to net-dist.mit.edu and log in as getpgp. 3. Answer the question and write down the directory name listed. 4. QUICKLY end the telnet session with ^C and ftp to the indicated directory on net-dist.mit.edu (something like /pub/PGP/dist/U.S.-only-????) and get the distribution files (pgp26.zip, pgp26doc.zip, and pgp26src.tar). If the hidden directory name is invalid, start over at step 2, above. You can get PGP 2.5 from: csn.org/mpj ftp://csn.org/mpj/I_will_not_export/crypto_???????/pgp/pgp25.zip ftp://csn.org/mpj/I_will_not_export/crypto_???????/pgp/pgp25src.tar See ftp://csn.org/mpj/README.MPJ for the ??????? See ftp://csn.org/mpj/help for more help on negotiating this site's export control methods. ftp.netcom.com/pub/mpj ftp://ftp.netcom.com/mpj//I_will_not_export/crypto_???????/pgp/pgp25.zip ftp://ftp.netcom.com/mpj//I_will_not_export/crypto_???????/pgp/pgp25src.tar See ftp://ftp.netcom.com/pub/mpj/README.MPJ for the ??????? See ftp://ftp.netcom.com/pub/mpj/help for more help on negotiating this site's export control methods. TO GET THESE FILES BY EMAIL, send mail to ftp-request(a)netcom.com containing the word HELP in the body of the message for instructions. You will have to work quickly to get README.MPJ then the files before the ??????? part of the path name changes again (several times a day). ftp.eff.org Follow the instructions found in README.Dist that you get from one of: ftp://ftp.eff.org/pub/Net_info/Tools/Crypto/README.Dist gopher.eff.org, 1/Net_info/Tools/Crypto gopher://gopher.eff.org/11/Net_info/Tools/Crypto http://www.eff.org/pub/Net_info/Tools/Crypto/ Colorado Catacombs BBS Mike Johnson, sysop Mac and DOS versions of PGP, PGP shells, and some other crypto stuff. Also the home of some good Bible search files and some shareware written by Mike Johnson, including DLOCK, CRYPTA, CRYPTE, CRYPTMPJ, MCP, MDIR, DELETE, PROVERB, SPLIT, ONEPAD, etc. v.FAST/v.32bis/v.42bis, speeds up to 28,800 bps 8 data bits, 1 stop, no parity, as fast as your modem will go. Use ANSI terminal emulation, of if you can't, try VT-100. Free access to PGP. If busy or no answer, try again later. Log in with your own name, or if someone else already used that, try a variation on your name or pseudonym. You can request access to crypto software on line, and if you qualify legally under the ITAR, you can download on the first call. Download file names: pgp25.zip (DOS version with documentation) pgp25src.tar (Unix version and source code) pgp25doc.zip (Documentation only -- exportable) (303) 772-1062 Longmont, Colorado number - 2 lines. (303) 938-9654 Boulder, Colorado number forwarded to Longmont number intended for use by people in the Denver, Colorado area. Verified: This morning. Other BBS and ftp sites will no doubt pick it up rapidly after the beta test is completed. Please send bug reports concerning PGP 2.5 BETA to pgp-bugs(a)mit.edu. If you obtain a copy of this beta release code, please keep checking http://web.mit.edu for the announcement of the final release, so that you can update your copy of PGP. WHERE TO GET PGP 2.3a (RELEASED FROM NEW ZEALAND) The freeware version of PGP is intended for noncommercial, experimental, and scholarly use. It is available on thousands of BBSes, commercial information services, and Internet anonymous-ftp archive sites on the planet called Earth. This list cannot be comprehensive, but it should give you plenty of pointers to places to find PGP. Although the latest freeware version of PGP was released from outside the USA (New Zealand), it is not supposed to be exported from the USA under a strange law called the International Traffic in Arms Regulations (ITAR). Because of this, please get PGP from a site outside the USA if you are outside of the USA. This data is subject to change without notice. If you find that PGP has been removed from any of these sites, please let me know so that I can update this list. Likewise, if you find PGP on a good site elsewhere (especially on any BBS that allows first time callers to access PGP for free), please let me know so that I can update this list. Thanks to Gary Edstrom and Hugh Miller for providing part of this data. FTP sites: ftp.ee.und.ac.za /pub/crypto/pgp soda.berkeley.edu /pub/cypherpunks/pgp (DOS, MAC) Verified: 21-Dec-93 ftp.demon.co.uk /pub/amiga/pgp /pub/archimedes /pub/pgp /pub/mac/MacPGP ftp.informatik.tu-muenchen.de ftp.funet.fi ftp.dsi.unimi.it /pub/security ftp.tu-clausthal.de (139.174.2.10) wuarchive.wustl.edu /pub/aminet/util/crypt src.doc.ic.ac.uk (Amiga) /aminet /amiga-boing ftp.informatik.tu-muenchen.de /pub/comp/os/os2/crypt/pgp23os2A.zip (OS/2) black.ox.ac.uk (129.67.1.165) /src/security/pgp23A.zip (MS-DOS executables & docs) /src/security/pgp23srcA.zip (Unix, MS-DOS, VMS, Amiga sources, docs, info on building PGP into mailers, editors, etc.) /src/security/pgp23A.tar.Z (Same as PGP22SRC.ZIP, in Unix tar format) /src/security/macpgp2.3.cpt.hqx (Macintosh version) iswuarchive.wustl.edu pub/aminet/util/crypt (Amiga) csn.org /mpj/README.MPJ contains variable directory name -- read this first. /mpj/help explains how to get to hidden directory containing PGP /mpj/I_will_not_export/crypto_???????/pgp/ contains current PGP /mpj/I_will_not_export/crypto_???????/pgptools/ contains related tools /mpj/I_will_not_export/crypto_???????/ contains other crypto info. /mpj/public/pgp/ contains PGP shells, faq documentation, etc. ftp.netcom.com /pub/dcosenza -- PGP for several platforms + some shells and steganography utilities. /pub/gbe/pgpfaq.asc -- frequently asked questions answered. /pub/mpj (see README.MPJ -- similar layout to csn.org//mpj) /pub/qwerty -- How to MacPGP Guide, largest steganography ftp site as well. PGP FAQ, crypto FAQ, US Crypto Policy FAQ, Steganograpy software list. MacUtilites for use with MacPGP. Stealth1.1 + other steganography programs. Send mail to qwerty(a)netcom.com with the subject "Bomb me!" to get the PGP FAQ and MacPGP guide if you don't have ftp access. nic.funet.fi (128.214.6.100) /pub/crypt/pgp23A.zip /pub/crypt/pgp23srcA.zip /pub/crypt/pgp23A.tar.Z van-bc.wimsey.bc.ca (192.48.234.1) /m/ftp2/crypto/RSA/PGP/2.3a/pgp23A.zip /m/ftp2/crypto/RSA/PGP/2.3a/pgp23srcA.zip ftp.uni-kl.de (131.246.9.95) qiclab.scn.rain.com (147.28.0.97) pc.usl.edu (130.70.40.3) leif.thep.lu.se (130.235.92.55) goya.dit.upm.es (138.4.2.2) tupac-amaru.informatik.rwth-aachen.de (137.226.112.31) ftp.etsu.edu (192.43.199.20) princeton.edu (128.112.228.1) pencil.cs.missouri.edu (128.206.100.207) StealthPGP: The Amiga version can be FTP'ed from the Aminet in /pub/aminet/util/crypt/ as StealthPGP1_0.lha. Also, try an archie search for PGP using the command: archie -s pgp23 (DOS Versions) archie -s pgp2.3 (MAC Versions) ftpmail: For those individuals who do not have access to FTP, but do have access to e-mail, you can get FTP files mailed to you. For information on this service, send a message saying "Help" to ftpmail(a)decwrl.dec.com. You will be sent an instruction sheet on how to use the ftpmail service. Another e-mail service is from nic.funet.fi. Send the following mail message to mailserv(a)nic.funet.fi: ENCODER uuencode SEND pub/crypt/pgp23srcA.zip SEND pub/crypt/pgp23A.zip This will deposit the two zipfiles, as 15 batched messages, in your mailbox with about 24 hours. Save and uudecode. For the ftp sites on netcom, send mail to ftp-request(a)netcom.com containing the word HELP in the body of the message. World Wide Web URLs: (Thanks to mathew(a)mantis.co.uk) UNIX PGP 2.3a Compiles best with GCC 2.4.x or higher. A straight port from DOS, so hardened UNIX users find it a bit chatty. * _UK:_ ftp://ftp.demon.co.uk/pub/pgp/pgp23A.tar.Z * _UK:_ ftp://black.ox.ac.uk/src/security/pgp23A.tar.Z * _NL:_ ftp://svin02.info.win.tue.nl/pub/misc/pgp23A.tar.gz * _SE:_ ftp://ftp.sunet.se/pub/security/tools/crypt/pgp23A.tar.gz * _SE:_ ftp://isy.liu.se/pub/misc/pgp/2.3A/pgp23A.tar.Z * _IT:_ ftp://ghost.dsi.unimi.it/pub/crypt/pgp23A.tar.Z * _FI:_ ftp://ftp.funet.fi/pub/crypt/pgp23A.tar.Z * _FI:_ ftp://ftp.funet.fi/pub/crypt/ghost.dsi.unimi.it/pgp23A.tar.Z * _US:_ ftp://soda.berkeley.edu/pub/cypherpunks/pgp/pgp23A.tar.gz _________________________________________________________________ MS-DOS PGP 2.3 Program * _UK:_ ftp://ftp.demon.co.uk/pub/pgp/pgp23A.zip * _UK:_ ftp://black.ox.ac.uk/src/security/pgp23A.zip * _SE:_ ftp://isy.liu.se/pub/misc/pgp/2.3A/pgp23A.zip * _IT:_ ftp://ghost.dsi.unimi.it/pub/crypt/pgp23A.zip * _FI:_ ftp://ftp.funet.fi/pub/crypt/pgp23A.zip * _IT:_ ftp://ftp.funet.fi/pub/crypt/ghost.dsi.unimi.it/pgp23A.zip * _US:_ ftp://soda.berkeley.edu/pub/cypherpunks/pgp/pgp23A.zip Source code Designed to compile with Turbo C; compiles fine with Microsoft Visual C++ also. * _UK:_ ftp://ftp.demon.co.uk/pub/pgp/pgp23srcA.zip * _UK:_ ftp://black.ox.ac.uk/src/security/pgp23srcA.zip * _SE:_ ftp://isy.liu.se/pub/misc/pgp/2.3A/pgp23srcA.zip * _IT:_ ftp://ghost.dsi.unimi.it/pub/crypt/pgp23srcA.zip * _FI:_ ftp://ftp.funet.fi/pub/crypt/pgp23srcA.zip * _FI:_ ftp://ftp.funet.fi/pub/crypt/ghost.dsi.unimi.it/pgp23srcA.zip * _US:_ ftp://soda.berkeley.edu/pub/cypherpunks/pgp/pgp23srcA.zip _________________________________________________________________ MACPGP 2.3 A slightly souped-up port of PGP to the Mac. Has help menus and other goodies, but is still not a real Mac application. However, it works. Note that the version 2.3 release of MacPGP contains the major bug-fix which was later added to UNIX/DOS PGP 2.3. There was therefore no need for a MacPGP 2.3A release; version 2.3 already had the bug fix by the time it was released. There is no MacPGP 2.3A. Program * _UK:_ ftp://ftp.demon.co.uk/pub/pgp/MacPGP/MacPGP2.3.cpt.hqx * _UK:_ ftp://black.ox.ac.uk/src/security/macpgp2.3.cpt.hqx * _SE:_ ftp://isy.liu.se/pub/misc/pgp/2.3A/macpgp2.3.cpt.hqx * _IT:_ ftp://ghost.dsi.unimi.it/pub/crypt/macpgp2.3.cpt.hqx * _FI:_ ftp://ftp.funet.fi/pub/crypt/ghost.dsi.unimi.it/macpgp2.3.cpt.hqx * _US:_ ftp://soda.berkeley.edu/pub/cypherpunks/pgp/macpgp2.3.cpt.hqx.gz Source code Requires Think C. * _UK:_ ftp://ftp.demon.co.uk/pub/pgp/MacPGP/MacPGP2.2src.sea.hqx -- version 2.2 only * _IT:_ ftp://ghost.dsi.unimi.it/pub/crypt/macpgp2.3src.sea.hqx.pgp * _FI:_ ftp://ftp.funet.fi/pub/crypt/ghost.dsi.unimi.it/macpgp2.3src.sea.h qx.pgp Documentation PGP is rather counter-intuitive to a Mac user. Luckily, there's a guide to using MacPGP in ftp://ftp.netcom.com/pub/qwerty/Here.is.How.to.MacPGP. _________________________________________________________________ OS/2 PGP You can, of course, run the DOS version of PGP under OS/2. Program * _UK:_ ftp://ftp.demon.co.uk/pub/pgp/pgp22os2.zip -- version 2.2 only, native binaries * _DE:_ ftp://ftp.informatik.tu-muenchen.de/pub/comp/os/os2/crypt/pgp23os2 A.zip Source code * _DE:_ ftp://ftp.informatik.tu-muenchen.de/pub/comp/os/os2/crypt/pgp23src A.zip _________________________________________________________________ AMIGA PGP * _UK:_ ftp://ftp.demon.co.uk/pub/amiga/pgp/pgp21ami.lha -- version 2.1 only * _DE:_ ftp://faui43.informatik.uni-erlangen.de/mounts/rzsuna/pub/aminet/u til/crypt/pgp21ami.lha -- version 2.1 only * _DE:_ ftp://ftp.uni-kl.de/pub/aminet/util/crypt/PGPAmi23a_2.lha * _US:_ ftp://ftp.wustl.edu/pub/aminet/util/crypt/PGPAmi23a_2.lha Source * _DE:_ ftp://ftp.uni-kl.de/pub/aminet/util/crypt/PGPAmi23a2_src.lha * _US:_ ftp://ftp.wustl.edu/pub/aminet/util/crypt/PGPAmi23a2_src.lha _________________________________________________________________ ARCHIMEDES PGP * _UK:_ ftp://ftp.demon.co.uk/pub/archimedes/ArcPGP23a _________________________________________________________________ DOCUMENTATION ONLY Want to know more about PGP, but too scared to download the actual program in case the Feds bust down your door? Fetch this. * _UK:_ ftp://ftp.demon.co.uk/pub/pgp/pgp23docA.zip * _US:_ ftp://soda.berkeley.edu/pub/cypherpunks/pgp/pgp23docA.zip _________________________________________________________________ FOREIGN LANGUAGE MODULES These are suitable for most PGP versions. Italian * _IT:_ ftp://ghost.dsi.unimi.it/pub/crypt/pgp-lang.italian.tar.gz * _FI:_ ftp://ftp.funet.fi/pub/crypt/ghost.dsi.unimi.it/pgp-lang.italian.t ar.gz Spanish * _IT:_ ftp://ghost.dsi.unimi.it/pub/crypt/pgp-lang.spanish.tar.gz * _FI:_ ftp://ftp.funet.fi/pub/crypt/ghost.dsi.unimi.it/pgp-lang.spanish.t ar.gz German * _UK:_ ftp://black.ox.ac.uk/src/security/pgp_german.txt Swedish * _UK:_ ftp://black.ox.ac.uk/src/security/pgp_swedish.txt _________________________________________________________________ OTHER SITES Some cryptographic software is available from ftp://van-bc.wimsey.bc.ca/pub/crypto/software/. Read the README file and proceed from there. BBS sites: Colorado Catacombs BBS (See also the entry above for PGP 2.5) (303) 772-1062 Longmont, Colorado (2 lines) (303) 938-9654 Boulder, Colorado Verified: This morning. Hieroglyphics Voodoo Machine (Colorado) DOS, OS2, and Mac versions. (303) 443-2457 Verified: 5-2-94 For free access for PGP, DLOCK, Secure Drive, etc., log in as "VOO DOO" with the password "NEW" (good for 30 minutes access to free files). Exec-Net (New York) Host BBS for the ILink net. (914) 667-4567 The Ferret BBS (North Little Rock, Arkansas) (501) 791-0124 also (501) 791-0125 Carrying RIME, Throbnet, Smartnet, and Usenet Special PGP users account: login name: PGP USER password: PGP This information from: Jim Wenzel <jim.wenzel(a)grapevine.lrk.ar.us> PGP 2.3A has been posted to the FidoNet Software Distribution Network and should on most if not all Canadian and U.S. nodes carrying SDN software. It has also been posted on almost all of the major private North American BBS systems, thence to countless smaller boards. Consult a list of your local BBSes; most with a sizeable file inventory should carry the program. If you find a version of the PGP package on a BBS or FTP site and it does not include the PGP User's Guide, something is wrong. The manual should always be included in the package. If it isn't, the package is suspect and should not be used or distributed. The site you found it on should remove it so that it does no further harm to others. ARCHIE WHO? There are many more sites. You can use archie and/or other "net-surfing" tools to find a more up-to-date listing, if desired. - -----BEGIN PGP PUBLIC KEY BLOCK----- Version: 2.4 mQCNAi0aFSUAAAEEAOCOKpaLepvJCFgIR4m+UvZe0IN8g7Guwc+6GH4u6UGTPxQO iAhk/MJ7E8LE4c55A1G8to2W4y3aKAHvi9QCYKnsLV8Ag0BYWo3bGGTPEfkS7NAI N+Zy6vSjuF1D6MUnbvrQJ5p4efz7a28iYRKoAdan2bfnvIYWUD9nBjyFM+vFAAUR tDdNaWNoYWVsIFBhdWwgSm9obnNvbiA8bXBqQGNzbi5vcmc+IG1wajQgW2V4cCAz MSBEZWMgOTRdiQCVAgUQLTqfXj9nBjyFM+vFAQGU7wP/ZuuHfdAnCIblNCtbLLG8 39CSg6JIVa3KWfe0WIz6dXFU3cvl2Wt094kJgZ+Nmq01INWlib2lTOznbkA9sV1W q0aJSBHFWQH29qGmIdEqThs7A5ES2w8eRjJD80lxHodRIkBcC5KI6x4Mxo8cib5V BrwsvtG0+81HD6Mrpvc+a0GJAJUCBRAtJc2rZXmEuMepZt0BAe4hA/9YANYPY4Z3 1pXv2mT6ReC09cZS5U3+xxC5brQdLsQGKuH6QVs/b5oc6NV84sh8A9tZyHG2067o 3XIEyN7PPQzRm2UUnHHqw9lBCNhMiFQsAJi4W+m8zXrVrpJWK0Wv61eV2/XIQl0V d4lxu0r+MNRP6ID6FBzA4C9rO+RYEZmwOIkAlQIFEC0aGRzb/VZRBVJGuQEBfaUD /3c2h//kg843OIcYHG4gMDqdeeZLzGlp3RVvh0Rs3/T0YylJZGjPL2L/BF/vfLlB 9E2Urh9mDG/7hiB5FncrUnkmN63IkSj+K9YyfPyYxBVx06Srj8ZzYynh0N+zledd 6cnwxRXhaD3Wc4EfSNR7BH9M2rjkGzyb5to9cgBb0ng+ =BLg5 - -----END PGP PUBLIC KEY BLOCK----- I didn't have to generate a new key to use version 2.5, but I think keys should be changed periodically anyway to limit damages just in case a key got compromised and I didn't know about it. - -----BEGIN PGP PUBLIC KEY BLOCK----- Version: 2.5 mQCNAi3P6L4AAAEEAM4qXLLvN7dOVuEOIMjX3AFB8HtsCeYECF428Z1dVSf8OMGr KbTjGpuy0WvkigHm0yZmfmAdS8GkLReFmwv36TbhYYvjRaTou+qFjC9um9j4UPP3 /337HTEvFC+oVtCcqLVn2Xv0tTO/KB4nfbash8tzPZWn0WUfpQ9rDjx3TioRAAUR tCJNaWNoYWVsIFBhdWwgSm9obnNvbiA8bXBqQGNzbi5vcmc+tB1tcGo2IDxtcGpv aG5zb0BueXguY3MuZHUuZWR1PokAlQIFEC3P7AA/ZwY8hTPrxQEBmEoD/RJZure0 ghGjOq2qxYIgrd8xebuFEchOQZwInerWd0izjpIMmfh3zlgkgejUhEfPafwCTYg6 BMdbxjNzYwC8/rq/R4EGR6pTe7dJqhvFfvzzLZyjBarX7lw6TJ2Oyt9oFMSQbGwF /BKqc0Ymr/8EmT+JsEDnypepm41otWMyYFfSiQCVAgUQLc/rww9rDjx3TioRAQF0 igQAkRrmuAmF1QLp1gFRxqMLw+dDzAtUjFpUrpvqN8yDu/TS3Ue/GdvBECFCzbcD jA3gGviXBWfRx4w6KRVpqTSsfJt5IvcrTbYGcscIQWHPzqLiq8iu22+Ao2ImcDUB Lu+Z+Wo2Ok00DnvAnzqjXrffo6Eq2qOoGhBlFfStXUCMvbe0HU1pa2UgSm9obnNv biA8bXBqQG5ldGNvbS5jb20+tDBEb24ndCB1c2UgZm9yIGVuY3J5cHRpb24gYWZ0 ZXIgMzEgRGVjZW1iZXIgMTk5NS60I01pY2hhZWwgSm9obnNvbiA8bWlrZWpAZXhh Ynl0ZS5jb20+tDBNaWNoYWVsIFBhdWwgSm9obnNvbiA8NzEzMzEuMjMzMkBjb21w dXNlcnZlLmNvbT60KU1pY2hhZWwgUC4gSm9obnNvbiA8bS5wLmpvaG5zb25AaWVl ZS5vcmc+ =w6Cu - -----END PGP PUBLIC KEY BLOCK----- ___________________________________________________________ |\ /| | | | | \/ |o| | Michael Paul Johnson Colorado Catacombs BBS 303-772-1062 | | | | / _ | mpj(a)csn.org ftp:csn.org//mpj/README.MPJ for crypto stuff | | |||/ /_\ | aka mpj(a)netcom.com mpjohnson(a)ieee.org mikej(a)exabyte.com | | |||\ ( | m.p.johnso(a)nyx.cs.du.edu CIS 71331,2332 PGP key by finger | | ||| \ \_/ |___________________________________________________________| -----BEGIN PGP SIGNATURE----- Version: 2.4 iQCVAgUBLdz6Wz9nBjyFM+vFAQE52AP/XL+6drZrvFbdAiLKaXN5l7TyLHIITUow aiDWi71T/OmC5C+76nooRHS6U/9Elf2SNz1/fD1opf4wwQ47opNKHXElwluAja3Y IpyT9uBhoQsydnsa25Pafgszv8qMx0t0XxMoMWN/GqOK9tOoNUIlG0Dfl6VqSAxH UGgt2pRVwVU= =x75J -----END PGP SIGNATURE-----

1 0

Re: PGP 2.5--some questions.
by gtoal＠an-teallach.com 17 Dec '03

17 Dec '03

: From: m1tca00(a)newfed.frb.gov (Thomas C. Allard) : > > To respond to the sender of this message, send mail to : > > remailer(a)soda.berkeley.edu, starting your message with : > > the following 7 lines: : > > :: : > > Response-Key: ideaclipper : > : > > ====Encrypted-Sender-Begin==== : > > MI@```$US^P;+]AB?X9TW6\8WR:>P&2'9,7.YM5[D5-D0)[3;\@M3L:625SRF : > > E&M(.3FCF)SX,HK/F!CHPO!/>L.D#Z=4(++Q872W\KAK[:?GOT``` : > > ====Encrypted-Sender-End==== : > : > Thus the NSA just needs to crack the "soda" key in order to get hold : > of a person who knows something about an ITAR infringement. : > : > Is there a way to instruct a cypherpunk remailer to omit the last : > seven lines? : He most likely used a chain of remailers. That's the REASON for : the last seven lines (instead of a simple anonXXXX-type address. : When you send those 7 lines to the soda remailer, it decrypts it : and finds ANOTHER address to send it to. It can do this as many : times as you like. When this feature was put in recently, in response to a suggestion of mine (which I now regret because of...), I intended for each posting to be encrypted with a different randomly-generated key, and for the key to be deleted after being reused on reply. Unfortunately Eric chose not to implement it that way, and although he promised to cycle the keys periodically, he seems not to have done so. I agree with whoever it was above that was in fear of the key being compromised - it *is* a possibility, and that's why I wouldn't use that remailer, if I ever had to use a remailer. G

1 0

Secure RPC?
by danisch＠ira.uka.de 17 Dec '03

17 Dec '03

Hello, where can I get specs and informations about secure RPC? Thanks Hadmut

3 2

RE: Secure RPC?
by p.v.mcmahon.rea0803＠oasis.icl.co.uk 17 Dec '03

17 Dec '03

For ONC RPC, see Internet Draft ietf-draft-oncrpc-rpcv2-00.txt

1 0

public key of Lady Ada ???
by catalyst-remailer＠netcom.com 17 Dec '03

17 Dec '03

Where is the public pgp key of Lady Ada?

1 0

Smithsonian class on cryptography - with the NSA!
by Stanton McCandlish 17 Dec '03

17 Dec '03

Forwarded message: Date: Fri, 20 May 1994 11:24:04 -0400 From: ssteele(a)eff.org (Shari Steele) Subject: Smithsonian class on cryptography Hi all. I am not making this up. In today's Weekend section of the Washington Post, the Smithsonian has a full page ad for its Campus on the Mall. Mixed in with classes called "Ice Cream, Ice Cream: Food for the Gods" and "Learning to Love Opera" is the following: "Intelligence and Cryptology" "The (Berlin) wall is down and the (Iron) curtain is up. This course peers into the world of cryptologic intelligence and information security. With tour of the National Cryptologic Museum at Fort Meade. Cosponsored with the National Security Agency. (Code U323-700) Wed, 6 pm July 6 -- Aug 10 (6 sessions) Members $76; Nonmembers $106" Anyone interested in signing up? Shari -- Stanton McCandlish * mech(a)eff.org * Electronic Frontier Found. OnlineActivist "In a Time/CNN poll of 1,000 Americans conducted last week by Yankelovich Partners, two-thirds said it was more important to protect the privacy of phone calls than to preserve the ability of police to conduct wiretaps. When informed about the Clipper Chip, 80% said they opposed it." - Philip Elmer-Dewitt, "Who Should Keep the Keys", TIME, Mar. 14 1994

1 0

Re: D-H key exchange - how does it work?
by Hal 17 Dec '03

17 Dec '03

From: hughes(a)ah.com (Eric Hughes) > > In addition, changing the modulus can have unpleasant effects on > > traffic analysis, if not done properly. > > Of what sort? > > For D-H, the modulus must be transmitted in the clear. Unless you use > a different modulus for each conversation, there is a persistency to > the moduli that gives rise to a pseudo-identity. I don't follow this. If you never change the modulus (which is what it sounds like Eric was recommending), then isn't there an even greater persistency? Or is it the assumption that everyone uses the same modulus in that case? Hal

2 1

Lady ada's Key
by VACCINIA＠UNCVX1.OIT.UNC.EDU 17 Dec '03

17 Dec '03

From: IN%"anonymous(a)extropia.wimsey.com" 5-MAY-1994 22:31:20.18 To: IN%"cypherpunks(a)toad.com" CC: Subj: Return-path: <owner-cypherpunks(a)toad.com> Received: from relay2.UU.NET by UNCVX1.OIT.UNC.EDU (PMDF V4.3-7 #6908) id <01HBZVPDJ1SG0005GD(a)UNCVX1.OIT.UNC.EDU>; Thu, 5 May 1994 22:31:10 EDT Received: from toad.com by relay2.UU.NET with SMTP (5.61/UUNET-internet-primary) id AAwoqr08382; Thu, 5 May 94 22:25:45 -0400 Received: by toad.com id AA29828; Thu, 5 May 94 19:22:41 PDT Received: from wolfe.wimsey.com by toad.com id AA29820; Thu, 5 May 94 19:22:36 PDT Received: by wolfe.wimsey.com (Smail3.1.28.1) id m0pzFYZ-0002PqC; Thu, 5 May 94 19:22 PDT Received: by xtropia id AA16656 (5.65c/IDA-1.4.4 for cypherpunks(a)toad.com) ; Thu, 5 May 1994 19:10:43 -0700 Date: Thu, 05 May 1994 19:10:43 -0700 From: anonymous(a)extropia.wimsey.com Sender: owner-cypherpunks(a)toad.com To: cypherpunks(a)toad.com Message-id: <199405060210.AA16656@xtropia> Content-transfer-encoding: 7BIT Remailed-By: remail(a)extropia.wimsey.com Precedence: bulk Comments: This message was anonymously remailed. Do not reply to the address in the From: line, unless you wish to report a problem. Thank you. Ah, the problems of anonymity. In order to prevent impersonation, I'm passing my public key to the list. Future messages from me will be signed with this key. -Lady Ada -----BEGIN PGP PUBLIC KEY BLOCK----- Version: 2.3a mQCNAi2rMQAAAAEEALehNDQG2UpPhFLspypt6dPLFjSB1wnwFW9p8cEftZ+ga/ZU 06mywff21ODSYily2NMwOpw+mxSkxiOTJDdjJ3kenRW4qwpvmBGs96AK+0yv2DDh R3ff9cpOlIu3tUcJhmdTcSj+MXlkYwJwhJoA9o4uCFXahN5W1KXNQdJx1hMZAAUR tBZMYWR5IEFkYSA8bm93aGVyZUBhbGw+ =K9ps -----END PGP PUBLIC KEY BLOCK-----

1 0

Re: Patent infringement (fwd)
by Brian Beker 17 Dec '03

17 Dec '03

---------- Forwarded message ---------- Date: Fri, 20 May 1994 13:43:10 -0700 (PDT) From: Netcom Support <support(a)netcom.com> To: david(a)sternlight.com Cc: Brian Beker <beker(a)netcom.com> Subject: Re: Patent infringement [Deleted; copy of Mr. Sternlight's original letter of complaint about my PGP2.3a key in my .plan file] You should take the matter up with him; we thank you for your information and opinions but will be taking no further action at this time. If you wish to pursue this matter legally you should have RSADSI's lawyers contact him directly. ___________________________________________________________________________ Support support(a)netcom.com Technical Support Staff NETCOM On-line Communication Services

1 0

Re: Complaint against beker@netcom.com (fwd)
by Brian Beker 17 Dec '03

17 Dec '03

With this and the previous response to Mr. Sternlight from Netom, this matter is for now laid to rest. Brian Beker ---------- Forwarded message ---------- Date: Fri, 20 May 1994 13:46:29 -0700 (PDT) From: Netcom Support <support(a)netcom.com> To: david(a)sternlight.com Cc: Brian Beker <beker(a)netcom.com> Subject: Re: Complaint against beker(a)netcom.com David Sternlight writes: > From strnlght Thu May 19 12:31:19 1994 > Return-Path: <strnlght> > Received: by netcom.com (8.6.8.1/SMI-4.1/Netcom) > id MAA01913; Thu, 19 May 1994 12:30:20 -0700 > From: strnlght (David Sternlight) > Message-Id: <199405191930.MAA01913(a)netcom.com> > Subject: Complaint against beker(a)netcom.com > To: support (Netcom Support) > Date: Thu, 19 May 1994 12:30:18 -0700 (PDT) > In-Reply-To: <199405191033.EAA29745(a)spot.Colorado.EDU> from "Richard Johnson" at May 19, 94 04:33:51 am > Reply-To: david(a)sternlight.com > X-Mailer: ELM [version 2.4 PL23] > MIME-Version: 1.0 > Content-Type: text/plain; charset=US-ASCII > Content-Transfer-Encoding: 7bit > Content-Length: 6613 > > I mailed a complaint to netcom support. At the suggestion of the netcom > support person I spoke to on the phone, I sent a copy to the user in > question as well. > > That user posted a copy of the complaint to a newsgroup without my > permission. This is, of course, a violation of my copoyright. Thus he has > compounded his violation of RSADSI's patent in PGP with a violation of my > copyright in my e-mail. > > By trying to make what should be a private matter between the user and > netcom support, and myself and netcom support into a public cause celebre, > and generate pressure mail on netcom support such as that below, I believe > the user in question has further violated his agreement, and request netcom > to take appropriate action. This time I have a personal interest in seeing > this resolved. Postng another person's email, while annoying, is not necessarily a violation of copyright in our eyes. Again, we have no intention of taking action at this time; if you want to pursue the matter legally, then have your lawyer talk to him. ___________________________________________________________________________ Support support(a)netcom.com Technical Support Staff NETCOM On-line Communication Services

1 0

RSA's "Sink Clipper" poster
by snyderra＠dunx1.ocs.drexel.edu 17 Dec '03

17 Dec '03

Got home today, and found a poster tube attached to my doorknob. Inside I found a poster from RSADSI ("Because some things are better left unread.") with the picture of a ship going down and the words "Sink Clipper!" on it. It's not a bad poster, saying how Clipper "allows government to eavesdrop on the communications of criminals, suspects, and unfortunately, law-abiding citizens alike," and lists what you can do to stop it. (Boycott, write Washington, and, of course, buy only real RSA products :-) ) It's a pretty good poster. I believe I got it because I inquired of their various products and PEM services a while back. I don't know what their policy is, but I don't suppose it'd hurt to mail info(a)rsa.com and ask. Bob -- Bob Snyder N2KGO MIME, RIPEM mail accepted snyderra(a)dunx1.ocs.drexel.edu finger for RIPEM public key When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl.

1 0

Re: FAQ: Where to get PGP latest version
by wcs＠anchor.ho.att.com 17 Dec '03

17 Dec '03

Mike Johnson's list of where to get PGP has teh following: > Platforms | Released | Version | Notes & restrictions > | by | | Other restrictions may apply. >-------------------------------------------------------------------------- > Dos & Unix | MIT | 2.5 | Uses RSAREF 2.0. Not for use in any > | | BETA | application that you get paid for. > | | | Patents licensed for personal use only. > | | | Not for export from the USA or Canada. >-------------------------------------------------------------------------- The export situation is far better than that, actually. There used to be *two* reasons you couldn't export RSAREF. One was that the U.S. Government threatens people who do export crypto, though they have to catch you to enforce it. The other was that the RSAREF license documents said you couldn't export it or use it outside the US/Canada, which means you'd be violating their copyright if you used it in, say, Europe, where US copyrights are enforceable. The current RSAREF license, however, does not forbid export or use outside the US/Canada - it only says that it ay be subject to export laws and recommends consulting a lawyer if you want to export it. This means that, if a copy were to find its way out of the US, it would be perfectly legal to use it within the other terms of the license, which would make it possible to do things like, say, compile it along with a PGP-2.5-bones library. (The alternative approach would be to get someone to rewrite it from scratch outside the US, and make sure it was a good clone.) While I don't have enough lawyers, guns, and money to go exporting it myself, I must say I'd be *shocked* to find it appearing on, say, ftp.funet.fi in the near future :-) Bill Stewart

1 0

Re: D-H key exchange - how does it work?
by wcs＠anchor.ho.att.com 17 Dec '03

17 Dec '03

Eric Hughes, replying to somebody, says: > It takes hours and hours of searching to find > a 1024 bit strong prime on a workstation. Granted, you don't need to change > very often perhaps, but some people would like to change every day. > If they really want to change that often, they can buy a dedicated > machine. There's no good cryptographic reason to change that often, > if the modulus is large enough. In addition, changing the modulus can > have unpleasant effects on traffic analysis, if not done properly. For basic PGP mail, there's no need to change keys that often. There are other applications, though, that tend to want new keypairs on each transaction, and looking for strong primes would make them much more annoying, if strong primes matter with the current factoring algorithms... Bill

1 0

Is my DH exchange secure?
by catalyst-remailer＠netcom.com 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- nelson(a)sgi.com describes some of the precautions required to use DH exchange safely: ** begin quoted text *** The prime p wants to be chosen with a little care, and the "random" numbers a and b may want to be "selected" to eliminate certain undesirable values. I'll explain below. Within the field Z_p (the set of integers 0..p-1) where p is prime, there are elements whose successive powers make up all the elements of the field Z_p. These numbers are called "primitive" elements or "generators" of the field Z_p. That is, if g is a generator of the field Z_p, then the successive powers g, g^2, g^3, ... g^(p-2), g^(p-1) mod p include all the p-1 non-zero elements of Z_p. The set of unique numbers produced by taking succesive powers mod p of an element m of Z_p is a group, the "multiplicative span" of m, which is a subgroup of Z_p. The number of elements in the group generated by m is called the "order" of m. Primitive elements of Z_p have order p-1. Not all of the elements of Z_p are primitive. Some elements of Z_p have very small orders. At least one element will have order 2. Given that p is prime, the orders of the elements of Z_p will all have values that are products of some or all of the prime factors of p-1. Since p is prime (and p=2 is not interesting ;-), p-1 will contain the factor 2. An small example may make this point clear. Let p == 11. The prime factors of p-1 are 2 and 5. Hence we expect the orders of the elements of Z_11 to be 2, 5, or 10. By enumerating the groups of the elements of Z_11 we see this is so (for Z_11). E.g. Element Ring Order - ------ ----------------------------- ----- 1 1 1 2 2, 4, 8, 5, 10, 9, 7, 3, 6, 1 10 3 3, 9, 5, 4, 1 5 4 4, 5, 9, 3, 1 5 5 5, 3, 4, 9, 1 5 6 6, 3, 7, 9, 10, 5, 8, 4, 2, 1 10 7 7, 5, 2, 3, 10, 4, 6, 9, 8, 1 10 8 8, 9, 6, 4, 10, 3, 2, 5, 7, 1 10 9 9, 4, 3, 5, 1 5 10 10, 1 2 There are 4 primitive elements in Z_11, 2, 6, 7, & 8. The orders of all the elements are as predicted by Euler. Now, let us imagine that Alice and Bob have chosen 11 as their prime and 7 as "g", their generator. Following the steps outlined above: > Alice generates a random number a. say 3 > Bob generates a random number b. say 5. > Bob tells alice g^b, Alice tells Bob g^a. 10 2 > Alice knows a and g^b, and thus generates g^(ab) trivially. 10 > Similarly, Bob knows g^a and b, and trivially generates g^(ab). also 10. > An interceptor only knows g^a and g^b, and because the discrete log > problem is hard cannot get a or b easily, and thus cannot generate g^(ab). Except that the interceptor, evil Eve, took g^a and g^b and tested them for short order, and found that one of them, g^b, had a very short order indeed. So, without knowing a or b, Eve knows that g^(ab) is one of a very few numbers, the elements of the group of g^b. She can now try the elements of that group until, by exhaustion, she finds the value that reveals the key g^(ab). > g^(ab) is now a shared secret of Alice and Bob. And Eve, too. Some primes produce lots and lots of elements with small orders. For example, Z_37 has 12 primitives, 6 elements of order 18, and all the rest have order 9 or less. So, is DH all wet (insecure)? No. There are some simple steps to prevent this problem. First, pick p to minimize the number of elements with small order. This means that we need to know the factorization of p-1. Of course, factoring large numbers is a hard problem, but there are several ways to pick p with known factorization of p-1. The simplest seems to be to pick p such that (p-1)/2 is prime; that is, such that p-1 has two factors, 2 and (p-1)/2. Now, all the elements of Z_p will have orders of either 2, or (p-1)/2, or p-1. There are other methods, that permit other small orders, but we won't explore them here. Second, after "randomly" choosing a, and computing g^a, Alice takes the additional step of making sure that the order of g^a is not small (i.e. is more than 2). If g^a is of small order, she picks another random a, and repeats the process. This is trivial indeed. Bob does likewise for his numbers b and g^b. Since Alice and Bob have eliminated the small groups, Eve will never encounter a g^a or g^b number whose order is less than (p-1)/2, and given that (p-1)/2 is a _very_ large prime number, Eve won't live long enough to try all of the elements of groups of that order. I haven't checked to see if the RSAREF code takes these precautions. *** end quoted text *** I wrote a Diffie-Hellman exchange program as an extension to PGP Tools. It uses the PGP MPILIB and does up to 1024-bit key exchange, then MD5's the shared secret to get an IDEA key. I took most of the precautions above. - From the DHEX10A manual (csn.org) >To use DH, we need a modulus n and a generator g. Unlike an RSA modulus, >which is a product of two primes, a DH modulus must be prime. (n-1)/2 must >also be prime. This makes the moduli slightly painful to find, but they can >be reused indefinitely. DHEX tests a modulus by first testing both n and >(n-1)/2 with fastsieve. Only if both pass is slowtest used. It still took >me a whole day to find the 1024-bit modulus in the demo. There is also a >512-bit modulus there. > >To find the generator, we need the factors of n-1. They are 2 and (n-1)/2. >For each factor f, we compute ((g^((n-1)/f)) mod n). If this is 1 for >either factor, the number is NOT a generator. Generators are easy to find, >usually in one to three tries. The one precaution I did not take is: (from discussion above) >Second, after "randomly" choosing a, and computing g^a, Alice takes the >additional step of making sure that the order of g^a is not small (i.e. >is more than 2). If g^a is of small order, she picks another random a, >and repeats the process. This is trivial indeed. Bob does likewise for >his numbers b and g^b. Does the careful choosing of n and g eliminate this problem, or do I need to modify my Diffie-Hellman code to check g^a for short order? How do you check a number for short order? Pr0duct Cypher -----BEGIN PGP SIGNATURE----- Version: 2.3a iQCVAgUBLd1CL8GoFIWXVYodAQGnhAP+KI+w8ihQCrwKorBpkshwxBOLStIsC1uo 0e/weUyl6SqIaPCvPbYdhoKXfwpMkLxTJLvwb0wCZPtrfUDWJiCao4H7dV8VCh/q ksWDYdVBpxupdMni+vkbuewQz105FaSTz1tHXiy1hgWYO+/OrHXy2r3WEEx8+zcF ZqDMDbdvToU= =sZT1 -----END PGP SIGNATURE-----

2 1

Some 1024-bit DH moduli, and a program to generate them
by Phil Karn 17 Dec '03

17 Dec '03

Here are some randomly generated 1024-bit Diffie-Hellman moduli, along with the smallest generator for each. Each modulus p is a strong prime, i.e., both p and (p-1)/2 are prime. I've appended the generating program, which uses the GNU gmp library. On a 486-66 DX2 running BSDI 1.1, it generally runs in less than an hour though of course the actual run time is probably a Poisson distributed random variable. It turns out that almost any amount of sieving is worthwhile given the cost of the Miller-Rabin test and that the density of 1024-bit strong primes is on the order of only one every 500,000 or so. Before running this again I'd probably decrease the large number sieve size to perhaps 1 million and make the small number sieve as large as possible, rather than keep them the same size. --Phil a4788e2184b8d68bfe02690e4dbe485b17a80bc5f21d680f1a8413139734f7f2b0db4e253750018aad9e86d49b6004bbbcf051f52fcb66d0c5fca63fbfe634173485bbbf7642e9df9c74b85b6855e94213b8c2d89162abeff43424350e96be41edd42de99a6961638c1dac598bc90da069b50c414d8eb8652adcff4a270d567f Generator = 5 de9b707d4c5a4633c0290c95ff30a605aeb7ae864ff48370f13cf01d49adb9f23d19a439f753ee7703cf342d87f431105c843c78ca4df639931f3458fae8a94d1687e99a76ed99d0ba87189f42fd31ad8262c54a8cf5914ae6c28c540d714a5f6087a171fb74f4814c6f968d72386ef356a05180c3bec7ddd5ef6fe76b0531c3 Generator = 2 97dd36c5a63213d5c9a6ab0e1dac722053e6f398beb699dcbaa17368406c9efe2d2b29ccd78fd6faa497d096e07854ea57cf51a621c8a7f01175d39c9b25cda8225b3b4318cfa7d42cf81437272d8d4a8bbb8450fe257a0554bf3c9e53f3c8fdfd7f5effe88885ebd1c36b7e3216e3b19b65a42ea07fe53d4e403d0a3235307f Generator = 5 97f64261cab505dd2828e13f1d68b6d3dbd0f313047f40e856da58cb13b8a1bf2b783a4c6d59d5f92afc6cff3d693f78b23d4f3160a9502e3efaf7ab5e1ad5a65e554313828da83b9ff2d941dee95689fadaea0936addf1971fe635b20af470364603c2de059f54b650ad8fa0cf70121c74799d7587132be9b999bb9b787e8ab Generator = 2 fc642ddf24aa0d3fc50f4bac2f616d1e556c413373fcf4e1188f1f416473d2ac447abba857f8f8d3ab63ba9ee5762b47c59e3048e19f05d84a161e46d319c78fae02779fb6e35a165902633a76fefec77d75c0703818a37fb1bff6613b63ebac287449a9f8a101a3b33769f6cc7a3576f06283e1d45738a88380ee3e85607523 Generator = 2 d4bd8e44f0a05dcb319025b47ff7da8702665c3d1b2a8518a0d46073b499014b6ad8655569cd1655766747cb1e5e1a1fa8a275fd83bc02297784c00952d04bb6b50f79ba9befb1696a85908221a4765880d6dc0680d2ac5c136cfe694255972cebf1f1239beee5b168054ea2b2c08a91b6f22e8bf14153d26f69999a1782990f Generator = 5 da76402bdddbb5dda51f79dae442fe010688b652825ffecb6a04ec6e368a95ef35e729bc30e947ce19d7fa6946c7939d6c62791d9ac705f1509d496e10fbc7795e8197129a09283f5faf8636152c151c5f3910b06e485456fae1df094cb4da07f86e67054be8f2f0b94010d91fcd7fb66d03c57e1bea80839d874856b567403b Generator = 2 f47bddad1d4cf2f8c14985b954e6a9dbd79bd72ee40691c288d34e922a4ffd5486d39fec4e9f6dd64f0b6e9b16b628e44602f701e736d735996b03163f7c6a63152e3d0a7f04f5a6490f2b845340e015dc3c63bd5f9e7d3aaf4c49cc4fa97ff19fa8446ceb7dc2ab632cc6ebccce60163eb1b7930afbcbf077726ffce904a583 Generator = 2 c292efe525ea4315de43b0c620448009100cbf68a83c948f72809bee0c77c13e166fb6264355bcfb8c4457291f82f080bf6ca8328fa52c1b1e4a8cce696026222db8d1122923d2072bde6e373b6a92acfe1c5107512ffaadd35fe5ef74e61dc025436b3715d07bb382f8d2e114dabe57b8b574aeb20fb9d287105d98d130792b Generator = 2 bd36e0fa98b48c678052192bfe614c0b5d6f5d0c9fe906e1e279e03a935b73e47a334873eea7dcee079e685b0fe86220b90878f1949bec73263e68b1f5d1529a2d0fd334eddb33a1750e313e85fa635b04c58a9519eb2295cd8518a81ae294bec10f42e3f6e9e90298df2d1ae470dde6ad40a301877d8fbbabdedfced5fe5fbf Generator = 7 /* Generate a prime suitable for use as a Diffie-Hellman modulus, * i.e., (p-1)/2 is also prime. Also find a generator. * P. Karn, April 1994. */ #include <stdio.h> #include <gnu/gmp.h> #define PLEN 1024 /* 1024 bits */ #define SEARCHSPACE 5000000 /* Search range beyond starting point */ #define SIEVESIZE (SEARCHSPACE/2) /* Sieve only includes odd numbers */ #define BIT_SET(a,n) ((a)[(n)>>5] |= 1 << ((n) & 31)) #define BIT_CLEAR(a,n) ((a)[(n)>>5] &= ~(1 << ((n) & 31))) #define BIT_TEST(a,n) ((a)[(n)>>5] & (1 << ((n) & 31))) unsigned long Smallsieve[SIEVESIZE/32]; long generator(MP_INT *p); /* Construct sieve of prime numbers [3...SIEVESIZE*2] (odd numbers only) */ smallsieve(void) { int j,k,p; memset(Smallsieve,0,sizeof Smallsieve); for(k=0;k < SIEVESIZE;k++){ if(BIT_TEST(Smallsieve,k)) continue; /* 2*k+3 is composite */ p = 2*k+3; /* The next small prime */ for(j=k+p;j<SIEVESIZE;j += p){ BIT_SET(Smallsieve,j); /* Mark all multiples of p */ } } } main(argc,argv) int argc; char *argv[]; { MP_INT p,q,start,g,f,two,tmp; unsigned long sieve[SIEVESIZE/32]; char *cp; int i,j,k; memset(sieve,0,sizeof(sieve)); mpz_init(&p); mpz_init(&q); mpz_init(&start); mpz_init(&f); mpz_init(&tmp); mpz_init_set_ui(&two,2); printf("Generating small prime numbers...\n"); smallsieve(); /* Generate random starting point for subprime search, * and ensure that it's odd */ if(argc < 2){ printf("Generate random starting point\n"); mpz_random(&p,PLEN/32); } else { printf("Using specified starting point\n"); mpz_set_str(&p,argv[1],0); mpz_mod_2exp(&p,&p,PLEN); } /* starting q = (p-1)/2 */ mpz_div_2exp(&start,&p,1); if((mpz_get_ui(&start) & 1) == 0) mpz_sub_ui(&start,&start,1); printf("Start q search at\n"); cp = mpz_get_str(NULL,16,&start); fputs(cp,stdout); free(cp); printf("\n"); /* p = 2*start + 1 */ mpz_mul_2exp(&p,&start,1); mpz_add_ui(&p,&p,1); /* Sieve out q's and p's with small factors */ printf("Sieving from starting point to q+%d...\n",SEARCHSPACE); for(i=0;i<SIEVESIZE;i++){ int s,r; /* Get next small prime */ if(BIT_TEST(Smallsieve,i)) continue; s = 2*i+3; /* r = start mod s */ r = mpz_mmod_ui(NULL,&start,s); k = s - r; /* start+k is first entry divisible by s */ if(k == s) k = 0; /* s divides start */ if(k & 1) /* start+k even? */ k += s; /* Make start+k odd, and k even */ /* The sieve omits the even numbers */ k >>= 1; for(;k < SIEVESIZE;k += s){ BIT_SET(sieve,k); /* s divides start+2*k */ } /* r = p mod s */ r = mpz_mmod_ui(NULL,&p,s); k = s - r; /* p+k is first entry divisible by s */ if(k == s) k = 0; /* s divides p */ while(k & 3) k += s; /* The sieve omits the numbers divisible by 4 */ k >>= 2; for(;k < SIEVESIZE;k += s){ BIT_SET(sieve,k); /* s divides p+2*k */ } } printf("Sieve done, checking remaining candidates...\n"); for(k=0;k<SIEVESIZE;k++){ if(BIT_TEST(sieve,k)) continue; /* Definitely composite, skip */ /* Candidate prime */ printf("test prime candidate at start+%d\n",2*k); mpz_add_ui(&q,&start,2*k); if(!mpz_probab_prime_p(&q,1)) continue; printf("q passed Rabin-Miller test...\n"); /* p = 2*q + 1 */ mpz_mul_2exp(&p,&q,1); mpz_add_ui(&p,&p,1); if(!mpz_probab_prime_p(&p,1)) continue; printf("p passed Rabin-Miller test...\n"); break; } if(k == SIEVESIZE){ printf("Failed to find a strong prime\n"); exit(1); } printf("Found modulus p =\n"); cp = mpz_get_str(NULL,16,&p); fputs(cp,stdout); free(cp); printf("\n"); /* Find g, primitive root mod p */ printf("Finding generator\n"); i = generator(&p); printf("Generator g = %d decimal\n",i); } /* Find smallest primitive root (generator) for strong prime p using * algorithm on p. 209 of Schneier. Since we know (p-1)/2 is prime, * we know the factorization of p-1: it's simply 2 * (p-1)/2. * This makes our job *much* easier. */ long generator(p) MP_INT *p; { MP_INT g,tmp,q; int i; mpz_init(&g); mpz_init(&tmp); mpz_init(&q); mpz_sub_ui(&q,p,1); mpz_div_2exp(&q,&q,1); /* q = (p-1)/2 */ /* Try 2. No need to test 2^2 mod p != 1 :-) */ printf("Trying 2"); mpz_set_ui(&g,2); mpz_powm(&tmp,&g,&q,p); /* tmp = 2^q mod p */ if(mpz_cmp_ui(&tmp,1) != 0){ mpz_clear(&g); mpz_clear(&tmp); mpz_clear(&q); return 2; /* 2 is primitive */ } /* Try small primes starting with 3 */ for(i=0;i<SIEVESIZE;i++){ /* Get next small prime */ if(BIT_TEST(Smallsieve,i)) continue; printf(" %d",2*i+3); mpz_set_ui(&g,2*i+3); /* g = trial generator */ mpz_powm(&tmp,&g,&q,p); /* tmp = g^q mod p */ if(mpz_cmp_ui(&tmp,1) == 0) continue; /* g is not primitive */ /* This test can't possibly fail for small values of g, * but it's here for completeness anyway */ mpz_powm_ui(&tmp,&g,2,p); /* tmp = g^2 mod p */ if(mpz_cmp_ui(&tmp,1) == 0) continue; /* g is not primitive */ break; /* Passes both tests */ } printf("\n"); mpz_clear(&g); mpz_clear(&tmp); mpz_clear(&q); if(i == SIEVESIZE){ printf("Could not find a small generator\n"); return -1; } return(2*i+3); }

1 0