December 2003 - cypherpunks-legacy

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

Re: MIB Subpoenas
by Anonymous 17 Dec '03

17 Dec '03

At 12:23 PM 10/28/98 -0800, Tim May wrote: >The first thing I did when I heard about the latest case, that of Toto, was >to purge any private mail messages between myself and Toto or any of his >alleged nyms. (My backups may have old messages, but I've been trying to >find them all and destroy or recopy them sans the Toto messages.) > >I advise any of you with links to the idea of anonymous murders and AP to >do the same. Soon. Tim, Betty Currie will be by to pick up the rest of the backup tapes...

1 0

bug in my Maurer code; retraction of claim; ref
by David Honig 17 Dec '03

17 Dec '03

There was a numerical bug in the C code for Maurer's Univ. Stat. Test for Randomness which I posted. The "float" variable "Sum" should be "double". This will cause an incorrect input-size dependence for large >40Mbyte files. Measuring (with the fixed version) the output of a block cipher in feedback mode, I find that it DOES NOT differ from truly nondeterministic noise, as I had claimed. The difference I had observed was due to a larger sample size for my cipher-noise. Boy do I feel stupid. Needless to say, sorry about any inconvenience. The fixed code follows at the bottom. This version also spits out an early estimate after a million samples; this turns out to be very close to the final value for (homogenous) large samples. Also: I recently found the following amendment to Maurer's work at http://www.eleves.ens.fr:8080/home/coron/escience.html#1 Abstract. Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (a variety of parameter combinations can be chosen by the tester) and fast. Although the test is based on sound probabilistic grounds, one of its crucial parts uses the heuristic approximation: c(L,K) = 0.7 - 0.8/L + (1.6 + 12.8/L)K-4/L In this work we compute the precise value of c(L,K) and show that the inaccuracy due to the heuristic estimate can make the test 2.67 times more permissive than what is theoretically admitted. Moreover, we etablish a new asymptotic relation between the test parameter and the source's entropy. 09/08/98 - Jean-Sébastien Coron ..................................... /* UELI.c 28 Oct 98 This implements Ueli M Maurer's "Universal Statistical Test for Random Bit Generators" using L=16 Accepts a filename on the command line; writes its results, with other info, to stdout. Handles input file exhaustion gracefully. Ref: J. Cryptology v 5 no 2, 1992 pp 89-105 also on the web somewhere, which is where I found it. -David Honig honig(a)sprynet.com Built with Wedit 2.3, lcc-win32 http://www.cs.virginia.edu/~lcc-win32 26 Sept CP Release Version Notes: This version does L=16. It evolved from an L=8 prototype which I ported from the Pascal in the above reference. I made the memory usage reasonable by replacing Maurer's "block" array with the 'streaming' fgetc() call. 27 Oct 98 compiled under Sun cc OK if C++ stuff taken out.. 28 Oct 98 made "Sum" into a double, from float; fixes a bug found with larger (40M files); reposted with retraction. Usage: ULI filename outputs to stdout */ #define L 16 // bits per block #define V (1<<L) // number of possible blocks #define Q (10*V) // at LEAST 10 * V, to assure each block seen #define K (100*Q) // at LEAST 100 * Q, as large as possible #define MAXSAMP (Q + K) #include <stdio.h> #include <math.h> int main( int argc, char **argv ) { FILE *fptr; int i; int b, c; int table[V]; double sum=0.0; int run; // Human Interface printf("UELI 27 Oct 98 double-precision, with early value\n L=%d %d %d \n", L, V, MAXSAMP); if (argc <2) {printf("Usage: ULI filename\n"); exit(-1); } else printf("Measuring file %s\n", argv[1]); // FILE IO fptr=fopen(argv[1],"rb"); if (fptr == NULL) {printf("Can't find %s\n", argv[1]); exit(-1); } // INIT for (i=0; i<V; i++) table[i]=0; for (i=0; i<Q; i++) { b= fgetc(fptr)<<8 | fgetc(fptr); table[ b ]=i; } printf("Init done\n"); // COMPUTE run=1; for (i=Q; run && i<Q+K; i++) { // COMPOSE A 16-bit quantity b=fgetc(fptr); c=fgetc(fptr); if (c<0 || b<0) run=0; if (run) { b = b<<8 | c; sum += log( (double) ( i-table[b] ) ) ; table[ b ]=i; } if (i==1000000+Q) printf("Early measurement after %d samples = %g\n\n", i-Q, (sum/( (double) (i-Q) ) ) / log(2.0)); } if (!run) printf("Premature end of file; read %d blocks.\n", i-Q); sum = (sum/( (double) (i-Q) ) ) / log(2.0); // i should be K if enough samples printf("%s fTU= %g\n\n", argv[1], sum); printf("Expected value for L=16 is 15.167379 \n"); // Add further interpretation/thresholding of the number of sigmas from expected, // and include the fudge factors explained in the paper. } // end

1 0

Re: log files (was: Re: dbts: Cryptographic Dog Stocks, The Dirigible Biplane, and Sending the Wizards Back to Menlo Park )
by Lynn.Wheeler＠firstdata.com 17 Dec '03

17 Dec '03

in fact, large number of security studies show that variety of operations are at greatest risk from insiders.

1 0

No Subject
by Anonymous 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 excuse this bandwidth. me -----BEGIN PGP SIGNATURE----- Version: PGPfreeware 6.0 for non-commercial use <http://www.pgp.com> iQA/AwUBNjiEBHUkEFXvH2ZAEQJ11wCdEEcGeWaOWjrNZ2e22a0Q5WtRMtIAmwQH JkSiA2UUrB6pahgHqA0dvIYc =8qn4 -----END PGP SIGNATURE-----

1 0