December 2003 - cypherpunks-legacy

No Subject
by concerned＠aol.com 17 Dec '03

17 Dec '03

Oct.30th,1998 Y2K Solution! 8 Pine Circle Dr., Silicon Valley, Calif. OTC Company "TCFG" 21 st. Century Frontier Group has through several members of their administrative research department leaked vital information about their companies efforts. Everyone was tight lipped and interviews were refused, and through un-named sources we have learned that the technology and software solution are in the process of being patented! In over 1640 trials, using various data systems the use of the new technology and software solved the Y2K problem 100% of the time. This small publicly traded company "TCFG" which is just 3 years old is through various sources now negotiating with the "Big Boys"! "TCFG" the letters to look for!

1 0

test
by Igor Chudov ＠ home 17 Dec '03

17 Dec '03

test

1 0

Re: Shuffling (fwd)
by Jim Choate 17 Dec '03

17 Dec '03

Forwarded message: > Date: Thu, 29 Oct 1998 19:22:52 +0100 > From: Anonymous <nobody(a)replay.com> > Subject: Re: Shuffling > For any N greater than two, the random-swap algorithm cannot produce > a perfectly smooth randomization of A[N]. If by 'perfectly smooth randomization of A[N]' you mean that any two members of A[N] have equaly likelyhood to be swapped, and hence any pattern of A[N] members being possible with equal odds then this is incorrect. For that arrangement to be relevant your (P)RNG function must choose any element from 0 to N with equal odds, it's probability curve must be a horizontal line at 1/n for each N. If it ain't you aren't going to randomly shuffle the elements of A[] since each element doesn't have the same odds of being selected in this (or every other) turn. > A perfect randomization of A[N] would give equal probability to each of > the N! (N factorial) possible rearrangements of A. Ah, but there aren't N! rearrangements of A if we are limited to only swapping two elements. There are at best n^2. Allow me to explain... > Each iteration of the random-swap algorithm makes two choices of the N > values to swap. There are N^2 possible ways these two choices could go. Ok, we shoot off our first random number, 1/n. We then shoot off our second random number, also 1/n. The combination is 1/n * 1/n or 1/n^2. Now if we add the stipulation about the i'th and i+1'st numbers not being identical then the odds are 1/n * 1/n-1 (note that this boundary condition is artificial and may in fact be problematic, there is no logical reason to keep i and i+1 from being the same n if we want truly random behaviour). > To calculate the probabilities after an iteration, we try all the N^2 > choices and count how many instances of each arrangement are produced. Huh? What probability are we calculating here, the odds of getting the particular pattern we have now generated? If so that is either 1/n^2 or 1/n(n-1) depending on the boundary condition. > This gives each possible arrangement a probability in the form of > k/N^2, where k of the N^2 choices led to that arrangement. What arrangement, the one we start with before or after the swap? If we start with arrangement I and then swap two elements we get I+1. There are only two ways to get to any particular arrangment. An identical arrangement where we swap i with itself (ignoring the potential boundary condition) and the arrangement where the l'th and j'th elements are swapped. As long as we're only swapping two elements there can only be two possible parent patterns for any given resultant pattern. Now if we swap more than 2 elements it gets big fast. I seem to be reading an implication that given a particular pattern, I, there is some rhyme or reason to the pattern of previous I's that got us here, there isn't. For any given pattern there is a infinite number of potential paths that would get to any particular. Let's say we have: [ 0 1 2 4 3 ] and we shuffle and get, [ 0 4 2 1 3 ] or, [ 0 1 2 4 3 ] Now if the question is how many possible ways could be have gotten to the original, [ 0 1 2 4 3 ], then there are two ways to calculate that, given no stipulation on reptitions we get: n^2 given a stipulation for no repetitions we get: (n)(n-1) We can generalize this somewhat if we let s represent our current sequence and our goal is to determine the number of possible previous states the sequence could have held. s-1 = n^2 or, s-1 = n(n-1) Now if we want to calculate the number of possible parent generations for s-1 *from the perspective of s0* we get: s-2 = (s-1)^2 = (n^2)^2 or, s-2 = (s-1)((s-1)-1) = (n^2)((n^2)-1) Thus, s-3 = (s-2)^2 = ((s-1)^2)^2 = ((n^2)^2)^2 or, s-3 = (s-2)((s-2)-1) = ( (n^2)((n^2)-1) )( ((n^2)((n^2)-1) )-1) = (n^4 - n^2)( (n^4 - n^2) - 1) for the second form only, s-4 = (s-3)((s-3)-1) = ((n^4-n^2)((n^4-n^2)-1))(((n^4-n^2)((n^4-n^2)-1))-1) = ((n^4-n^2)^2 - (n^4-n^2)) (n^4-n^2)^2-(n^4-n^2))-1) (I'm going to stop here trying to resolve this equation, I don't have the time. Note that the relation is i(i-1) for each generation so we only need to affix a relation to i and the generation number. It's worth noting this can be resolved recursively.) These can be generalized for the first form to: C(s-i) = n^(2^i), where i is the number of generations going back. The inverse makes a handy measure of entropy as well as telling you the odds of selecting any particular path from one pattern to another pattern given the number of elements swaps that are allowed. ____________________________________________________________________ To know what is right and not to do it is the worst cowardice. Confucius The Armadillo Group ,::////;::-. James Choate Austin, Tx /:'///// ``::>/|/ ravage(a)ssz.com www.ssz.com .', |||| `/( e\ 512-451-7087 -====~~mm-'`-```-mm --'- --------------------------------------------------------------------

