- cypherpunks-legacy - lists.cpunks.org

ANNOUNCE: SF Bay Area Cypherpunks, Sat Aug 8, Santa Clara & Palo Alto
by John Gilmore 17 Dec '03

17 Dec '03

The August meeting of the San Francisco Bay Area Cypherpunks will be on Saturday, August 8 1998 from 12-6PM. This is an open meeting, as always, and the public is invited to attend. The meeting will be held in two sequential locations this month. We'll start with a tour of the recently announced Electronic Frontier Foundation "DES Cracker", hosted by the company which built its hardware. Please join us between noon and 2PM at: Advanced Wireless Technologies 3375 Scott Blvd #410 Santa Clara, CA 95054 +1 408 727 5780 http://www.mapblast.com/mapblast/blast.hm?CMD=MAP&GC=X%3A-121.98298%7CY%3A3… It's in a complex of small startups at the corner of Scott Blvd and Garrett Drive in Santa Clara. To reach it, take US 101 to the Bowers Avenue exit (heading south/oceanward), turn right in a few blocks on Scott Blvd, and turn right on Garrett. The first two driveways on the right serve the complex; AWT's corner of the parking lot is at the second. You can also come in via Lawrence Expressway; go east/SanJoseward on Arques Avenue (which becomes Scott Blvd) and turn left on Garrett. Autographed copies of the Cracking DES book will be available, and the machine will be running. There isn't a room large enough to have a sit-down meeting at AWT, so we'll reconvene at 2:30 at Stanford University, at the outdoor tables outside Tresidder Union, which is near the bookstore. The tables are on the west side, which is the inside of the U-shape. Coffee and food are available in the building. http://www.stanford.edu/home/map/search_map.html?keyword=&ACADEMIC=Tresidde… http://www.stanford.edu/home/map/stanford_zoom_map.html?234,312 Agenda: 12:00-2:00 at the machine location, then move to Stanford and reconvene at 2:30. Dinner at a mutually agreed location will probably follow. Speakers: Cracking DES - John Gilmore et al, 2:30 at Stanford "Private Doorbells" - John Bashinski, ~3:30 -- John Gilmore

1 0

iz it
by LOUISE E LIBERATORE 17 Dec '03

17 Dec '03

What R dezz Algorithms

7 6

Fwd: Code Red privacy workshops
by Declan McCullagh 17 Dec '03

17 Dec '03

>Date: Sat, 28 Nov 98 23:19:16 0 >From: simon davies <simon(a)privint.demon.co.uk> >Subject: Code Red privacy workshops > > > > >PLEASE DISTRIBUTE > >PRIVACY INTERNATIONAL ANNOUNCES >THE "CODE RED" PRIVACY WORKSHOPS > > >Friends and colleagues, > >In 1999, Privacy International - the international privacy >campaign organisation - will host a series of privacy workshops to >be held in Brighton throughout the year on the second weekend of >each month. > >The workshops will have four purposes : > >1. To brainstorm current privacy (and privacy related) issues; > >2. To plan future events and campaigns; > >3. To provide occasional training sessions in technical issues, media >skills, campaigning etc, and, > >4. To give us all an opportunity to network and to have huge >amounts of evening/night fun in sunny Brighton. > >We called the workshops "Code Red" because.....well.....because it >sounds cool. No other reason. > >We chose Brighton as the venue for the workshops because of the >mass of PI members and supporters there who can offer a billet (i.e. >free accommodation if you can stand sleeping with the cat/ dog/ >mainframe humm/ sound system/ travelling hippies etc etc.). > >The workshops are open to campaigners, IT experts, academics, journalists and >anyone involved in the pursuit of privacy protection. >Chatham House rules will apply to the workshops. > >The 1999 dates will be : > > January 9 & 10 > February 13 & 14 > March 13 & 14 > April 10 & 11 > May 8 & 9 > June 12 & 13 > July 10 & 11 > August 7 & 8 > September 11 & 12 > October 9 & 10 > November 13 & 14 > December 11 & 12 > > >The Standing Agenda will be : > >Saturday 13.00 - 14.00 Amateur buffet lunch and guest speaker > > 14.00 - 18.00 : Briefing and discussion of curent issues > > 18.00 - : pubbing, dining and clubbing in Brighton > >Sunday 11.00 - 15.00 : Follow-up from Saturday, campaign strategy, >ad-hoc training sessions, comprehensive briefing sessions, and forward >planning (can be extend if required). > >Within this agenda, the subject matter is flexible, and the sessions >are likely to cover a range of themes including internet privacy, >censorship, data protection law, workplace surveillance, >communications interception, police powers, national security and >visual surveillance. > >Anyone wanting to participate should call Simon Davies on 0958 466 >552. There will be no cost, though a contribution of a few quid for >food would be gratefully received if you can afford it. > >BLOCK OUT THE DATES IN YOUR YOUR DIARY NOW !! > >We're looking forward to seeing you. > >Best wishes > >Simon Davies >Director, >Privacy International > >email simon(a)privacy.org > >www.privacy.org/pi/ >

1 0

Re: US Updates Crypto Policy
by Information Security 17 Dec '03

17 Dec '03

