- cypherpunks-legacy - lists.cpunks.org

FREE CASH GRANTS, NEVER REPAY!!
by estlang＠crazyspeedneed.com 22 Feb '01

22 Feb '01

1 0

don't look
by sportinggoods＠excite.com 22 Feb '01

22 Feb '01

1 0

don't look
by sportinggoods＠excite.com 22 Feb '01

22 Feb '01

1 0

Re: Harvard mathematician creates 'provably unbreakable' code (fwd)
by Jim Choate 22 Feb '01

22 Feb '01

____________________________________________________________________ Before a larger group can see the virtue of an idea, a smaller group must first understand it. "Stranger Suns" George Zebrowski The Armadillo Group ,::////;::-. James Choate Austin, Tx /:'///// ``::>/|/ ravage(a)ssz.com www.ssz.com .', |||| `/( e\ 512-451-7087 -====~~mm-'`-```-mm --'- -------------------------------------------------------------------- ---------- Forwarded message ---------- Date: Wed, 21 Feb 2001 17:26:13 -0800 (PST) From: Bram Cohen <bram(a)gawth.com> To: hal(a)finney.org Cc: Pete.Chown(a)skygate.co.uk, coderpunks(a)toad.com, crypt(a)bxa.doc.gov Subject: Re: Harvard mathematician creates 'provably unbreakable' code On Wed, 21 Feb 2001 hal(a)finney.org wrote: > for i = 1 to m do > for j = 1 to n do > if j is an element of s then > R and S store alpha[j][i] > end for j > S and R set X[i] = xor of stored alpha[j][i] values (k of them) > S sends M[i] xor X[i]; R recovers M[i] by xoring with X[i] > end for i Interesting. Something I came up with may be relevant - http://gawth.com/bram/essays/unrelated_xors.html I explained this to Ian Goldberg, who agreed that both conjectures are completely obvious, and also couldn't see a way of proving them. If anyone could forward this around I'd much appreciate it - it seems like worthwile work, but I haven't figured out how to even try to get it published anywhere - even the front outright ignores submissions from people with no academic affiliation. -Bram Cohen "Markets can remain irrational longer than you can remain solvent" -- John Maynard Keynes

1 0

Your responses: The Key Vanishes
by Dan Darden 21 Feb '01

21 Feb '01

I stumbled upon your responses to the NYT article about the unbreakable crypto. I agree with your points and feel they are quite vaild. However, I'd like to toss something else out. In order for one to assure that the random number generator was authentic it would have to be trusted to an even greater extent, using an unbreakable system of its own, or perhaps the same system. It seems that this would develop a certain paradox of sorts. How does the user exemplify trust in the system? If another source was interceded or interposed in the way of the 'true' source, all one would have to do is make the random 'pattern' long enough and the encrypted data could be easily retrieved. The question is how do you ensure the trust of the generator. Satellites aren't fooproof. How can the unbreakable satellite encrypt itself? If this message has violated your rights in any way I do apologize, your address has not been added to any kind of list. This is a personal message. Sincerely, Dan Darden. ===== ----------------------------------- Contact me at ddarden(a)tamu.edu with questions concerning all of your information security needs. ----------------------------------- __________________________________________________ Do You Yahoo!? Yahoo! Auctions - Buy the things you want at great prices! http://auctions.yahoo.com/

1 0

Blowout XXX ONLY $7.99 Each
by Super Special Videos 21 Feb '01

21 Feb '01

