December 2003 - cypherpunks-legacy

Re: Compuserve grovels to foreign censors
by Duncan Frissell 17 Dec '03

17 Dec '03

At 01:47 PM 1/5/96 -0500, Gordon Campbell wrote: >At 12:56 AM 1/5/96 -0500, Larry Sudduth wrote: > >>Attachment Converted: C:\WORK\WINMAIL.DAT > >What, pray tell, is this? > When a MS Mail attachment wanders around the world, it is accompanied by a data file of some kind. That is winmail.dat. So every MS MAIL attachment is really two attachments. Try to ignore it. DCF "Windoz. It may not be an operating system but at least it's out there on the hardware."

1 0

Portland Cypherpunks Meeting
by Alan Olsen 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- Here is the final(?) information on the Portland Cypherpunks meeting. Date: Jan 20, 1996 Time: 5:23pm (discordian time) Location: The Habit Internet Cafe 2633 S.E. 21st Av., Portland OR 97202 SE 21st @ Clinton in Portland, OR (503)235-5321 For more information on the location, visit: http://www.teleport.com/~habit/ We will be having a key signing and other activities, as well as general socializing. Bring information on projects you are pursuing or questions you would like to ask. Please leave your cameras and other photographic equiptment at home as some of the people attending are pretty camera shy. (And not shy about informing you of it...) It looks like we will be getting people outside of the Portland metro area attending as well. (I have heard from at least one person from the Bay area and one from Seattle, so who knows how many will show up.) If you want to be on the information list for this, just send me e-mail at alano(a)teleport.com. If all goes well, this may turn into a regular thing... -----BEGIN PGP SIGNATURE----- Version: 2.6.2 iQEVAwUBMO19CuQCP3v30CeZAQGi+wf+N7HUDRpgP40SDZHcHlGLk2ApMrQhfAKM 9zxYzphkuqNqNfQB1+b+EFb4dYGOJUcE+DScCbmZMFdy4k9xY78z3Lc3aGFQz4uS ALuPh2T4jbe3rqqJq0aqM/mHlYD63oMi1/aZNMLRmGb7UVMUiGvulYaWI6GBiZVz rMTrmKdQ/2jEzZRpCWbyVCa8X04QY3XnH2nP2s/nDgWyZl9Y87KXN44BizRKfde/ 9x/vWf3mceVa1e09YHwQEwzZNFBvIGlpM4XWLkxh12QeQGCu08CvfJo3dSL0OU/u nRlaBO7IqLH90Ejv0/bLRuI0G3jKXb6yZxexORl6+PUbmwusIeaWIA== =qpD8 -----END PGP SIGNATURE----- Alan Olsen -- alano(a)teleport.com -- Contract Web Design & Instruction `finger -l alano(a)teleport.com` for PGP 2.6.2 key http://www.teleport.com/~alano/ "Governments are potholes on the Information Superhighway." - Not TCMay

1 0

Scaling Web-of-Trust
by Kevin L Prigge 17 Dec '03

17 Dec '03

Sorry for the noise, someone had emailed a while ago with the URL for a paper on scaling the web of trust for PGP, and I've lost the email. If whomever it was could resend the information, I'd be most appreciative. Thanks. -- Kevin L. Prigge |"Have you ever gotten tired of hearing those UofM Central Computing | ridiculous AT&T commercials claiming credit email: klp(a)tc.umn.edu | for things that don't even exist yet? 010010011101011001100010| You will." -Emmanuel Goldstein

2 1

Re: RSA's Art gallery is now on the web
by Alan Olsen 17 Dec '03

17 Dec '03

At 09:57 AM 1/5/96 PST, you wrote: > Are you tired of the clip art you downloaded last week? Do you >need a new background screen for you PC? Does your cubicle need something >to give it character? > Look no further. Visit the RSA Data Security Art Gallery and >download to your hearts content. BTW, the URL for this is: http://www.rsa.com/rsa/gallery/gallery.htm Alan Olsen -- alano(a)teleport.com -- Contract Web Design & Instruction `finger -l alano(a)teleport.com` for PGP 2.6.2 key http://www.teleport.com/~alano/ "Governments are potholes on the Information Superhighway." - Not TCMay

1 0

recent garbage posts
by Daniel Leeds 17 Dec '03

17 Dec '03

The user in question has been talked to. DO NOT mailbomb root or any other account any more, this will be seen as hostile activities. We apologize for your inconvenience, but please, the death threats, physical bomb threats, and other nonsense is not called for.

1 0

Re: New Mitnick Book
by Duncan Frissell 17 Dec '03

17 Dec '03

At 02:36 PM 1/5/96 -0500, Brian Davis wrote: >FWIW: When Markoff showed up with Tsutomu, the FBI agents "assumed" that >he was there with Tsutomu as a fellow researcher/grad >student/assistant/whatever. > >They had no idea (initially) that he was with the media. > >... > I take it that you were in the vicinity? Or is this just what you've heard? Any more iside tidbits on the bust? DCF