1 0

No Subject
by Mixmaster 17 Dec '03

17 Dec '03

Can someone do a fill in/summary/recapitulation? I'm not sure I understand all of this and the MIB stuff... -----Original Message----- From: Anonymous <nobody(a)replay.com> To: cypherpunks(a)toad.com <cypherpunks(a)toad.com> Date: Tuesday, October 27, 1998 8:45 PM :[Two letters received by fax on 27 October 1998] : :---------- : :[Letter 1, cover and 16 pages] : :8 September 1998 : :Cover Sheet : :Declan : :The Good News is that I have a pen to write :with, due to the Free Enterprise System being :alive & well within the Prison System. : :The Bad News is that Micro$oft Pens (TM) :controls 95% of the market... : :I am hoping you can share as much of this :communique as possible with the CPUNX, :since my chain is constantly getting yanked :in different directions, making outside contact :sporatic & unreliable. : :Feel free to reserve for your own use any :of the enclosed information you need for your :own journalistic purposes. : :I will try to reach you by phone (automated :collect-call system requiring touch-tone on :your end). : :Thanks for the Mags, : : CJ Parker : :ps# My prison cell mirror now reads, :"Chocolate Skelter." (Brownie & Milk) : :------------------------------------------------ : :[FLORENCE NUTLY NEWS - "I'M HERE BECAUSE I :believe that the KONTROLLERS are taking :actions that create obstacles to the freedom :and openess of the Internet. ~Truth Glaser] : :Declan, : :Looks like you may be receiving the *only* copy :of the Florence Nutly News, since I have, up :until now, been writing on paper towels and :medicine cups, using combinations of blood, :sperm and chocolate (two of which are in short :supply) for ink, and I will soon be headed :to Nutly News Head (pardon the pun) Quarters :in Springfield, Missouri, for Rewiring of :my Brain Circuity.

1 0

No Subject
by informant＠earthlink.net 17 Dec '03

17 Dec '03

10/30/98 Y2K Solution! 8 Pine Circle Dr., Silicon Valley, Calif. OTC Company "TCFG" 21 st. Century Frontier Group has through several members of their administrative research department leaked vital information about their companies efforts. Everyone was tight lipped and interviews were refused, and through un-named sources we have learned that the technology and software solution are in the process of being patented! In over 1640 trials, using various data systems the use of the new technology and software solved the Y2K problem 100% of the time. This small publicly traded company "TCFG" which is just 3 years old is through various sources now negotiating with the "Big Boys"! "TCFG" the letters to look for.....

1 0

Re: Random array (fwd)
by Jim Choate 17 Dec '03

17 Dec '03

