December 2003 - cypherpunks-legacy

UNWANTED KEYSPACE
by merzbow＠ibm.net 17 Dec '03

17 Dec '03

I allocated way too many keys by getting interrupted (my ISP crashed) then pressing the wrong submit button. Here they are: cd70000000 31 cdf0000000 31 ce70000000 31 cef0000000 31 cf70000000 31 cff0000000 31 d070000000 31 d0f0000000 31 d170000000 31 d1f0000000 31 d270000000 31 d2f0000000 31 d370000000 31 d3f0000000 31 d470000000 31 d4f0000000 31 d570000000 31 d5f0000000 31 d670000000 31 d6f0000000 31 d770000000 31 d7f0000000 31 d870000000 31 d8f0000000 31 d970000000 31 d9f0000000 31 da70000000 31 daf0000000 31 db70000000 31 dbf0000000 31 dc70000000 31 dcf0000000 31

1 0

Re: Road trip
by anthony＠atanda.com 17 Dec '03

17 Dec '03

At 8:40 PM 7/12/95, Robert Hettinga wrote: >I'm going to be in San Francisco (Walnut Creek, really) Saturday, Sunday, >and Monday. > >Anyone up for a beer? > >Cheers, >Bob Hettinga Bob, I've enjoyed your postings and would like to buy you a beer and chat for a while. I'm in Oakland. There's a great pub (30 taps) right around the corner from my house. Or do you have a place in mind in Walnut Creek for the hoisting? Regards, Anthony "We are what we repeatedly do. Excellence, then, is not an act, but a habit." Aristotle

1 0

RC4
by Donald M. Kitchen 17 Dec '03

17 Dec '03

I was trying to throw a few already wasted CPU cycles to the RC4 bit, but had some problems getting the cypher and plain files. (I can't "save next link", only "save current" which sometimes doesn't work well.) So anyway, I decide to run a 24 bit test run on what I've got, using the "extra allocated" keyspace. It says got it at c70014639. Since I know I'm not lucky enough to pick the 5 seconds worth of CPU time that would work, I think someone better send me (by email thanks, lets not clutter the list) the uue of the cypher and plain. I ran the dos version, BTW, but I'm going to compile under Linux. When we decide _which_ key we're going to crack, I could finagle basically full cpu time on about 10 hp9000's for 6 hours a day. Would that help? ;) Don

1 0

No Subject
by Bryce Wilcox 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- There was some discussion on c-punks a little while back about exchanging DigiCash cyberbucks for other currencies (namely US$, as I recall). Is there a list or Web page where I can participate in such a market? Thanks. Bryce signatures follow /================--------------- Bryce Wilcox "Pretty Good Privacy" encrypted mail preferred bryce.wilcox(a)colorado.edu finger for public key ---------------================/ -----BEGIN PGP SIGNATURE----- Version: 2.6.1 iQCVAwUBMASWRJCUT4gUihHlAQGSUgP/WvL/OSzFl8l6PH60D1IK9gT/OAhNc9tm 1jOyKx1shbq0DNUG9uGlJksz/a7gBD20Li6t/7pQkxQbAqIY9vTPiyu3ectRD7c7 9Yqh+jQRXR3+vyE7duD0z1BLs8kSmzmP6/LX5UYx4uJwKT9q+TnOP1S7Nh5PQh0m BB1CRr5I54M= =dLV7 -----END PGP SIGNATURE-----

1 0

No Subject
by Bryce Wilcox 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- I am searching for a time-stamping service that will sign some data of mine (or a hash thereof) along with a certificate indicating what time(,date,year) the signing occurred. I want to use this to substantiate my claim that I was in possession of this data before others were. (Useful for copyrights/ patents, and possibly other things.) (Of course, I could just encrypt the data, PGP-authentify it with my private key, and post it to UseNet, but this strikes me as inefficient and impolite.) If anyone knows where I can find such a service please post here or e-mail me. Thanks. Bryce signatures follow /================--------------- Bryce Wilcox "Pretty Good Privacy" encrypted mail preferred bryce.wilcox(a)colorado.edu finger for public key ---------------================/ -----BEGIN PGP SIGNATURE----- Version: 2.6.1 iQCVAwUBMASWV5CUT4gUihHlAQFckgP8CJJrkY4hTJ1u8uOHZ2N5QfGzYWelv9n7 zXS5bcTxqT8RvHLV8Q+Ay2fbwMrtJmlnF1qWZvDACIUH6M+gYo92vtvaYeVrwv1m pOu8Ci70dGErhHINNSXeZK6QbgIp/Rh9DyubwaMFjnNO9fRhUF3X45qidnwp3x/C +zKOoDh0liM= =lmh8 -----END PGP SIGNATURE-----