2 1

Re: Representations of Pi, etc.
by jim bell 17 Dec '03

17 Dec '03

At 11:45 PM 1/4/96 -0800, you wrote: >At 3:19 AM 1/5/96, jim bell wrote: > >>But BTW, isn't it interesting, that news item from a few weeks ago, on an >>algorithm for determining individual bits in Pi, regardless of whether >>you've calculated all the previous ones. Only problem is, it only works in >>hexadecimal (and, obviously, binary, etc, not decimal. > ^^^^^^^^^^^ >??? > >I didn't see this result you mention, but it surprises me. And practically everybody else, I'm sure! It was written up in Science News magazine, BTW. >The part about how it works in some bases, but not in decimal. Well, by definition if it works in hex, it'll work in octal, "quadal" (?), binary, etc. That's ASSUMED, since they would be subsets (co-sets?) of each other. >The "hand-waving" (motivational/informal) explanation for why I am >surprised is that "Nature doesn't care about bipeds with 10 digits vs. >bipeds, or whatever, with 2 digits or 16 digits." That is, results >applicable in base 16, hexadecimal, should be easily applicable in base 10. Yeah, well, I understand your frustration, but to me the really amazing part is that the elephant flies at all, and not how well he flies (<G>) (In other words, the amazing thing is that there is a predictable relationship in ANY base system) Chances are the thing WON'T work in base 3,5,6,7,9,10,11,12,13,14,15, and any other non 2**n base. Or, at least, it will take a DIFFERENT equation to work in those other bases, if they work at all. >And there is are interesting properties about the distribution of digits in >"random" numbers. Pi is of course not random by many definitions, but >shares certain important properties with random numbers. (Or sequences, if >you wish.) One of these is properties is that of _regularity_, the >frequency of digits. A regular number is one whose expansion has in the >limit the same frequency for all digits, and this is so in any base. Thus, >a regular number has an equal frequency (in the limit, blah blah) of 0s, >1s, 2s, 3s, etc. And switching to another base will not change this. Not "regular," you used the wrong term. As a mathematician's term of art, this is called "normal." In other words, equal numbers of digits 0-9, equal numbers of digit pairs 00-through 99, equal number of digit triplets 000-999, etc. A series of random numbers, by definition, must be "normal." But "Normal" numbers do not necessarily have to be random. As you might expect, however, testing for "normality" is a good first test of "randomness." (I'm not a mathematician, and I don't play one on TV. Don't be overly impressed with the preceeding knowledge; I'm sure there are dozens if a hundred people reading cypherpunks who know more math than I do. I only got a 780 on the math portion of my SAT, 20 years ago... 790's and 800's weren't all that uncommon.) >I recollect that pi has been proved to me regular, i.e., that pi has an >equal frequency of all digits, in the limit, in all bases. Yes, pi is apparently "normal." (at least four the first 4 billion or so digits...) >(This is the sense in which we can argue that pi is "random." in the sense >that there are no correlations, no dependence of the n+1th digit on the nth >digit, and "no apparent order." Furthermore, there is no effective >compression of pi, except by some tricks, such as _naming_ it (a dictionary >compression, of sorts) or by specifying a program which computes it. Lots >of interesting issues about the real meaning of randomness and >compressability, about the "logical depth" of certain computations, etc. I >recommend "The Universal Turing Machine" (ed. by Haken, as I recall) for a >nice set of articles on these fascinating issues.) Of course, I'm not sure of the ramifications of this new discovery (individual-digit computability of pi) on the facts you list... (for example, inter-digit dependence) However, if the digital representations of the digits of pi were indeed still individually "random" and they could be individually computed rapidly enough, at least hypothetically you could use the digits of pi as a "one-time-pad". Obviously, everyone would know (at least, conceptually) the ENTIRE CONTENT of the pad; the only issue would be the location where you started. If the starting point was the key, and could be defined by a number of at least, say, 256-bits long, it might be a replacement for IDEA whose current length is fixed at 128 bits. I suppose the problem with this technique will probably be that it would take too long to calculate the (a number somewhere around 2**256) bit of pi, and for an n-bit message you'd have to do this n times. >In summary, I would be surprised to find that a method for calculating the >Nth digit of pi works for base N but not for base M (modulo some minor >efficiency factors related to machine architecture, etc.). I'm sure somebody else will have seen it. It was in Science News in the last couple of months, as I recall. Some kind soul will probably type it in. Maybe I can even retrieve my copy from my sister.

1 0

Idiot's Guide to News via Compuserve
by Duncan Frissell 17 Dec '03

17 Dec '03

Idiots Guide to Reading Banned Newsgroups via CompuServe CompuServe (alone among the Big Three) gives all subscribers a PPP connection to the Net through any CIS node (including those in Germany). This is a real Net connection that makes it possible to use CIS to fully access all the Net's resources including "banned" newsgroups. A Point-to-Point Protocol (PPP) connection makes your computer just another machine on the Net for the time you are connected. Anything that any Net-connected machine can do, you can do. The CompuServe Dialer (formerly CompuServe Internet Dialer) software that has been included with WINCIM at least since version 1.4 gives you a PPP connection but you need additional newsreading software to dodge CompuServe restrictions. So for real beginners, here is how you can use your CompuServe account to access banned newsgroups as well as the rest of the Internet. These instructions are for Windows users. MAC users can do the same things but I don't know the available MAC software. 1) Get the latest copy of WINCIM. GO WINCIM (hit Ctrl-G and type WINCIM in the dialog box) from within CIS. Download is free. Install it according to the instructions and make sure that you can log on to CIS. 2) Next, let's get a copy of Freeagent which is a free usenet newsreader which works with CompuServe's own Internet connection software. Log on to CIS. GO FTP or: Click the Internet icon, click the File Downloads (FTP) icon and proceed to the main FTP screen. Click the Access a Specific Site button. 3) Enter ftp.forteinc.com in the Site Name box and /pub/free_agent in the Directory box. Click OK and you should see some site login information. Click OK again and you should see a check box next to the file name fagent10.zip. Click the check box and then click the Retrieve button. Wincim will show you that it will save the file in the Compuserv\download directory on your hard drive. (Remember where it's going.) 744279 bytes later, you will have a copy of Freeagent. 4) Move the file fagent.zip into a directory by itself (C:\AGENT for example). Unzip it with Pkunzip or one of the many zip utilities available on CIS. 5) What you are going to do is to connect directly to the Internet via CompuServe and read usenet newsgroups using Freeagent. In order to do that, you will need to find a site somewhere on the Net that will let you read Usenet News for free or you will have to obtain an account on another Internet-connected machine. 6) Community ConneXion (c2.org) will give a month of free service to CompuServe members suffering from censorship. For information send email to uncensored(a)c2.org. After your free month, c2.org costs only $7.50 a month for accounts accessed via the Internet. 7) There are some news servers out there that are open to the public. A news server is just a machine connected to the Internet that stores and forwards Usenet news. The IP addresses of two of the open news servers are 198.70.185.5 and 205.139.39.1. Once you become a sophisticated user of the nets, you can use your Web Browser to pick up a longer list of open news servers at http://dana.ucc.nau.edu/~jwa/open-sites.html. 8) Now back to Free Agent to grab those banned newsgroups. In your WINCIM directory (maybe in a subdirectory called \cid), click cid.exe to start CompuServe (Internet) Dialer or find the phone-shaped dialer icon in your CompuServe group window. Inside the Dialer, hit dial to log on to the Internet. 9) Start Free Agent. Click Accept to accept the license agreement. It will prompt you to enter various information including the address of the news server you want to use, your email address, and other info. All that you have to enter is the address of a news server. In the box labeled "News (NNTP) Server:" enter one of the IP addresses of open news servers (198.70.185.5, 205.139.39.1, or another from the list) or the address of the news server of a system you've opened an account on (news.c2.org, for example). 10) Freeagent will ask you if it's OK to retrieve a list of news groups from the server. Click Yes. Free agent will then tell you that it is Retrieving complete List of Groups. Once that's finished you'll be ready to read all the newsgroups you want and neither CompuServe nor the Bavarian prosecutor will have anything to say about it. "The Internet belongs to no one except its users."