INFORMATION: This is not a spam. You have been sent this special email offer because you are a previous customer of the owner of this email list. You have not opted out of this mailing list. If you wish to opt-out, please see the information below. SUPER SALE for ONLINE customers ONLY...$7.99 XXX Videos!!! http://www.supersexdvd.com/specialoffer/ Each week, we offer massive discounts ONLINE ONLY on best-selling products, ALL FETISHES, from www.DirectVideoandDVD.com. This week, we are clearing out our overstocked warehouse!!! Super hardcore videos ONLY 7.99 each!! Two hours, four hours, and more. Plus, you get 50% OFF a special sex toy. Click this link below to check it out or copy and paste it into your web browser... DO IT NOW!!! THIS OFFER EXPIRES IN A WEEK!!! http://www.supersexdvd.com/specialoffer/ Want to see some SUPER COOL LINKS??? For SQUIRTING PUSSIES AND HOT BABES PEEING, visit www.squirtingpussypalace.com. For FREE access to 100's of XXX videos on demand, from 56K to Broadband, visit www.freesexmoviesonline.net. For FREE access to one of the most popular sex membership sites on the web, visit www.sensations.com. For gay sex membership, visit www.sensationsgay.com. For the lowest priced adult videos, DVDs, and toys, visit www.directvideoanddvd.com. For FREE adult videos with NO gimmicks, visit www.freesexmovieclub.com. For FREE adult DVDs with NO gimmicks, visit www.directdvdclub.com. For VIAGRA and many other prescription drugs online, visit http://www.1stviagraonlinepharmacy.com/default.asp?rid=1000 The BEST Phone SEX for CHEAP!!! Call one of these numbers TODAY! From $1.99/min. Must be 18. 888-316-2866 (CUMM) Cum Cravers 888-387-2742 (ASIA) Asian 888-340-4999 (4XXX) Big Boob 888-458-2522 (BLACK) Interracial (black girls) 888-240-2232 (ACDC) She-male 800-549-4865 (HUNK) Gay INFORMATION: As strong supporters of the Unsolicited Commercial Electronic Mail Act of 2000, which is making it's way through Congress, you may reply to us here at anytime or email us your question or comments to mailto:customerservice@lte.net. You are a previous customer of the owner of this email list and have opted-in to special offers and discounts. If you wish to be removed from all future mailings from our company, you may be taken off of our mailing list immediately by clicking HERE now. mailto:leave-primetime-181856V@offers.lte.net Please be advised by removing your name you will not be eligible for our super special offers that are only for opt-in emailed customers only.

1 0

An Important Announcement to Driveway Users
by registration＠driveway.com 21 Feb '01

21 Feb '01

Dear Driveway user, PLEASE READ THIS ENTIRE MESSAGE. IT CONTAINS IMPORTANT INFORMATION ABOUT THE FILES THAT YOU STORE ON DRIVEWAY. As of March 5th, 2001, Driveway will discontinue all Driveway.com file sharing and storage services. We have appreciated your support and use of Driveway. Effective immediately, Driveway is no longer accepting new user registrations, file uploads or purchases of additional space. After March 5th, 2001, you will no longer be able to access any files stored at Driveway.com. To make sure you continue to have global access to the data in your Driveway account, Driveway recommends that you sign up for a FreeDrive account. For file transfer, download the data in your Driveway account to your desktop. Then, use FreeDrive's FD Desktop feature to easily drag and drop your Driveway files from your computer to FreeDrive. FreeDrive is the largest online file storage service with over 12 million members. In addition to 50 MB of Free space, FreeDrive also offers Chat, CD Burning, Photo Albums, and more. Just click the link below to sign up: <http://www.freedrive.com/ASP/PostLinkClick.asp?lid=15540&noqs=1> Again, we thank you for your support of Driveway. Also, please note that in accordance with our privacy policy, all user identity information and files stored on the Driveway.com web site will be deleted once services are discontinued. If you would like to read more about our service terms and conditions, all of which are subject to the contents of this message, please access them on our corporate web site: http://corp.driveway.com/corp/prod/terms.html Your member name is: cypherpunks(a)toad.com Your password is: cypherpunks Driveway URL: http://www.driveway.com Sincerely, The Driveway Team

1 0

Optical computing and Relativity
by Jim Choate 21 Feb '01

21 Feb '01

Assume we have a generator of entangled photons. We send one stream through the recent 'slow light' technology. We measure the non-slowed photon. When does the slowed photon fix its state? Would this not allow you to tap a crypto channel w/o the legitimate parties being aware? ____________________________________________________________________ Before a larger group can see the virtue of an idea, a smaller group must first understand it. "Stranger Suns" George Zebrowski The Armadillo Group ,::////;::-. James Choate Austin, Tx /:'///// ``::>/|/ ravage(a)ssz.com www.ssz.com .', |||| `/( e\ 512-451-7087 -====~~mm-'`-```-mm --'- --------------------------------------------------------------------

1 0

Privacy Lecture Series - Feb. 28 - European cybercrime law & implications for privacy
by Robert Guerra 21 Feb '01

