December 2003 - cypherpunks-legacy

Re: NONE
by ghio＠c2.org 17 Dec '03

17 Dec '03

nobody(a)rebma.rebma.mn.org wrote: > Matthew Ghio, > You've done a great job in the past and continue to do so, but for > the past week some (all?) of your users have not been getting any mail. > What happened? Post to cypherpunks, remailer-operators, alt.privacy > or alt.anonymous.messages, alt.abuse.recovery (either one. You choose). > > Thanks. Well, I finally got a chance to catch up on a lot of email that I hadn't had time to read recently. I had to take myriad.pc.cc.cmu.edu down for awhile. It should be back up in a few weeks. My alias-based remailers, alias(a)alpha.c2.org and mg5n+alias(a)andrew.cmu.edu are still up. c2.org has been having network connection problems lately and some messages may have been delayed, but to my knowledge nothing has been lost. For those who have been asking, help files are available by sending mail to help(a)alpha.c2.org, mg5n+remailer-help(a)andrew.cmu.edu, and a list of remailers and mail to usenet gateways is available from mg5n+remailers(a)andrew.cmu.edu

1 0

'brief' macro for invoking pgp
by Alan Pugh 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- hello all, does anyone out there have a macro for the editor _brief_ by borland (last time i checked) that will invoke pgp to sign a message in the buffer. i've been using _brief_ as my primary editor since they were owned by _underware_, (no joke), and would like to be able to sign messages by pressing a hot key. i've been trying to do this off and on for some time, but my programming skills are almost nonexistant. preferably it would be filename independant. that is, it would work on the current buffer. the package was written to be able to compile files while within it, so it should be possible. any help would be greatly appreciated. thanks, amp <0003701548(a)mcimail.com> December 21, 1995 20:27 -----BEGIN PGP SIGNATURE----- Version: 2.61 iQEVAwUBMNnfligP1O9KJoPBAQHtEgf/TV8OeTFBpKhufmbIJqBpoj2Gt6dTjtH/ o3z1ExLFSYols4YAOAJbquqnUariSNrnqV1Ap2IjtNFM08eEAeAOBykjlKfjXWBt ZudoDlRfVoKmGnGVpn4Njo6wrlolpU0rezFls+4Zdx2sA7cLkBuTUBMNN0yq3oBw Yws2rfpKW8SGoj6gyDtkGKisDQtHUotmHTiIPVYI9FbTPa2Fs0Q5RnvAidl0i47m dDuWmfoP3VpiyAbPH9PMnI19Ax3U+n5MFKK0B8zUWIonUdv4px4u7eRo3b0kNCKl qETMZtoNB1Um3o7oZUZvjLAlKEEBOEmDweT4OVyxNt5q9thOO53wKA== =YlLN -----END PGP SIGNATURE-----

1 0

HTTP redirectors
by Hal 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- I posted some experiments on this a few weeks ago. Some existing web proxies, at least the one at CERN, will accept connections from anyone. Set your proxy server to one of those and you have a bit of anonymity already. There is a problem with trying to get much more anonymity than this - most connections are for a very short period. So there is not as much possibility for batching and mixing as with remailers. Only those connections which are actually active at the same moment could have their in/out mapping confused from the perspective of someone watching the redirector site. So generally our goals have to be somewhat more limited than with remailers. The way proxies work, as I understand it, is that normally when you connect to, say, http://site.org/dir/file.html, it connects to the special port number for http at site.org, then sends it the remainder of the URL, dir/file.html. When you use a proxy, it always connects to the proxy machine, then sends the whole URL (possibly not including the http:, I forget), e.g. site.org/dir/file.html. This way the proxy knows where you want to connect and does that for you. The nice thing about this is that it is already built in to most clients. The bad thing is that it does not lend itself to chaining. Ideally, the purpose of chaining is so that no single link in the chain knows both ends. That way no one person can betray your trust. But with the current client software the very first proxy server sees both your address and your destination, so even if it went on to set up a chain you would have to trust it. One idea that was suggested here would be to have a local proxy process, a very simple one which your fancy client connected to for all your net accesses. This would be where you would implement encryption, or new protocols for chaining, etc. This way we don't have to try to persuade client writers to incorporate our improvements; the existing proxy support provides the loophole we need. One nice feature, for example, would be a full 128 bit IDEA or RC4 encryption engine so that overseas Netscape users (or domestic ones who are stuck with crippled versions) can get good security. However, running this kind of local proxy or a general chaining proxy does require root access. Most systems will not let you create a low-numbered socket unless you are root. So this is not something which people will be able to do from their user accounts. Hal -----BEGIN PGP SIGNATURE----- Version: 2.6 iQBVAwUBLvdN/RnMLJtOy9MBAQG4RAIAk6ngvAJvwagoMMyejrvUOJCLQ7Z1CSfm AatsyVIim9++Ehs8wMEXRRyAKp+7/tcOxC0B4f4jk2dqamsZl0YJew== =OQsA -----END PGP SIGNATURE-----

