January 2001 - cypherpunks-legacy

don't miss out
by sportinggoods＠excite.com 24 Jan '01

24 Jan '01

1 0

own your own business within 24 hours
by sportinggoods＠excite.com 24 Jan '01

24 Jan '01

1 0

Archrives of cypherpunks@toad.com
by Alex B. Shepardsen 24 Jan '01

24 Jan '01

Lori, You are aware, aren't you, that everything you have sent to the Cypherpunks list is viewable on the web? http://www.inet-one.com/cypherpunks I wonder what your son will say when he sees this. Enjoy!

1 0

Re: FC: Supreme Court agrees to hear morphed kiddie porn case
by George＠Orwellian.Org 24 Jan '01

24 Jan '01

I hope there is a separate sub-challenge on someone being caught with non-children-"child porno" being labeled a sex offender. Talk about thought crime...

1 0

FREE LIVE SEX
by Garam Naram 24 Jan '01

24 Jan '01

Give me more informationon how i can have free live sex

1 0

Reason magazine - What the future holds...
by Jim Choate 24 Jan '01

24 Jan '01

http://reason.com/hod/rb110900.html -- The Laws of Serendipity: 1. In order to discover anything, you must be looking for something. 2. If you wish to make an improved product, you must first be engaged in making an inferior one. Tivoli Certification Group, OSCT James Choate jchoate(a)tivoli.com Senior Engineer 512-436-1062

1 0

Re: Some other math/crypto sci-fi
by Foobulus Baracculus 24 Jan '01

24 Jan '01

... Alan Olsen: wouldn't that be perfect? a "collectable patent card game", as a way to criticise patents (by using the most ridiculous ones on the cards), which in itself violates a patent... hm, I like the idea... "combine the 'patent for display of blablah' with the 'method or device for remote information acquisition' and you can cross-license that against your enemie's 'global computer network patent' for 10 points." ... This would be a fabulous way of introducing young children into the new emerging world. One of the strategies of the game would be to build a patent portfolio. For example, you have developed an idea, and now you need to take out something like 250,000 patents on anything and everything possible and even likely to be tenously linked to protecting your idea, anything near your idea, and how to produce your idea, or sell your idea, or do anything likely to be possible with your idea. Your opponent pays the role of a patent lawyer, trying to navigate through every little crack in your patent portfolio armour. It would be a wonderful way of illustrating how one simple creative idea requires ten times as much creative ideas just to protect that original idea. An excellent introduction to the simplicity of the contemporary world. Foobulus Barraculus _________________________________________________________________________ Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.

2 1

ScienceDaily Magazine -- To Protect Data From Power Blackouts, Store On Internet, Says UC Berkeley Researcher
by Jim Choate 24 Jan '01

24 Jan '01

http://www.sciencedaily.com/releases/2001/01/010123074839.htm -- The Laws of Serendipity: 1. In order to discover anything, you must be looking for something. 2. If you wish to make an improved product, you must first be engaged in making an inferior one. Tivoli Certification Group, OSCT James Choate jchoate(a)tivoli.com Senior Engineer 512-436-1062

1 0

Light my fire, Lori
by Blank Frank 24 Jan '01

24 Jan '01

At 08:53 PM 1/23/01 -0500, Lori Banks wrote: >Mr. May, > >Actually ..... he tells me that he hasn't forgotten it at all .... he says >that he knows that he should allow me to have access, that he's being >stubborn, and that he doesn't know why he's not giving it up He does not want to tell you (to your face) that he is self-sovereign, not your property any more. ... must be a >"Hackers Oath" or something that's not allowing him to divulge it Sealed with blood & semen of course... have pets been disappearing in your neighborhood recently? ... I >think that he's hiding something personally .... something that will hurt >our relationship Yeah maybe he's a control freak too. -- what he doesn't realize, of which I've tried dilligently >to explain to him is that I love him unconditionally Juss wike a widdle puppy... >... of course, I haven't told you that he has developed a hackers website in >which he has made some wonderful programs ... beautiful programming, I mean >... but they are programs that flood the chatrooms -- "just to see if I >could do it" So he manufactures and distributes tools used for criminal denial of service? Do go on, dear lady.. >... and a ban program ... "they banned me for flooding and I >just want to play the game ... so I had to create a ban program" You'll let us in to search his computer, now, won't you? We don't need to bother with a nasty warrant now, do we? You don't want to be an accomplice, do you? He might still be able to be treated as a juvinile... ... see, I >told you that he's very bright!! Yes, intelligence isn't entirely hereditary dearie.. >.... just want to see him use it for a good >purpose ... one that he can look back on and feel accomplishment..... so >does this light give anymore fuel to someone's thoughts? > >Thanks again, >Mrs. Banks Oh yes, we like to light your fuel. More, please. Anything you say can and may be used against you. Plus, its archived. Forever. Your Permenent Record, baby.

1 0

RE: using braid groups vs. number theory for pki
by Phillip Zakas 24 Jan '01

24 Jan '01

great info, thanks! -----Original Message----- X-Loop: openpgp.net From: owner-cypherpunks(a)Algebra.COM [mailto:owner-cypherpunks@Algebra.COM]On Behalf Of dmolnar Sent: Wednesday, January 24, 2001 1:44 AM To: Multiple recipients of list Subject: Re: using braid groups vs. number theory for pki On Wed, 24 Jan 2001, Phillip Zakas wrote: > mathematics seems to imply much faster encryption/decryption engines. > Before I spend the next month working through this, does anyone know of a > braid group-based encryption/decryption engine? Did it work? Any > cryptanalysis on this? Helger Lipmaa's truly amazing collection of links reveals "Practical comparison of Fast Public-key Cryptosystems" P. Karu, J. Loikkanen http://www.tml.hut.fi/~pk/crypto/fast_pk_crypto.ps which is an account of an implementation of braid group encryption and a performance comparison to ECC and NTRU. The implementation was done in C++, so I bet your assembly version would kill it - but of course you'd have to do the same for NTRU to acheive proper comparison... (I didn't see it available for download - maybe contact the authors) The rest of the links are worth checking out as well. http://www.tml.hut.fi/~helger/crypto/link/public/braid/ and include some cryptanalysis and other links. Be careful when reading these - the "word problem" is not what you may think it is, and some of the cryptosystems seem to depend on more than just the word problem for their security. If you have a good library nearby, you may want to look for Rotman's _Introduction to Combinatorial Group Theory_ as a guide; it's the best introduction I've found so far to the general issues. Short answer to "is it secure" is "maybe." Keep in mind that all you need these days is a very weak trapdoor function and then you can "boost" it to create a full public key cryptosystem. So if we can find any "hardness" at all, that may be enough. > > Also, does anyone have any stats on the performance of popular pki systems? Sorry, don't know more here than "look for white papers." Most of which probably won't help you. -David

1 0