21 Feb '01

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 PRIVACY LECTURE SERIES <http://privacy.openflows.org> "European cybercrime law and its implications for privacy" Wednesday, February 28 7:00 to 8:30 p.m. Ian (Gus) Hosein Privacy Technology Officer Zero-Knowlege Systems, Inc. 140 St. George, Room 728 Faculty of Information Studies (building adjacent to Robarts Library) University of Toronto Toronto, Ontario Canada This lecture will focus on the new European/international cybercrime law, which was drafted specifically to deal with the cross-border nature of much computer-related crime. As the name indicates this law stems from the European Union, but it has been endorsed by the United States and Canada. When finished the law will be opened for signature worldwide. This lecture will not only explain the particularities of the law but also how it affects privacy worldwide. Ian (Gus) Hosein is a Tutorial Fellow and doctoral student at the London School of Economics. For three years Gus has lectured to undergraduate and postgraduate students on privacy, philosophy and politics of technology, regulation, cryptography policy, networks, and the concept of the Information Society. In his spare time he works with Privacy International, is a Policy Counsel for ZeroKnowledge Systems, and is an Advisory Council member of the Foundation for Information Policy Research. A Toronto native, he is a survivor of the University of Waterloo; but now lives in England partly because of the prevalence of pubs. The lectures are free of charge, and there is NO need for registration. If you would like to receive announcements for the Privacy Lecture Series please register at <http://privacy.openflows.org> For more info contact: Ana Viseu <ana.viseu(a)utoronto.ca> Robert Guerra <robert(a)cryptorights.org> - ----++++----++++---- Tudo vale a pena se a alma nco i pequena. http://fcis.oise.utoronto.ca/~aviseu - ----------------- Privacy Lecture Series Announcement http://privacy.openflows.org -----BEGIN PGP SIGNATURE----- Version: PGP 6.5.2 iQA/AwUBOpRamT/LvgW6Rtg3EQLmOwCg4XOSD7wnzHShghU6NaQA4cx7Gb4An243 UIxbos/yeEMIY8l4ernG10/V =F0Ex -----END PGP SIGNATURE----- -- --- Robert Guerra <rguerra(a)cryptorights.org> WWW Page <http://www.cryptorights.org>

1 0

Re: Harvard mathematician creates 'provably unbreakable' code (fwd)
by Jim Choate 21 Feb '01

21 Feb '01

____________________________________________________________________ Before a larger group can see the virtue of an idea, a smaller group must first understand it. "Stranger Suns" George Zebrowski The Armadillo Group ,::////;::-. James Choate Austin, Tx /:'///// ``::>/|/ ravage(a)ssz.com www.ssz.com .', |||| `/( e\ 512-451-7087 -====~~mm-'`-```-mm --'- -------------------------------------------------------------------- ---------- Forwarded message ---------- Date: Wed, 21 Feb 2001 14:22:26 -0800 From: hal(a)finney.org To: bram(a)gawth.com, Pete.Chown(a)skygate.co.uk Cc: coderpunks(a)toad.com, crypt(a)bxa.doc.gov Subject: Re: Harvard mathematician creates 'provably unbreakable' code Let me tell you how the Rabin system works in the Crypto 99 paper. I'll do it as pseudo code and copy it to BXA so everything is kosher. Basically they generate a one time pad by xoring a random subset of the message bits, where the subset indices are agreed upon in advance by the communicants: Security Parameter k // Error probability = 1/2^(k/5) Random data length PER MESSAGE BIT n = 5E // E is maximum size of adversary memory Message Length m //bits Message M = {M_1, ..., M_m} // m bits long Secret key s = {sig_1, ... sig_k} // each in range 1-n, k of them Random data alpha[n][m] // n*m bits long One Time Pad X[m] // Will be xored with M for i = 1 to m do for j = 1 to n do if j is an element of s then R and S store alpha[j][i] end for j S and R set X[i] = xor of stored alpha[j][i] values (k of them) S sends M[i] xor X[i]; R recovers M[i] by xoring with X[i] end for i For each message bit M_i we need to use 5*E random bits, where E is the estimate of the maximum amount of memory the adversary can hold. For example if Eve can store 100 Tbits, we need to use up 500 Tbits of data for each message bit. To send say a 1 Mbit message that is, well, it's a lot. 500 exabits. (It goes giga, tera, peta, exa. Then zetta and yotta.) The initial shared secret key is simply k indexes in the range 1-n, where k is the security parameter such that the guaranteed probability of failure is bounded by 1/2^(k/5). k = 300 would give a security level of 2^60. The size of the initial shared secret key is therefore k log n, so with k = 300 and n = 2^49 as above, this is about 15000 shared key bits. So I would say no, this 1999 scheme is not practical. Maurer's original approach used only n random bits in total, not n bits per message bit, but it did not have as strong provability. The authors leave it as an open problem whether they can achieve similar levels of provable security using n bits total, which would make it much more practical. Maybe the new result presented in the Times fixes this problem and reduces the data quantity to something sane. Hal

1 0