> From: John Young <jya(a)pipeline.com> > > http://library.whitehouse.gov/PressReleases-plain.cgi?date=0&briefing=3 > > THE WHITE HOUSE > ____________________________________________________________________ > For Immediate Release > September 16, 1998 > > Administration Updates Encryption Policy [snip] > Very strong encryption with any key length (with or without key > recovery) will now be permitted for export, under license exception, to > several industry sectors. [snip] > On-line merchants in 45 countries will be able to use robust U.S. > encryption products to protect their on-line electronic commerce > transactions with their customers over the Internet. On-line merchants? Anyone care to try and purchase US-strong crypto from overseas for their WWW business? Which crypto products? What are the minimum "business" requirements? ;-) ---guy How long does it take to get approval?

1 0

Any Houston D-H expiration parties?
by Stephen Cravey 17 Dec '03

17 Dec '03

Is anyone throwing a DH expiration party in Houston?

1 0

Re: Clinton's fake apologies (fwd)
by Anonymous 17 Dec '03

17 Dec '03

Jim Choate wrote: > > > Declan McCullagh <declan(a)well.com> wrote: > > lying under oath is perjury, whether you like it or not. > > As rare as it is, I agree with Declan here. If Clinton would lie under oath > about a non-crime (ie sex between consenting adults) what would he do if > faced with a real issue? > > He should have said "Yeah, I had sex with her. What business is it of > yours?". > Presumably he should lie to protect the state. So lieing per se isn't the problem. It is the use of the privilege where it doesn't apply that upsets you. Murky water for impeachment, methinks. Furthermore, we have gone from the CDA to government publication of pornography in short order. Farbeit for any cypherpunk to complain.

1 0

A Challenge (perhaps!)
by KarL MarX 17 Dec '03

17 Dec '03

Hi! My friend has just written a new crypto program that he is trying to get included on a PC Magazine CD-ROM over here... I don't know too much about it at the moment, but he said he thought it would be a good idea to see if anyone on this list could crack it and thus help to make it more secure. I don't know too much about it ATM... I know it doesn't exercise key technology and relies on the secrecy of the algorithm (which from my very limited knowledge on cryptography I think makes it almost doomed from the start (?))... I have some ciphertext of this application but apart from that I have nothing else... Would anyone have any objectiosn to this being posted to the list? If not, could someone tell me what I should post to the list, plaintext and resulting ciphertext, would that be enough, or shoudl I post some info on the algorithms as well ??? The application is written in Visual Basic and I could probably get a copy of the compiled (well VB is actually interpreted, but that's neither here or there) .EXE file.... -- Karl Marx

2 1

Your new password
by sixdegrees 17 Dec '03

17 Dec '03

Name: Jolly CyberSnot sixdegrees password: suchlamp Congratulations Jolly. You're well on your way to becoming a full sixdegrees(tm) member. Here is your member password: suchlamp. Use it to log-in on the home page at the sixdegrees Web site, http://www.sixdegrees.com. We'll ask you for a little more information to complete your registration, and then you'll be ready to start networking. It's important that you return to the site and log-in. Your membership will not be complete until you do so. Once you've successfully logged in with your password, just go to Personal Profile and you'll be able to choose your own password. Thanks for becoming part of sixdegrees. We're looking forward to seeing you at the site. ==================================================================== PLEASE NOTE: All replies to this address are processed by a computer. If you believe you received this e-mail in error, and it was not your intention to become a sixdegrees member, or if you have any problems, questions or requests send an e-mail to issues(a)sixdegrees.com and someone will get back to you as soon as possible. ==================================================================== E.SI.BAM.1

1 0

text analysis
by CyberPsychotic 17 Dec '03

17 Dec '03

Hello folks, I have abit practical question, since I know this list is partly devoted to cryptography matters, I guess this is the right place to ask: So I was playing with some crypto-analysis algorythms, and some steps of them involve such thing as finding out the frequency of some character or set of characters. So I wonder what would be the optimal (speed, resources etc)way of coding this. While playing with single character frequency, I guess the best way would be having unsigned int 256 elements array (I refer to C coding) and each time, I find certain character, i just increase the element of the array with this char offset. This seems very neat to me (except the thing that some chars could be never found in text). Anyways, when things come to 2 characters set, i have to get 1024 character set, and so on, which looks quite unreasonable to me to allocate memory for elements, which probably will be never found in text... I was thinking of other solution and came to two way connected lists (correct term?) things, i.e. : i have some structure like: struct element { char value[ELEMENT_LENGTH]; unsigned int frequency; struct element *previous; struct element *next; } and could dinamically allocate memory for each new found element, but this would slow down whole code by the time list of new elements grow up. (b/c i will have to look thro.. whole list in order to find whether such element has already been found or not), so I wonder maybe there another neat way to complete tasks like this? I would appreciate any ideas, hints, code examples. (would be very helpful having a look on some code performing such a task, I surfed the web but didn't find many)... Thanks beforehands, Fyodor

3 3

RE: GPL & commercial software, the critical distinction (fwd)
by Matthew James Gering 17 Dec '03

17 Dec '03

Not really, the state holds a monopoly on "legal" force, whereas the Mafia and other black-market organizations do not. What is interesting is they use force often because they cannot use the government legal system to arbitrate their disputes. Matt > -----Original Message----- > From: Steve Mynott [mailto:stevem@tightrope.demon.co.uk] > On Thu, Oct 08, 1998 at 04:14:32PM -0700, Matthew James Gering wrote: > > > > The Mafia has had two primary characteristics: > > > > a) the use of force > > wouldn't this characteristic define the mafia as a "state" to some > degree?

2 1