2 1

Kiwi cypherpunks
by Tony.Gurnick＠nzdairy.co.nz 17 Dec '03

17 Dec '03

Lads (and lasses), I seem to be having a bit of troub communicating we the kiwis on this list directly, but no probs if I send to the list. Has there been and communication on this topic in the last 3 or so days??? We cant organise anything if we cant talk to each other! T

3 2

Cryptographic filesystem for Linux?
by Jason Burrell 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- Is there an encrypted filesystem for Linux out there? I'm speaking of something like Secure File System(DOS), but for Linux. The kernel in question is 1.1.59, soon to be upgraded to a later version. IDE drive, ex2fs formatted file system. Regards. - --- [This message has been signed by an auto-signing service. A valid signature means only that it has been received at the address corresponding to the signature and forwarded.] -----BEGIN PGP SIGNATURE----- Version: 2.6.2 Comment: Gratis auto-signing service iQBFAwUBLvfY9SoZzwIn1bdtAQHZFAGA3n8SRWBHKm74hkZjm1hFuZ1EFzcXiD78 lRYe4j/RHaxORSM3tHjC/lrt3v9xTF8a =KAWT -----END PGP SIGNATURE-----

5 4

Hash functions & Physical Analogies
by mikepb＠freke.lerctr.org 17 Dec '03

17 Dec '03

I seem to remember someone mentioning that a hash function, like the one used in signatures in PGP, would show a large change for a small change in the file, and a small change for a large change in the file. I was digging through some of my old stuff last weekend with my kids and found my old Rubik's Cube. I set it aside until last night. Here is the connection. It was late, but I decided to try and figure out some "move" sequences that would move small numbers of blocks on the Rubik's cude, without changing the location or orientation of the rest. In doing this, I (re)noticed that simple "move" sequences resulted in a large number of displacements (translation and/or rotation) of the blocks in the cube. And that very large sequences of "moves" had the opposite effect (if it was the correct sequence). This, in my sleep deprived state, brought hash functions to mind. It also brought several questions to mind. First question: I think I have seen references to topology in discussions of cryptography. I have never had a topography class, so I was wondering, is Rubik's cube is a topology problem? Second question: If Rubik's cube is a topo prob, is it a good analogy for trying to describe hash functions to people? Third question: If there is an analogy, how do you convince the lay person that the hash is a one-way function? By demonstrating that it maps many to one, and the Rubik's Cude maps one to one? Fourth question: To sign a post with PGP (from within vi, under trn) Do I include the header in the lines to be run through 'pgp -fast' or not? (I have the cp list go into a news gateway on my home machine so that threads are easier to follow) ---------------------------------------------------------------| | #include "std/disclaimer.h" Michael P. Brininstool | | mikepb(a)freke.lerctr.org OR mikepb(a)netcom.com | | (408)251-3222(Home) (415)253-0853(Pager) (415)694-1882(Work) | |---------------------------------------------------------------

1 0

Re: Hash functions & Physical Analogies
by danisch＠ira.uka.de 17 Dec '03

17 Dec '03

Michael P. Brininstool wrote: > I seem to remember someone mentioning that a hash function, like the > one used in signatures in PGP, would show a large change for a small > change in the file, and a small change for a large change in the file. More important is that it is difficult (infeasible) to find a file for a given hash value. (This implies that small file changes result in large hash value changes.) > First question: > I think I have seen references to topology in discussions of > cryptography. I have never had a topography class, so I was > wondering, is Rubik's cube is a topology problem? No, it is a permutation group. Use the Schreier-Sims-Algorithm to find solutions. > Second question: > If Rubik's cube is a topo prob, is it a good analogy for trying > to describe hash functions to people? No. It is a simple thing to find a turn which fits to a given state of the cube. When the cube came out a german newspaper published a simple method for solving the cube. This means everyone can easily find a "message" which fits to a given "hash value". This must not be possible for a cryptographic hash function. The hash-function must be a one-way function, but the cube isn't one-way. Further more, the cube allows some kind of differential analysis. Since turning the front side only affects the front side, you can see what to do to turn the front side back. That's also not good for cryptographic context. > Third question: > If there is an analogy, how do you convince the lay person that the > hash is a one-way function? By demonstrating that it maps many to > one, and the Rubik's Cude maps one to one? It is still a problem to convince experts that a hash function is a one-way function... > Fourth question: > To sign a post with PGP (from within vi, under trn) Do I include > the header in the lines to be run through 'pgp -fast' or not? > (I have the cp list go into a news gateway on my home machine so > that threads are easier to follow) Should not do this. The header is modified by transport agents, e.g. paths and date are added. Hadmut