1 0

Surety Digital Notary Service
by tcmay＠sensemedia.net 17 Dec '03

17 Dec '03

(There was no message name on this message, so I've created one.) At 4:14 AM 7/13/95, Bryce Wilcox wrote: >I am searching for a time-stamping service that will sign some data of mine >(or a hash thereof) along with a certificate indicating what time(,date,year) >the signing occurred. I want to use this to substantiate my claim that I >was in possession of this data before others were. (Useful for copyrights/ >patents, and possibly other things.) Digital time-stamping is a recurring theme on this list. Info can be found in the Cypherpunks archives, in my Cyphernomicon FAQ, and, most easily, by contacting Surety at: http://www.surety.com/ --Tim May .......................................................................... Timothy C. May | Crypto Anarchy: encryption, digital money, tcmay(a)sensemedia.net | anonymous networks, digital pseudonyms, zero 408-728-0152 | knowledge, reputations, information markets, Corralitos, CA | black markets, collapse of governments. Higher Power: 2^756839 | Public Key: PGP and MailSafe available. "National borders are just speed bumps on the information superhighway."

1 0

No Subject
by johnl＠radix.net 17 Dec '03

17 Dec '03

> I am searching for a time-stamping service that will sign some data of mine > (or a hash thereof) along with a certificate indicating what time(,date,year) > the signing occurred. I want to use this to substantiate my claim that I > was in possession of this data before others were. (Useful for copyrights/ > patents, and possibly other things.) I think Bellcore is providing a service like that. Check out their WWW site (www.bellcore.com) //---------------------------------------------------------------------------- // John A. Limpert // johnl(a)radix.net

1 0

Re: something to scare the *piss* out of ya
by Tim Scanlon 17 Dec '03

17 Dec '03

If this story is true, and can be substantiated, why the hell wern't the cops involved prosecuted, or walked out to a wall and summarily shot for crimes against humanity. The last time I checked torture and dismemberment were war crimes, and intolerable behavior in civilized nations. If it *IS* true there goddamn well should be congressional hearings on it. I would suggest contacting any of the local news media in DC, but would reccommend the local ABC affiliate, WJLA for contact since they are in the midst of tearing the ATF a new asshole (and are going to do the same to the FBI tomorrow night from what they say) over the Waco raid. The ABC affiliate here has caused new Senate hearings apparently, it seems that the longer things go on, the more nastiness is dragged out on this. If this bit wasn't true, then it's despicable propaganda, and anyone involved with it's distribution should be ashamed of themselves. I do not believe liberty and democracy can easily survive if citizens or public servants lie. True strength lives in honest discourse and the actions of reasoned men, acting in a thoughtful and honest manner. It's damned easy to run around splattering the net with nasty scare stories about the evils of LEO's, but it takes a bit more to actually do something. I'd say with stuff like this the best course would be to put up, and contact your elected offcials, or shut up. Becasue if it is true, no decent person should tolerate it. And if it isn't, damn the persons who lie for obscuring the truth. Tim Scanlon ________________________________________________________________ tfs(a)vampire.science.gmu.edu (NeXTmail, MIME) Tim Scanlon George Mason University (PGP key avail.) Public Affairs I speak for myself, but often claim demonic possession

1 0

Re: Dr. Seuss, Technical Writer
by Christopher.Baker＠f14.n374.z1.fidonet.org 17 Dec '03

17 Dec '03

In a message dated: 11 Jul 95, you stated: > What If Dr. Seuss Did Technical Writing? > > Here's an easy game to play. > Here's an easy thing to say: what if there was a complete version of this rhyme? --- Following message extracted from REC.ORG.MENSA @ 1:374/14 --- By Christopher Baker on Thu Dec 15 11:27:49 1994 From: Mike Steiner To: All Date: 15 Dec 94 02:40:52 Subj: Bits in a Box From: steiner(a)best.com (Mike Steiner) Organization: Society for the Preservation of Endangered Societies A Grandchild's Guide to Using Grandpa's Computer Bits Bytes Chips Clocks Bits in bytes on chips in box. Bytes with bits and chips with clocks. Chips in box on ether-docks. Chips with bits come. Chips with bytes come. Chips with bits and bytes and clocks come. Look, sir. Look, sir. Read the book, sir. Let's do tricks with bits and bytes, sir. Let's do tricks with chips and clocks, sir. First, I'll make a quick trick bit stack. Then I'll make a quick trick byte stack. You can make a quick trick chip stack. You can make a quick trick clock stack. And here's a new trick on the scene. Bits in bytes for your machine. Bytes in words to fill your screen. Now we come to ticks and tocks, sir. Try to say this by the clock, sir. Clocks on chips tick. Clocks on chips tock. Eight byte bits tick. Eight bit bytes tock. Clocks on chips with eight bit bytes tick. Chips with clocks and eight byte bits tock. Here's an easy game to play. Here's an easy thing to say.... If a packet hits a pocket on a socket on a port, and the bus is interupted as a very last resort, and the address of the memory makes your floppy disk abort then the socket packet pocket has an error to report! If your cursor finds a menu item followed by a dash, and the double-clicking icon puts your window in the trash, and your data is corrupted cause the index doesn't hash, then your situation's hopeless, and your system's gonna crash! You can't say this? What a shame, sir! We'll find you another game, sir. If the label on the cable on the table at your house says the network is connected to the button on your mouse, but your packets want to tunnel on another protocol, that's repeatedly rejected by the printer down the hall, and your screen is all distorted by the side-effects of gauss, so your icons in the window are as wavy as a souse, then you may as well reboot and go out with a bang, cause as sure as I'm a poet, the sucker's gonna hang! When the copy of your floppy's getting sloppy on the disk, and the microcode instructions cause unnecessary risc, then you have to flash your memory and you'll want to RAM your ROM. Quickly turn off your computer and be sure to tell your mom! (God bless you Dr. Seuss wherever you are!) +----------------------------------------------------------------------+ Origin: COBRUS - Usenet-to-Fidonet Distribution System (1:2613/335.0) -30- TTFN. Chris -- | Fidonet: Christopher Baker 1:374/14 | Internet: Christopher.Baker(a)f14.n374.z1.fidonet.org | via Borderline! uucp<->Fido{ftn}gate Project +1-818-893-1899

1 0

Re: general RC4 key searcher: optimisations anyone?
by Jonathan Shekter 17 Dec '03

17 Dec '03

>/* RC4 Brute Force Key Searcher, by Andy Brown 1995 > >This part of the package is meant to be portable between most systems >so that Unix users can take part in the searching. After all, the >kind of really high powered systems that can make a large dent in the >key space are not running Windows NT. You will, however, require Umm... ever hear of an Alpha? Besides which, this will compile on NT, and just about every other OS known to man, so it's a moot point. >#define SwapByte(a,b) ((a)^=(b),(b)^=(a),(a)^=(b)) If the two values are in memory (which they are as you swap state vector elements) then this xor trick requires three read-modify-write cyles -- slow on any architecture. Use a temp variable instead. >/* prepare the key */ > >for(counter=0;counter<256;counter++) >state[counter]=(unsigned char)counter; This is bad. Use either a) memcpy as in bruterc4 or b) an unsigned long, starting at either 0x00010203 or 0x03020100 depending on endianness, adding 0x04040404 at each iteration to generate four bytes per shot. Remember, on most machines a 32-bit store is the same speed as an 8-bit store. The fastes I have been able to do on this section was obtained by unrolling the loop manually, and using *two* long variables, alternating, to remove instruction dependancies. >for(counter=0;counter<256;counter++) > >index2=(key[index1]+state[counter]+index2) & 0xFF; >SwapByte(state[counter],state[index2]); > >if(++index1==keybytes) >index1=0; 1) This loop needs to be unrolled! Using direct array offsets instead of incrementing the counter is a speedup on many machines. Also, experiment with the unroll size. Making it larger increases performance until you get too big to fit in the cache, at which point it slows down. My experiments on a few different types of machines showed that unrolling the inner loop 16 or 32 times was usually about right. See the inner loop of bruterc4. Use macros to do the unrolling. 2) You can avoid the if statement for checking for key wrap around as follows: in your initialization, construct an array as follows: for (i=0; i<keysize-1; i++) transtbl[i] = i+1; transtbl[i] = 0; Then, after each iteration: index1 = transtbl[index]; Viola, no if statements, no divides or mods. On many architectures this is worth the trouble as branches are expensive. Obviously, though, test this >/* do two RC4 operations as a preliminary test. If this fails then test >the next one, then the rest. This should result in a lot of rejections >before the rest of the loop is entered */ I like the early-out test. >x=(x+1) & 0xFF; >y=(state[x]+y) & 0xFF; >SwapByte(state[x],state[y]); Again, swapping with xor probably hurts you here. Use a register temp variable. My personal keycracker accepts general length keys and is not too much slower than bruterc4. So it can be done. - Jonathan -- ____________________________________________________ / Jonathan Shekter / / / Graphics Hack / "Probability alone / / Alias/Wavefront / dictates that I exist" / /______________________/____________________________/

3 2