Forwarded message: > Date: Thu, 29 Oct 1998 20:04:57 -0800 > From: Jim Gillogly <jim(a)acm.org> > Subject: Re: Random array > One could modify Greg's suggestion slightly by attaching an auxiliary > array of 256 random numbers to each of the members of the original > array and then using the most efficient handy sort algorithm to sort > those random numbers, dragging along their associated original array > elements. This way it doesn't have a chance to interfere with the > operation of the sorting algorithm, at the cost of an extra array. So you've got a set of arrays that have 256 numbers in them, whether they are random or not is irrelevant since we're going to sort them and break their randomness. It is merely sufficient that they all be reasonably (what the hell ever that's going to mean) different, if they're all 6's for example it isn't going to be very interesting. If I understand the process. Each array would cycle through in parallel sorting 2 elements of each array. Once that was finished we'd then sort the arrays themselves according to some process. From your description it seems to imply that you're going to sort the 1st element descending at that point. This in effect mis-orders each array after every sort. This sort of system is an IFS and could lead to determinism (ie a cycle of sort patterns that repeat endlessly) or chaos (ie a pattern that doesn't repeat). It in and of itself doesn't guarantee any randomness merely a continously munged sort. ____________________________________________________________________ To know what is right and not to do it is the worst cowardice. Confucius The Armadillo Group ,::////;::-. James Choate Austin, Tx /:'///// ``::>/|/ ravage(a)ssz.com www.ssz.com .', |||| `/( e\ 512-451-7087 -====~~mm-'`-```-mm --'- --------------------------------------------------------------------

1 0

Jim Gilmore
by Information Security 17 Dec '03

17 Dec '03

> from ppoole(a)fcref.org CfCL Weekly Update 10/30/98 ***** Companies Create New Crypto Back Door Hewlett-Packard and Wave Systems announced Tuesday that they have developed a new programmable chip that can be adjusted to match prevailing encryption policies. This system will only allow a computer to encrypt data to the maximum level that local regulations allow. The new program, called EMBASSY, must be registered with a "designated local authority", who will activate the cryptography application. The companies behind EMBASSY are hoping that the program will meet the new Department of Commerce encryption export standards, which currently place a 56-bit limit on exported software applications. While 90 percent of countries have no domestic-use policies, the program allows law enforcement agencies that mandate key recovery features, such as France, to be able to obtain access to a user's encrypted files under certain circumstances. Several countries, including the UK, Germany, France, Denmark, Japan and Australia have already approved the technology. The US will not issue export license until they are certain that the recovery elements have been tested. Privacy advocates were critical of EMBASSY. Jim Gilmore, co-founder of the Electronic Frontier Foundation, expressed concern that the cooperation of Hewlett-Packard and Wave Systems with the government may lead to more surreptitious features being included into the program. "What other black boxes have they put in this chip? Keystroke monitoring? Recording traffic across the bus?" asked Gilmore. "If they're giving you a black box, who's to say what other capabilities are actually in that chip?" Read this related WIRED News article: http://www.wired.com/news/news/technology/story/15848.html

1 0

Re: cohen predicts army patrols US streets
by Anonymous 17 Dec '03

17 Dec '03

>"Terrorism is escalating to the point that Americans soon >may have to choose between civil liberties and more >intrusive means of protection," says Defense Secretary >William S. Cohen This is the classic intro into a dictatorhip and militarisation of a society. I wonder if someone can dig up Hitler's speeches on the subject. >"It could happen here," Cohen said he conclued after 8 >months of studying threats under the Pentagon microscope. Sure. I bet this has nothing to do with the surge of false "bomb threats" in Austin and SIlicon Valley high-tech companies or flooding mass media with descriptions of dangers from domestic terrorism. Public must be aware of the "presence" of undesirables first. Who is it going to be this time, after cpunks are dealt with ?

1 0

William H. Gates III
by Information Security 17 Dec '03

17 Dec '03

Leading digits "539"...what state was he born in? ---guy ====================================================================== SCAN THIS NEWS 10/29/98 The following information is posted on the U.S. Securities and Exchange Commission's (SEC) "EDGAR" database located at: http://www.sec.gov/edaux/formlynx.htm In the "Enter a company" box, search on - "MICROSOFT CORP" You'll find the following file - Date Filed Forms CIK Code Company Name "02-07-1996 SC 13G/A 789019 MICROSOFT CORP" Click on this link and you'll find the following information - MAIL ADDRESS: STREET 1: ONE MICROSOFT WAY - BLDG 8 STREET 2: NORTH OFFICE 2211 CITY: REDMOND STATE: WA ZIP: 98052-6399 FILED BY: NAME OF REPORTING PERSON S.S. or I.R.S. Identification No. of Above Person William H. Gates III Social Security #: 539-60-5125 SECURITIES AND EXCHANGE COMMISSION Washington, D.C. 20549 SCHEDULE 13G Under the Securities Exchange Act of 1934 (Amendment No. 7)* MICROSOFT CORPORATION ======================================================================

3 2

Super computer SR2201 at PJWSTK
by Jan Dobrucki 17 Dec '03

17 Dec '03

I got news for you all. I'm applying for an account on a super computer which we got in our school. I need to write the reason why I need to have such an account. The reason why I want to put is: to break a DES-56 bit key encrypted message. I don't know if my applications for the account will be accepted, but if you got any ideas now as to how you'd like to use the computational power of a super computer, just let me know... http://www.pjwstk.waw.pl/sr2201/index.html this is the address to the page at my school about the SR2201, but it's in polish... i might translate it one day soon... Looking foreward to your comments and ideas. JD PS. My return address is somewhat messed up. Just send mail to either the list, or to s1180(a)qmail.pjwstk.waw.pl for some reason, the server at my school, PJWSTK, says that your domain is not accepted. For some reason, it says so for all domains.

1 0