1 0

BYTE on Netscape
by John Young 17 Dec '03

17 Dec '03

Ben Smith writes supportively in the January 1995 issue on Netscape's products -- freebie and commerical. See pp.197-200. Two excerpts: "Netsite Commerce Server is Netscape Communications' most important product because it offers the basic requirements for secure transactions over the otherwise open-for-snooping-and-spoofing Internet." [Brief discussion of crypto system -- RSA, PGP similarity and difference.] "Netscape Communications may not be able to clean out the loose threads and cobwebs of the Internet, but its client and servers are the kinds of products the Internet needs to make the transition from being a cobweb of experimental projects to a serious commercial marketplace."

1 0

MEETING NOTICE: IEEE RSA/Diffie-Hellman Working Group
by eric＠remailer.net 17 Dec '03

17 Dec '03

The following is the notice for the IEEE P1363 working group. The official title includes RSA and Diffie-Hellman, but these two algorithms are on hold because of patent issues. The committee is going forward on elliptic curve systems. Here's how this committee works. The working group is composed of individuals, not representatives of companies. Anybody can show up and participate. The voting rules are as follows. If you've shown up at two of the last three meetings, you can vote. That's it. The next meeting is typically set at the current one. The meetings are held in conjunction with various security conferences, typically, to make it easier for everyone to attend. The last two meetings were at CRYPTO in mid August in Santa Barbara, CA and at the Fairfax, VA security conference in early November. The next one will be possibly at the Oakland, CA conference held in May at the Claremont Hotel. I'd urge all interested parties to make an effort to attend. Eric ----------------------------------------------------------------------------- Date: Wed, 21 Dec 94 11:35:47 PST From: burt(a)RSA.COM (Burt Kaliski) To: p1363(a)RSA.COM Subject: MEETING NOTICE: IEEE RSA/Diffie-Hellman Working Group IEEE P1363: Standard for RSA, Diffie-Hellman and Related Public-Key Cryptography MEETING NOTICE Thursday, January 12, 1995, 9:00-4:00pm Hotel Sofitel, Redwood Shores, California This fifth meeting of the P1363 working group, open to the public, will review draft sections of a standard for RSA, Diffie-Hellman and related public-key cryptography. The meeting follows the 1995 RSA Data Security Conference, held January 9-11 at the same location. AGENDA 1. Approval of Agenda 2. Approval of Minutes from November Meeting 3. Officers' Reports 4. Review of Draft Standard a. General material b. Elliptic curves c. Hardware support d. Random number generation 5. Proposals for New Sections 6. New Work Assignments 7. Meeting Schedule If you'd like to participate, contact Burt Kaliski, the working group's chair, at RSA Laboratories, 100 Marine Parkway, Redwood City, CA 94065. Phone: (415) 595-7703, FAX: (415) 595-4126, E-mail: <burt(a)rsa.com>. Draft sections and copies of previous minutes are available via anonymous ftp to rsa.com in the "pub/p1363" directory. The working group's electronic mailing list is <p1363(a)rsa.com>; to join, send e-mail to <p1363-request(a)rsa.com>. There is no meeting fee this time. Hotel Sofitel is at 223 Twin Dolphin Drive in Redwood Shores, California, about 12 miles south of San Francisco International Airport. From U.S. 101, take the Redwood Shores Parkway exit, and turn left at the second traffic light. Phone: (415) 598-9000.

1 0

Merry Cryptmas
by bart＠netcom.com 17 Dec '03

17 Dec '03

For the holidays I recommend Tim's latest essay, available from ftp.netcom.com:/pub/tc/tcmay/Anarchy for your reading pleasure. This is a reasoned, balanced presentation that will surely propagate the memes of cypherpunk interest to the broader public. Pass it on.

1 0