2 1

Idiot's Guide to News via Compuserve
by Duncan Frissell 17 Dec '03

17 Dec '03

Idiots Guide to Reading Banned Newsgroups via CompuServe CompuServe (alone among the Big Three) gives all subscribers a PPP connection to the Net through any CIS node (including those in Germany). This is a real Net connection that makes it possible to use CIS to fully access all the Net's resources including "banned" newsgroups. A Point-to-Point Protocol (PPP) connection makes your computer just another machine on the Net for the time you are connected. Anything that any Net-connected machine can do, you can do. The CompuServe Dialer (formerly CompuServe Internet Dialer) software that has been included with WINCIM at least since version 1.4 gives you a PPP connection but you need additional newsreading software to dodge CompuServe restrictions. So for real beginners, here is how you can use your CompuServe account to access banned newsgroups as well as the rest of the Internet. These instructions are for Windows users. MAC users can do the same things but I don't know the available MAC software. 1) Get the latest copy of WINCIM. GO WINCIM (hit Ctrl-G and type WINCIM in the dialog box) from within CIS. Download is free. Install it according to the instructions and make sure that you can log on to CIS. 2) Next, let's get a copy of Freeagent which is a free usenet newsreader which works with CompuServe's own Internet connection software. Log on to CIS. GO FTP or: Click the Internet icon, click the File Downloads (FTP) icon and proceed to the main FTP screen. Click the Access a Specific Site button. 3) Enter ftp.forteinc.com in the Site Name box and /pub/free_agent in the Directory box. Click OK and you should see some site login information. Click OK again and you should see a check box next to the file name fagent10.zip. Click the check box and then click the Retrieve button. Wincim will show you that it will save the file in the Compuserv\download directory on your hard drive. (Remember where it's going.) 744279 bytes later, you will have a copy of Freeagent. 4) Move the file fagent.zip into a directory by itself (C:\AGENT for example). Unzip it with Pkunzip or one of the many zip utilities available on CIS. 5) What you are going to do is to connect directly to the Internet via CompuServe and read usenet newsgroups using Freeagent. In order to do that, you will need to find a site somewhere on the Net that will let you read Usenet News for free or you will have to obtain an account on another Internet-connected machine. 6) Community ConneXion (c2.org) will give a month of free service to CompuServe members suffering from censorship. For information send email to uncensored(a)c2.org. After your free month, c2.org costs only $7.50 a month for accounts accessed via the Internet. 7) There are some news servers out there that are open to the public. A news server is just a machine connected to the Internet that stores and forwards Usenet news. The IP addresses of two of the open news servers are 198.70.185.5 and 205.139.39.1. Once you become a sophisticated user of the nets, you can use your Web Browser to pick up a longer list of open news servers at http://dana.ucc.nau.edu/~jwa/open-sites.html. 8) Now back to Free Agent to grab those banned newsgroups. In your WINCIM directory (maybe in a subdirectory called \cid), click cid.exe to start CompuServe (Internet) Dialer or find the phone-shaped dialer icon in your CompuServe group window. Inside the Dialer, hit dial to log on to the Internet. 9) Start Free Agent. Click Accept to accept the license agreement. It will prompt you to enter various information including the address of the news server you want to use, your email address, and other info. All that you have to enter is the address of a news server. In the box labeled "News (NNTP) Server:" enter one of the IP addresses of open news servers (198.70.185.5, 205.139.39.1, or another from the list) or the address of the news server of a system you've opened an account on (news.c2.org, for example). 10) Freeagent will ask you if it's OK to retrieve a list of news groups from the server. Click Yes. Free agent will then tell you that it is Retrieving complete List of Groups. Once that's finished you'll be ready to read all the newsgroups you want and neither CompuServe nor the Bavarian prosecutor will have anything to say about it. "The Internet belongs to no one except its users."

1 0

Pi Stuff
by mpd＠netcom.com 17 Dec '03

17 Dec '03

Various amazed people on the Pi thread wrote: > But BTW, isn't it interesting, that news item from a few > weeks ago, on an algorithm for determining individual bits > in Pi, regardless of whether you've calculated all the > previous ones. Only problem is, it only works in > hexadecimal (and, obviously, binary, etc, not decimal. > I didn't see this result you mention, but it surprises me. > Yeah, well, I understand your frustration, but to me the > really amazing part is that the elephant flies at all, and > not how well he flies (<G>) (In other words, the amazing > thing is that there is a predictable relationship in ANY > base system) Chances are the thing WON'T work in base > 3,5,6,7,9,10,11,12,13,14,15, and any other non 2**n base. > Or, at least, it will take a DIFFERENT equation to work in > those other bases, if they work at all. A few quick comments. The notion that one might be able to compute digits of Pi efficiently at any starting point in the number is not late-breaking news. The Chudnovsky brothers developed a formula which permitted them to do this a number of years ago, and used it to compute Pi to several billion digits. Prior to that time, the Borweins' quartic interation based on Ramanujan's modular identities and AGM techniques was the existing state of the art. Given a base, d, and an finite ordinal, i, the function which computes the ith digit of the Pi in the base d is certainly a computable one. If we can find an algorithm for computing this function whose time as a function of "i" does not include the time required to compute all previous digits, then we are to a certain extent evaluating individual digits of Pi without calculating the previous ones. One should keep in mind, however, that the degree to which such things are true for algorithms lies on a continuum, with a near-constant number of arithmetic operations at one end, and a geometric progression at the other. So it is not the classic either/or situation. Good algorithms whose times are tractable functions of "i" are certainly desirable, and have been discovered. Someone suggested that radix conversion was a time-consuming operation. Modern FFT-based algorithms can do multiplication, division, Nth root, reciprocal, and base conversion in near-linear time. Doubtless good algorithms to compute the Nth digit of Pi in any base do exist, but their form may not be as obvious as those for trivial bases, such as powers of two. -- Mike Duvos $ PGP 2.6 Public Key available $ mpd(a)netcom.com $ via Finger. $

1 0