December 2003 - cypherpunks-legacy

index.html
by Jim Choate 17 Dec '03

17 Dec '03

Welcome to the Cypherpunks Distributed Remailer. The purpose of this mailing list is to explore the frontier of cryptography, civil liberty, economics, and related issues. This is a very high traffic mailing list. Several members of the mailing list are involved in various types of events through the year. Participation by members of the list does not construe any support or affilliation with the mailing list. Contact the author of all works obtained through the remailer network. They retain original rights. There are currently 4 indipendant but cooperating sites supporting full cross posting of traffic. The goal is to provide a mechanism for improved list stability as well as making moderation and other forms of attacks harder to mount. These sites are: ssz.com algebra.com cyberpass.net htp.com (Japan) If you have specific questions about the list or particular remailer host sites please contact postmaster@domain_name for further information. Should you be interested in participating as a CDR host then make an announcement on the list. This will allow all the sites to update their maps. All that is required to become a member is some form of remailer or forwarding mechanism and a means to delete multiple copies of the same message. Currently there are several remailer programs but majordomo is the most popular. In general a procmail script is used to remove duplicates. Please let others know about this mailing list, the more the merrier! To subscribe to the CDR you should contact the individual operators as conditions at each remailer site may be quite different. To subscribe through SSZ you should send a note to list(a)ssz.com or send an email to majordomo(a)ssz.com with 'subscribe cypherpunks email_address' in the body. If you have questions or problems contact list(a)ssz.com There may be local groups of members who have regular (or not) meetings in order to discuss the various issues and projects appropriate to their individual membership. These groups generaly announce their meetings via the CDR. Please feel free to make appropriate announcements of activity in your area. Some popular books that are well respected for learning about Cryptography and the various issues are: Applied Cryptography: Protocols, Algorithms, and Source Code in C Bruce Schneier ISBN 0-471-11709-9 Disappearing Cryptography Peter Wayner ISBN 0-12-738671-8 Internet Cryptography Richard E. Smith ISBN 0-201-92480-3 Decrypted Secrets: Methods and Maxims of Cryptology F.L. Bauer ISBN 3-540-60418-9 Some sites that that might be of interest: Austin Cypherpunks Soda Cypherpunks - Original site

1 0

XXX ADULT SEX!!!
by wopeunua84＠toyoma-u.ac.jp 17 Dec '03

17 Dec '03

Your Connection to Hot Sexy XXX Live Girls!!! *LIVE GIRL SEX SHOWS!!! * 10 FREE Live Video Feeds & Chatrooms!!! *FREE Erotic Stories!! *1,000's of Free Pictures of XXX Porn Stars!! *Confessions!!! *Plus Free Pictures of Teens & Men!!! *Live Erotic Chat!!! *Gambling * Tons of free stuff!!! So Much More we can't fit it on this page. See for yourself, go check it out!!! You must be 21 or older. Copy & Paste the link below into your browser, and press enter. It's that easy!!! http://www.search.com/Infoseek/1,135,0,0200.html? OLDQUERY=pussyclub+&QUERY=pussyclub+&COLL=11&START=10&OLDCOLL=WW If you take offense to this email & wish to be taken off our list, simply e-mail us at: stanleyo(a)hotmail.com We are sorry for any

1 0

Will the First Puppy go under the ax?
by Declan McCullagh 17 Dec '03

17 Dec '03

Q: Mike, before getting to more important issues, how come you guys aren't neutering Buddy? (Laughter.) MCCURRY: There are a lot of people around here who have been neutered, but I haven't heard a discussion of Buddy being neutered. I do not know the answer to that. I will talk to the First Dog owner and get the answer to that question. Q: You would know if there was going to be an announcement today, wouldn't you? MCCURRY: I would not go beyond what I just said -- the Treasury Department is the place to go. Q: On the neutering? (Laughter.) MCCURRY: Not on neutering. Can you spay or neuter a puppy? Q: Six months. MCCURRY: Any dog owners out there that can help us? Q: Mike, neutering is usually six months -- MCCURRY: That's what I thought. It's got to be a little bit older. Q: I heard that you were planning not to neuter him. MCCURRY: I wasn't planning to do anything with him. (Laughter.) Other than sucking up to the president by scratching little Buddy's belly from time to time. (Laughter.) Q: It will, however, be at risk. (Laughter.) MCCURRY: I'll find out on that. And I know your insatiable appetite for dog trivia -- I will see if I can find out about that.

1 0

Spies like US
by Anonymous 17 Dec '03

17 Dec '03

http://www.telegraph.co.uk:80/et?ac=000602131144806&rtmo=0sKsx2bq&atmo 0sKsx2bq&pg=/et/97/12/16/ecspy16..html A European Commission report warns that the United States has developed an extensive network spying on European citizens and we should all be worried. Simon Davies reports [INLINE] Cooking up a charter for snooping Spies everywhere A GLOBAL electronic spy network that can eavesdrop on every telephone, email and telex communication around the world will be officially acknowledged for the first time in a European Commission report to be delivered this week. The report - Assessing the Technologies of Political Control - was commissioned last year by the Civil Liberties Committee of the European Parliament. It contains details of a network of American-controlled intelligence stations on British soil and around the world, that "routinely and indiscriminately" monitor countless phone, fax and email messages. It states: "Within Europe all email telephone and fax communications are routinely intercepted by the United States National Security Agency transfering all target information from the European mainland via the strategic hub of London then by satellite to Fort Meade in Maryland via the crucial hub at Menwith Hill in the North York moors in the UK." The report confirms for the first time the existence of the secretive ECHELON system. Until now, evidence of such astounding technology has been patchy and anecdotal. But the report - to be discussed on Thursday by the committee of the office of Science and Technology Assessment in Luxembourg - confirms that the citizens of Britain and other European states are subject to an intensity of surveillance far in excess of that imagined by most parliaments. Its findings are certain to excite the concern of MEPs. "The ECHELON system forms part of the UKUSA system (see 'Cooking up a charter for snooping') but unlike many of the electronic spy systems developed during the Cold War, ECHELON is designed primarily for non-military targets: governments, organizations and businesses in virtually every country. "The ECHELON system works by indiscriminately intercepting very large quantities of communications and then siphoning out what is valuable using artificial intelligence aids like MEMEX to find key words". According to the report, ECHELON uses a number of national dictionaries containing key words of interest to each country. For more than a decade, former agents of US, British, Canadian and New Zealand national security agencies have claimed that the monitoring of electronic communications has become endemic throughout the world. Rumours have circulated that new technologies have been developed which have the capability to search most of the world's telex, fax and email networks for "key words". Phone calls, they claim, can be automatically analysed for key words. Former signals intelligence operatives have claimed that spy bases controlled by America have the ability to search nearly all data communications for key words. They claim that ECHELON automatically analyses most email messaging for "precursor" data which assists intelligence agencies to determine targets. According to former Canadian Security Establishment agent Mike Frost, a voice recognition system called Oratory has been used for some years to intercept diplomatic calls. The driving force behind the report is Glyn Ford, Labour MEP for Greater Manchester East. He believes that the report is crucial to the future of civil liberties in Europe. "In the civil liberties committee we spend a great deal of time debating issues such as free movement, immigration and drugs. Technology always sits at the centre of these discussions. There are times in history when technology helps democratise, and times when it helps centralise. This is a time of centralisation. The justice and home affairs pillar of Europe has become more powerful without a corresponding strengthening of civil liberties." The report recommends a variety of measures for dealing with the increasing power of the technologies of surveillance being used at Menwith Hill and other centres. It bluntly advises: "The European Parliament should reject proposals from the United States for making private messages via the global communications network (Internet) accessible to US intelligence agencies." The report also urges a fundamental review of the involvement of the American NSA (National Security Agency) in Europe, suggesting that their activities be either scaled down, or become more open and accountable. Such concerns have been privately expressed by governments and MEPs since the Cold War, but surveillance has continued to expand. US intelligence activity in Britain has enjoyed a steady growth throughout the past two decades. The principal motivation for this rush of development is the US interest in commercial espionage. In the Fifties, during the development of the "special relationship" between America and Britain, one US institution was singled out for special attention. The NSA, the world's biggest and most powerful signals intelligence organisation, received approval to set up a network of spy stations throughout Britain. Their role was to provide military, diplomatic and economic intelligence by intercepting communications from throughout the Northern Hemisphere. The NSA is one of the shadowiest of the US intelligence agencies. Until a few years ago, it existence was a secret and its charter and any mention of its duties are still classified. However, it does have a Web site (www.nsa.gov:8080) in which it describes itself as being responsible for the signals intelligence and communications security activities of the US government. One of its bases, Menwith Hill, was to become the biggest spy station in the world. Its ears - known as radomes - are capable of listening in to vast chunks of the communications spectrum throughout Europe and the old Soviet Union. In its first decade the base sucked data from cables and microwave links running through a nearby Post Office tower, but the communications revolutions of the Seventies and Eighties gave the base a capability that even its architects could scarcely have been able to imagine. With the creation of Intelsat and digital telecommunications, Menwith and other stations developed the capability to eavesdrop on an extensive scale on fax, telex and voice messages. Then, with the development of the Internet, electronic mail and electronic commerce, the listening posts were able to increase their monitoring capability to eavesdrop on an unprecedented spectrum of personal and business communications. This activity has been all but ignored by the UK Parliament. When Labour MPs raised questions about the activities of the NSA, the Government invoked secrecy rules. It has been the same for 40 years. Glyn Ford hopes that his report may be the first step in a long road to more openness. "Some democratically elected body should surely have a right to know at some level. At the moment that's nowhere". See also in this week's issue: Pretty good Phil bounces back (a report on the consolidation of the reputation of Phil Zimmermann, creator of PGP). 14 October 1997: Europe's private parts to expand

1 0

Access Over 1 MILLION Resumes!
by m2cresumes＠earthlink.net 17 Dec '03

17 Dec '03

NOT a job site, NOT a search engine, NOT a career board, NOT a newsgroup AND we do NOT limit you to a single database! U S Resume is a true technological leap. It allows subscribers access the OVER 1 MILLION resumes on the ENTIRE INTERNET (source: Electronic Recruiting Index, Dec. 1996). It finds your candidates and also downloads their resumes to your hard drive all automatically, so you can browse them later with NO Internet wait time. You gain access to the same "virtual robotics" technology used by our Fortune 500 clients, enabling you to spend less time looking for qualified candidates and more time placing them. Prices start as low as $295 per month, no more than an ordinary job board and less than just one typical help wanted display ad. Why not have the ENTIRE INTERNET as your own PERSONAL DATABASE? For additional information please visit us at http://www.usresume.com If the site doesn't answer all your questions, please don't hesitate to call Dave Weltman or Jeff Eisenberg at 914-627-2600. Thanks! P.S If you would like to be added to our DO NOT EMAIL LIST, please reply to this message with the word REMOVE in the Subject of your reply. When our Robot finds the word REMOVE in the Subject of any message, it will automatically add the senders email address to our DO NOT EMAIL LIST.

1 0

Surprise - Anonymous Journalist Opposes Laundering [1/4]
by nobody＠REPLAY.COM 17 Dec '03

17 Dec '03

The following series of posts is extracted from E-Communist. In this article the writer (but a mere cog in the Anonymous Entity known as GovernMedia NLC), exhibits the guVermin cheerleading so pervasive among those in his/her profession. In keeping with the spirit of anonymous advocacy favoring global fiscal tyranny, "our" collectivistic comments are in brackets as indicated: [S'n'S] Originally assigned the staid title 'Money Laundering', "we" have taken the indecent liberty of naming each post separately: Part 1 "Know Your Journalist" [1/4] [1/4] ... countries set up the Financial Action Task Force (FATF) [not to be confused with the BATF] in 1989. Based at the OECD [worthle$$ bureaucracy #2] in Paris, this now has 26 member countries, which are supposed to abide by its 40 recommendations. Among other things, these encourage mutual assistance in laundering cases. International co-operation is also being fostered by financial-intelligence units [FiUs], some of which recently set up a special computer network to swap information about laundering cases. A statistical black hole What effect has all this had? It is hard to tell for sure, but such evidence as looks reliable is hardly encouraging [discouraging]. A report published in 1995 by AUSTRAC, [worthle$$ bureaucracy #3] Australia's financial-intelligence unit, concluded that between A$1 billion and A$4.5 billion ($740m-3.3 billion) was washed through Australia each year. The report noted that if this figure is accurate, then Australian poLice were recouping [recouping?, proceeds of voluntary exchanges are considered stolen when in fact those doing the "recouping" are the criminals] barely 1% of all the ["]dirty["] money that they [_]guess[_] is flowing into [but not flowing out of? It must be all those "dirty" foreigners corrupting the innocent Aussie drug addicts and tax evaders] the country--a surprisingly low figure given that Australia is widely acknowledged to have one of the most comprehensive anti-laundering regimes in the world. [so AUSTRAC thugs are basing their conclusions on guesstimates, which, if as accurate as they kinda sorta think they might be indicates: Minions of the Australian FIU stole, that is, recouped, some 10-45mil AUD in cash and an unspecified amount of other property, but this is "barely 1%" of the _potential_ bounty to be had in the lucrative worldwide industry of asset forfeiture. Allow me to "guesstimate" a couple of other conclusions they may have made: 1) AUSTRAC lacks sufficient funding (AUSTRAC clerks still lack vacation slush funds). 2) AUSTRAC lacks sufficient personnel (AUSTRAC entry teams are still without APCs and close air support).] When it comes to prosecutions of money launderers, few countries keep reliable statistics, often because laundering was only recently deemed a separate ["]crime["]. One that does is the Netherlands. According to its justice ministry, in 1995 some 16,125 [subjectively] ["]suspect["] transactions were reported to the country's financial-intelligence [looting] unit. Only 14% of these were sufficiently dubious [read: juicy confiscatable assets of sufficient size coming to their attention due to amateurish operations that lacked political protection which made these "suspect" assets worth the time and effort to grab] to pass to the poLice, and only 0.5% of the original total led to prosecutions. [no mention of the % of cases that led to confiscations] Anecdotal evidence suggests a similar lack-of-["]success["] elsewhere. Why aren't more laundrymen being caught? [what about laundrywomen, the sexist pigs!] The answer, say those leading the fight against dirty [free] money, is that most anti-laundering regimes are still in their infancy. [yet to grow into the horrid monsters of their wet dreams] But, they say, at least the situation is improving. [deteriorating] Stanley Morris, FINCEN's [worthle$$ named bureaucracy #4] director [thug], says undercover operations in America show that launderers' fees have risen from around 6% of the money washed in the early 1980s, to 25-28% today. The explanation is that laundering is getting harder and riskier--and hence more expensive. Some experts also claim that a recent increase in the ["]smuggling["] of cash across borders is a sign that [gasp] more ["]criminal["] ["]loot["] is shunning banks. [meaning people are fed up with American banks, American regulators and America in general: "sell off, cash in and drop out".] There has also been some progress internationally. A few well-known haunts of launderers, such as Switzerland and the Cayman Islands, have made it easier for bankers to report ["]suspect["] transactions [reclaiming lost virginity] without breaking bank-secrecy laws, and for their financial gumshoes to co-operate with foreign ones. [meaning they already have so much money on deposit that it won't effect profits significantly, besides which, the typical lazy African dictators' first choice remains CH and those who are concerned about such matters have long since moved to greener pastures anyway...] In February, Antigua, another Caribbean haven, closed five out of six Russian offshore banks because of concerns that they had been laundering money for Russia's mafia. [no security through obscurity there] The FATF has also cracked down. [pun intended?] Last year, for the first time, it publicly upbraided one of its members, Turkey, for not introducing an anti-laundering law. [Turkey, a typical 3rd world pit, is too busy stealing from its citizens via hyperinflation to bother with passing pro-looting legislation.] And it gave banks a warning abot dealing with Seychelles after the government offered anyone placing $10m or more in certain investments immunity from prosecution [no STO there either]. The law containing this open invitation [more like comic relief] to crooked cash has since been shelved. > E-Communist > 25 St James's Street > London SW1A 1HG > www.economist.com Fly low S'n'S Pro:__Money Laundering__Self Medication__Militia Grade Arms__Realism________ __Indirect Taxation___________Adults___________Individual Irrevocable Right$ } Smurf N Sniff Non-Member, Gunfiscators of Canberra | } P.O. Bunker 6669 "We don't want to be like those paranoid | } Hohoe, Ghana Americans, this is a social DemoBracy." | } fn-fal(a)edict.gov.un +233 55 1234 boycott GovernMedia NLC | ANTI:_feral guVermin____Vooters__________blue hellmutts______nihilists______ __biometric herd management__"(The) children"__state granted privilege_____!

1 0

Re: your mail
by Anonymous 17 Dec '03

17 Dec '03

>On Thu, 8 Jan 1998 13:54:41 -0700 (MST) Graham-John Bullers ><real(a)freenet.edmonton.ab.ca> writes: >>On Thu, 8 Jan 1998, Mix wrote: >> >>I think Vulis needs each of us to send ten copies of this back to him. > >I think so too what's his email address????? > > > >Anonymous304 Uh, you subscribe to the list but you can't find Vulis' address? Just how stupid are you?

2 1

Anger Crimes Up 442% In Bay Area
by Bezerkeley Nutly News 17 Dec '03

17 Dec '03

[Bezerkeley Nutly News: Special Report by Defcon McCullagh Chainsaw] AT AN EMERGENCY CYPHERPUNKS PHYSICAL MEETING AT THE W&S TAVERN AT 5 a.m. in south Berkeley this morning, a lone gunman held police at bay for several hours before escaping with a carton of cigarettes and several bottles of cheap scotch. While W&S Tavern owners explained to reportwhores that they had no plans to seek charges against the unknown gunman, since he used to be a regular customer and a good tipper, a police spokesperson told the same reportwhores, under promise of UnAnonymity, that they would be seeking the death penalty for the gunman, if caught, under the recent Criminal Emotions legislation passed last week by the Politically Correct Peephole's Party at a recent Bezerkeley City Council meeting. "Although the PCP leaders have only had time to train and deploy a few hundred volunteers trained to recognize the signs of the new Criminal Emotions," said Anonymous Badge #356, "it has already become apparent that Anger and Negative Attitude crimes are skyrocketing out of control in the Bay Area." "The physical gunshot wounds suffered by several officers tonight will heal, with time," the gender-neutral individual continued, in a monotone voice, "but the anger expressed toward them by the gunman will remain with them forever, or until the gunman apologizes, if caught." Several hundred Postal Workers have already been detained and sent for pschological testing in the Berkeley area under the strict new laws governing restriction of expressions of disgruntlement within 500 feet of a mailbox by federal postal employees. A US Postal Service spokesperson told reportwhores, "I'm certainly not happy about this..." and was immediately arrested and whisked away by a group of homeless people helping to enforce the new legislation in return for Bezerkeley City Council's promise to add shopping cart lanes next to the current bike lanes on city streets. A member of "The Disgruntled Postal Workers", a Tucson-based muscial group exempted from the new legislation under the "artistic license" provisions, said, as he went through the pockets of the dead fans who failed to escape during the climax of the performance, "I think the gunman at the W&S Tavern was a member of 'The Angry Young Men' who opened for us, so it is unlikely any charges can be laid in the incident, unless he actually smoked some of the cigarettes in the bar during the shooting spree." The owner of the W&S Tavern, when asked by reportwhores if he was unhappy with the damage done to the bar during the shootout, consulted briefly with his attorneys regarding the new Criminal Emotion laws in the Berkeley area, and replied, "No. I'm perfectly happy with the situation." A nearby Berkeley policeman immediately shot down the bar owner, saying, "He looked a little *too* happy, if you ask me." The attorneys merely shrugged as the man lay dying on the sidewalk, telling reportwhores, "The laws are clearly written not to allow deviation of emotionally legal expression too far in *any* direction, and we find that to be... uuhhh...acceptable." Every bar owner contacted by this reportwhore in regard to the new law prohbiting drinking, as well as smoking, in Bay Area bars, said that they were "cautiously optomistic" that their business would not suffer as a result of the legislation. "What we lose in volume, we can make up with lower overhead costs by not needing to stock any of the products we sell." said one bar owner as she placed a 'For Sale' sign in the front window.

2 1

This may be of interest...
by Ryan Anderson 17 Dec '03

17 Dec '03

http://www.law.emory.edu/ELJ/volumes/sum96/lessig.html If it doesn't hit you immediately, let me help. The lawyer who wrote this is the "Special Master" in the DOJ vs. MS case. It's an interesting paper, and should shed some interesting light on his viewpoint in the MS case. Enjoy! Ryan Anderson - Alpha Geek PGP fp: 7E 8E C6 54 96 AC D9 57 E4 F8 AE 9C 10 7E 78 C9 print pack"C*",split/\D+/,`echo "16iII*o\U@{$/=$z;[(pop,pop,unpack"H*",<> )]}\EsMsKsN0[lN*1lK[d2%Sa2/d0<X+d*lMLa^*lN%0]dsXx++lMlN/dsM0<J]dsJxp"|dc`

1 0

Surprise - Anonymous Journalist Opposes Laundering [2/4]
by nobody＠REPLAY.COM 17 Dec '03

17 Dec '03

Part 2 "Journalistic Secrecy is a Serious Problem" [2/4] [2/4] Taken to the cleaners ["]Un["]fortunately, some of this is not as encouraging as it sounds. For a start, the ["]dirty["] money leaving banks may end up polluting other businesses [MONEY LAUNDERING IS GOOD FOR BUSINESS]. PoLice in Texas say that foreign-exchange bureaux there have been a primary conduit for channelling drug money to and from Mexico. Insurers are also vulnerable. One recent laundering wheeze involves buying single-premium insurance policies with ["]dirty["] money. These are then cashed in early in return for a "clean" cheque from the insurer, or used as collateral for a bank loan. [On the way: Currency Transaction Reports for purchase of insurance policies with cash and Early Redemption Reports for policies held less than 50 years. Insurance agents will be required to report "suspicious" policy holders and report possible "structuring" violations. Then they'll wonder why customers are "shunning" insurance companies.] Even the rising cost of laundering may not be unalloyed good news. It may simply reflect the emergence of a new group of professional launderers who are better at beating the system, and charge more for doing so. [Or as Comrade Clinton would put it, "getting their fair share"] Some poLiceman fear that these experts may soon be using electronic-cash systems to speed up the wash cycle (see box on next page). [See post 4/4] Worse [Better], as old laundering centres close their doors, new ones are opening theirs. The table above [shown below this paragraph] shows the countries that the State Department thinks face a severe money-laundering problem. (Even states with tough anti-laundering rules, such as America and Britain, are listed if their vigilance is considered essential in the global fight against laundering.) The striking thing about the ranking is that it includes islands such as Cyprus, a ["]hive["] of offshore activity for the Russian mafia, and Aruba, a Dutch dependency in the Caribbean, which were not associated with laundering a few years ago. [Translation: Aruba et. al. have always been on their shit list, and now that they've taken out the higher-priority targets e.g. CH and Cayman, the NWO _Microchip Extremists_ are setting their sights on shutting down the lower-yield peripheral sites. (which they've "only just recently discovered" are pro-privacy areas)] Another notable inclusion is Mexico, which the report describes as "the money-laundering haven of choice for initial placement of US currency in the world's financial system". In March, the [criminal] Mexican government unveiled a series of anti-laundering [fig leaf] measures in a belated effort to clean up its reputation. Laundry list "High-priority" laundering centres, March 1997 A B C D Aruba yes . . yes Canada yes yes yes yes Cayman Islands yes yes . yes Colombia yes . . yes Cyprus yes na yes yes [Doesn't indicate differences between Greek and Turkish regs, if any.] Germany yes . . yes Hong Kong yes yes . yes Italy yes yes yes yes Mexico yes . yes . Netherlands yes yes yes yes Netherlands Antilles yes . . yes Nigeria yes . . na Panama . . yes yes Russia . . . . Singapore yes . yes yes Thailand . . . . Turkey . . . . Britain yes yes yes yes United States yes yes yes yes Venezuela yes . yes yes A Banks required (or permitted) to report suspicious transactions. [Communese translation: entry-level bank tellers required (or permitted) to make subjective determinations as to customers' intent and/or state of mind. Required (or permitted) to report people encountered on city streets who may be shunning banks in favor of foreign-exchange houses and cheque-cashing outlets. Development of mind-reading skills mandated by executive order.] B Government permits sharing of seized assets with other governments that assisted the underlying investigation. [Communese translation: Thieves drawing paycheques from extorted proceeds allowed to share stolen goods with accomplices in other jurisdictions. The Legislator/B-Crat/Snitch/Judge motto: "We Know Em When We Seize Um"] C Non-banks must meet same anti-laundering provisions as banks. [Communese translation: The woman with an appearance approximating the Wicked Witch of the West sitting behind the .357 Magnum resistant plastic that slips you 10,000,000 Bongonian bellylints in exchange for 10 euros is also a deputized collectivist agent/informant.] D Financial institutions and employees who provide otherwise confidential data to investigators pursuing authorized investigations are protected from prosecution. [Communese translation: Deputized Government Agents/Informants (that is, anyone with whom you exchange legal tender bank notes, a.k.a. "dirty" money) who provide "otherwise confidential" data so that "authorized investigators" may empty your bank account are not accomplices to looters with sovereign immunity.] Source: US Department of State (International Narcotics Control Strategy Report) [Source: Illegitimate Spawn of Hegel (Global Currency Confiscation Strategy Report)] [Notice again that the less fiscally totalitarian states are those actively engaged in recalling their worthless currencies, forbidding (in theory) their domestic hostages from sending capital abroad, forbidding (in theory) holding gold or using other means of protection from criminal governments, defaulting on foreign loans and various shenanigans in a similar vein. From this it can be concluded that for those on the outside looking in, chronic economic mismanagement and chaos are not necessarily a negative, these areas provide excellent entry points in the "rewire-chain"...] In the future, more Asian countries could be added to the list. Rick McDonell [, looter ], the FATF's representative [of Satan] in Asia, warns that the region is ["]vulnerable["] to laundering because many of its economies are heavily cash-based. [Solution: go hire Jerry Seinfeld, Patrick Stewart and all the other convenience-card whores to shill for the cashless society in Bangkok, Guangzhou and Kuala Lumpur?] Moreover, some countries such as India and Pakistan have large "underground" banking systems which sit alongside official ones [hawala]. Usually based on family or regional networks, these shift large amounts of money [and other stored units of value, e.g. crates of Avtomat Kalashnikova, "illegal" cash crops, RPGs, precious stones] around anonymously and cheaply. [25-28% markup indeed! Forget that rubbish] Such attractions, plus a lack of anti-laundering legislation, have already turned Thailand into a launderers' paradise. A report published last year [yet another report, this journalist needs to get out into the real world, hanging with fiscal bureaucrats and professors is stunting Anon-E-Communists' growth] by Bangkok's Chulalongkorn University put the amount of money washing through the country each year at 730 billion baht ($28.5 billion). This is equivalent to 15% of Thai GDP. [In future watch for the following commercials to be run in these vulnerable-to-laundering cash-based-economy television markets: (Jackie Chan dubbed in various local dialects) Amarakan Sexpress - don weave shantytown witoutit VIZA - accep at FinSEN office wowide MassaCard - it's swave money] > E-Communist > 25 St James's Street > London SW1A 1HG > www.economist.com Fly low S'n'S Pro: Money Laundering, Self-Medication, Militia-Grade Arms, Realism Pro: Indirect Taxation, Adults, Individual Irrevocable Rights } Smurf N Sniff Non-Member, Gunfiscators of Canberra | } P.O. Bunker 6669 "We don't want to be like those paranoid | } Hohoe, Ghana Americans, this is a social DemoBracy." | } fn-fal(a)edict.gov.un +233 55 1234 boycott GovernMedia NLC | Anti: feral guVermin, Vooters, rapacious tyrants, nihilists Anti: biometric herd management, "(The)" children, state granted privileges

1 0

REMOVE
by anonymous304＠juno.com 17 Dec '03

17 Dec '03

On 9 Jan 1998 22:41:02 GMT m2cresumes(a)earthlink.net writes: >NOT a job site, NOT a search engine, NOT a career board, NOT a >newsgroup >AND we do NOT limit you to a single database! > >U S Resume is a true technological leap. It allows subscribers access >the OVER 1 MILLION resumes on the ENTIRE INTERNET (source: Electronic >Recruiting Index, Dec. 1996). It finds your candidates and also >downloads their resumes to your hard drive all automatically, so you >can browse them later with NO Internet wait time. You gain access to >the same "virtual robotics" technology used by our Fortune 500 >clients, enabling you to spend less time looking for qualified >candidates and more time placing them. > >Prices start as low as $295 per month, no more than an ordinary job >board and less than just one typical help wanted display ad. > >Why not have the ENTIRE INTERNET as your own PERSONAL DATABASE? > >For additional information please visit us at http://www.usresume.com > >If the site doesn't answer all your questions, please don't hesitate >to call Dave Weltman or Jeff Eisenberg at 914-627-2600. > >Thanks! > >P.S If you would like to be added to our DO NOT EMAIL LIST, please >reply to this message with the word REMOVE in the Subject of your >reply. When our Robot finds the word REMOVE in the Subject of any >message, it will automatically add the senders email address to our DO >NOT EMAIL LIST. > > >

1 0

Eureka! Fri Jan 9 '98
by eureka＠eureka.abc-web.com 17 Dec '03

17 Dec '03

Welcome to Friday's issue of Eureka! KARA'S ADULT PLAYGROUND With 15 live sex shows, 1,300 Hardcore XXX videos, 1,000s of Hardcore and Softcore Pix, the VaVoom monthly magazine, Kara's exclusive monthly centrefolds, adult games, erotic stories and even casino and sports betting, you won't be going out for weeks particularly now that you can get a FREE trial - your eyes will be popping out of your head! Hahaha! Kara's Playground ...... http://www.rjbtelcom.com/eplay.html GAYEUREKA! The gay newsletter is now available. You can get it here! Gay Eureka! ........... http://eureka.abc-web.com/gayeureka/ EUREKA! TRANSLATIONS As well as English you can now choose any of these languages DEUTSCH ....... http://eureka.abc-web.com/eureka/deutsch.htm ESPAÑOL ....... http://eureka.abc-web.com/eureka/espanol.htm FRANÇAIS ..... http://eureka.abc-web.com/eureka/francais.htm ITALIANO ..... http://eureka.abc-web.com/eureka/italiano.htm PORTUGUESE . http://eureka.abc-web.com/eureka/portuguese.htm PLEASE VISIT THIS FINE EUREKA! PARTNER SITE ***THE BEST HARDCORE ON THE NET*** http://www.thehoneypot.com We Offer You Only the Best In Harcore Adult Entertainment. Cheap Weekly Rates, Free Samples, And The Wettest Sluts Anywhere. Come See Why They Call It The Honey Pot. INFINITE PLEASURES This site is loaded with lots of free pix to say the least! All of the categories are plainly listed for fast surfing. Bingo! They also have some great free videos! Lots of bush! Infinite Pleasures ...... http://www.infinite-pleasures.com/ INNOCENCE LOST "Two beautiful women whom have agreed to "lose" their inno- cence in the presence of our cameras.." Here we have two hot young ladies doing a nice little romp on a daybed. The pix are high resolution, so you can see it all. They start out slow but then it gets going with a mutual hooter connection! Innocence ....... http://www.firstsightimages.com/innocence/ FREE SNATCH Hey, I guess the price is right. At this site they have well laid out pix. These include, anal, blowjobs, cumshots, hot sluts, group sex, lesbians and fucking. Not a bad mix here! Free Snatch ..................... http://www.freesnatch.com/ PORN CENTRAL Way down at the bottom of the main frame you'll find lots of free pix. These are some good ones. One features two babes pouring honey on each other. Sweet and stick nipples, Yummy! Porn Central ................... http://www.porncentral.com/ FREE CONTEST! If you haven't won free 3 month membership to HardCoreSmut yet, today is your last chance. If the competition is too tough, then just give them your money, once you're a member, your accountant will be the last thing on your mind. Visit Hardcoresmut and click on "Free Guided Tour" for the tour. Email the answer (found in Hardcore Games) to this question: "These hardcore games are the ultimate in what?"............ Send answers to ............. mailto:contest@www.usachat.com HardCoreSmut ................... http://www.hardcoresmut.com FREE STREAMING VIDEO Please note that most of these feeds require a Netscape bro- wser in order to successfully view them. Unfortunately Micr- osoft's browser does not have all the features of Netscape's yet. However, many of the feeds use the RealPlayer and will work in most browsers. If you do not have Netscape and want a free copy click here ... http://www.netscape.com/download/ Just 18 ........................ http://204.244.215.7/teens/ CHAT WITH OTHER READERS This chat is growing fast, and already there are a number of regulars you will meet most days. It's good to see Eureka! readers interacting with each other and having a great time! Adult/Sex Chat .................. http://137.39.63.229/chat/ General/Fun Chat ........ http://137.39.63.229/chat/funchat/ THE BEST PHONE SEX NEW!!!! LD Call only! - Live Hot Girls!!!!....1-664-410-3912 LIVE: 1-on-1, 2-on-1, Group, Dateline.........1-800-644-8779 FREE: Live 1-on-1 (international call only)....011-678-77416 AMATEUR SITE OF THE DAY JAMIE WYLDE: A 36 year old Canadian amateur who has the body of a goddess! She loves lingerie - and that is good news for you, because she looks oohh so good in it. She loves to work out and it shows. Jamie could definitely keep you warm dur- ing the cold winter! ............................ http://amateurindex.com/eureka/ EROTIC STORY SITE OF THE DAY Planet Mojo: Mojo brings you the juiciest erotic stories weekly! Every week all new exciting erotic stories are posted for your pleasure. Visit Mojo today! ................ ................................. http://www.planetmojo.com/ DAILY CARTOON ........... http://www.erosinorbit.com/eureka/ ADULT STAR PIC OF THE DAY Every day we bring you an exclusive choice pic of a famous adult porn star. And we must tell you - these pix are abso- luletly brilliant! .... http://www.xxxadultstars.com/eureka/ TODAY'S FREE PIX Pic 1 ........................... http://137.39.63.229/?090 Pic 2 ........................... http://137.39.63.229/?091 Pic 3 ........................... http://137.39.63.229/?092 Pic 4 ........................... http://137.39.63.229/?093 Pic 5 ........................... http://137.39.63.229/?094 Pic 6 ........................... http://137.39.63.229/?095 Pic 7 ........................... http://137.39.63.229/?096 Pic 8 ........................... http://137.39.63.229/?097 Pic 9 ........................... http://137.39.63.229/?098 Pic 10 ........................... http://137.39.63.229/?099 =========================================================== TO UNSUBSCRIBE FROM THIS NEWSLETTER, USE THE REPLY FUNCTION IN YOUR EMAIL PROGRAM, AND SEND THIS NEWSLETTER BACK TO US. ===========================================================

1 0

Surprise - Anonymous Journalist Opposes Laundering [4/4]
by nobody＠REPLAY.COM 17 Dec '03

17 Dec '03

Part 4 "Fighting the Next War" [4/4] [4/4] Next, cyberlaundering? If there is one thing that money launderers hate it is cash; physical cash, that is [No, we hate criminal governments who refuse to issue larger denomination notes]. Shipping huge wads of banknotes is a logistical nightmare [which would be less onerous if, by way of example, the US guVermin recirculated $500, $1000, $5000 and $10,000 FRNs. The printing plates for such "money-laundering friendly" notes having been de-activated since the reign of dictator Roosevelt; refusal to issue higher denomination FRNs to keep pace with Accumulated Wealth Tax extractions (commonly referred to as "inflation") since the 1930s is nothing less than slow-motion, backdoor currency recall]. It also raises the risk that couriers will be intercepted [they mean robbed] and the ["]loot["] traced back to its source. Transferring money electronically is both quicker and easier [but not necessarily safer in certain nations]. [*]Hence concerns in law-enforcement circles that new forms of electronic money could render obsolete traditional methods of tracking ["]tainted["] money, which rely heavily on the poLicing of bank transactions[*]. ["Hence concerns in law-evasion circles that new forms of vooter sanity threatening to outlaw drug Prohibition could render obsolete traditional streams of tax-free income."] ["Hence concerns in law-enforcement circles that new forms of vooter sanity threatening to outlaw drug Prohibition could render obsolete traditional pretexts for increased budgets, privacy deprivation and sheeple tracking."] Electronic-money systems come in three different forms. There are stored-value cards, which allow customers to load money onto a microchip-bearing piece of plastic. This can then be carried around like a credit card. There are computer-based systems, for example, those involving payments over the Internet. and there is talk of hybrid systems, which allow smart cards and network-based payments to work together. Although these new gizmos are still under development, financial regulators and policemen have been studying them intently. And they have raised several questions to which they want answers. One is whether limits will be placed on value that can be held on chip-bearing cards. A card without a limit "could break my back", [then there would be no need for a tree] worries Stanley Morris, [the anti-christ, ] who heads FINCEN, the American government's financial-intelligence unit [FiU]. He thinks launderers could use it to shift millions of dollars on a piece of plastic. The anti-laundering brigade [brigands?!] also wants reassurance that crooks will not be able to set themselves up as e-money issuers. [I guess as opposed to the crooks who set themselves up as fiat banknote issuers] And they want to know whether all transactions in whatever system will be logged at a central point, so that investigators can reconstruct an [unencrypted??] electronic audit trail ["]if necessary["]. [B.S., they don't "want reassurance" or "want to know" squat, this is their non-negotiable DEMAND; they will try to rob, kidnap, jail, and murder anyone who thinks different] At least one card-based system currently being developed by Mondex, a company owned by Master-Card, [MassaCard] is designed to allow money to be transferred directly between cards, without leaving such a trail. DigiCash, which is developing a computer-based payment system, is using what it calls a "one-way privacy" method, which allows payers to check who received money from them, but does not allow the recipients to find out where it came from. [as in a postal money order (but sans the silly $700 per m.o. limit and the ridiculous $2999.99 daily limit) sent to a payee anonymously] While these and other issues, such as who will have jurisdiction over laundering on the Internet, [I smell a brand new Global Bureaucracy in the air] suggest the new systems could cause the authorities a few headaches, some experts beg to differ. A report published last year by the Bank for International Settlements, [another report cited, another worthle$$ bureaucracy, amazing isn't it?] the central bankers' central bank, [in other words, a den of iniquity] noted that in most cases, measures designed to protect the new systems against fraud--such as attaching unique electronic serial numbers to transactions--would make them less attractive for criminal activities than many existing payment systems. At the moment, all financial regulators can do is watch and wait. > E-Communist > 25 St James's Street > London SW1A 1HG > www.economist.com [Remember if you do your banking in a socialist country, there are three parties involved in any transaction: 1) you, the presumed criminal. 2) the (non-)bank employee, snitch/narc/mind-reader. 3) the guVermin employee, looter/thief/spy.] Fly Low S'n'S Pro: Money Laundering, Self-Medication, Militia-Grade Arms, Realism Pro: Indirect Taxation, Adults, Individual Irrevocable Rights } Smurf N Sniff Non-Member, Gunfiscators of Canberra | } P.O. Bunker 6669 "We don't want to be like those paranoid | } Hohoe, Ghana Americans, this is a social DemoBracy." | } fn-fal(a)edict.gov.un +233 55 1234 boycott GovernMedia NLC | Anti: feral guVermin, Vooters, rapacious tyrants, nihilists Anti: biometric herd management, "(The)" children, state granted privileges

1 0

Surprise - Anonymous Journalist Opposes Laundering [3/4]
by nobody＠REPLAY.COM 17 Dec '03

17 Dec '03

Part 3 "Our Enemy: the Journalist" [3/4] [3/4] Whitewash [The Predictable Agenda Revealed] All these developments suggest that the world's existing ["]defences["] against ["]dirty["] money are ["]inadequate["]. [And we all know what their definition of "adequate" would be.] [*]Banking secrecy is a serious problem[*]. As the table shows, bankers in a number of "high-priority" centres can still be prosecuted [heaven forbid!] if they hand over confidential information to officials investigating laundering cases. [So, absent probable cause that a _real_ crime has been committed, "officials" must be allowed to engage in fishing expeditions without repercussion. Therefore, we must give these "officials" carte blanche access to: 1) private (actually public) bank data. 2) safe deposit boxes (send a spare key to FATF when you rent a box). 3) private records (unrecoverable encryption made a felony). 4) physical warrantless searches of "suspected currency smugglers" (on the spot or no-knock). Carte Blanche access is the ultimate goal. All done "confidentially" you understand. I won't tell the victim if you don't. And people would wonder why I don't have a domestic bank account.] It also shows that several of these centres have yet to extend their anti-laundering regimes to cover non-bank financial institutions. [the operative word being _yet_.] No wonder some financial poLiceman claim they are being asked to fight laundrymen with one hand tied behind their backs. [a straightjacket and possibly rope + oak tree would be appropriate <g>] As if that were not bad [good] enough, the current approach to tackling the [non-]problem of onshore and offshore laundering havens is flawed, too. The FATF has done some useful work, [like what exactly?] but it has not been tough enough with slowcoaches. It only censured Turkey several years after it became a member. [Turkey should tell this ATF to go take a flying leap] And it has yet to take action against Austria, another member, which still has anonymous savings accounts [which due to their membership in the reconstituted Holy Roman Empire they will eventually sell out or at best phase out with grandfather clauses] for its citizens [and many non-citizens as well, leave our Sparbuchen alone thank you very much] despite an FATF [*]edict[*] banning anonymity. [A most curious use of language: "despite an edict banning anonymity". And just who is it that supposedly granted FATF the authority to issue _edicts_ (as in dictate, force, coerce) or _ban_ a single goddamn thing?! Apparently a collective "hive" of enthroned, unaccountable, power-usurping bureaucrats are justifying their existence by rendering decisions "for" the little people and sees itself fit to spew forth proclamations unbeknownst to many under imaginary authority it has granted unto itself. How very regal of them. Is said edict (banning anon accounts) an example of the "useful work" this _anonymous_ journalist refers to? The irony is delicious. Does this represent the type of government-by-edict rule that he/she/it finds so agreeable? Perhaps she-he-it spends too much time attending WTO meetings and schmoozing with those-who-know-better to discuss the latest nuances of negotiated edict proclamations. You (anonymous, E-Communist writer) need to get out more, buckwheat. How about putting this edict thingy up for a vote of the Austrian people? An antiquated idea I realize but it would give you and your associates an opportunity to further propagandize the great unwashed to the cause of Total State Control. OTOH, then these aspiring fiscal tyrants would have to crawl out of their committee meetings and explain to the rabble why it is so urgent that private banking be abolished (confidentially, of course). Besides which, owners of anonymous accounts like them just the way they are and would find another way to keep their property out of your greedy little paws regardless (even if you did somehow manage to convince 50.0001% of the vooters to help you fight non-crime. "We" don't have to show you no steeenkin' passport).] Some anti-laundering campaigners say that criticism of members in evaluation reports is often watered down for diplomatic reasons [how can an evaluation be watered down when it starts with zero substance?]. "Every report was put through so many whitewashes", complains Sue Thornhill, [parasite, ] a consultant on laundering to the British Bankers Association. The FATF's fans [such as they are outside the GovernMedia sphere of influence] admit that some plea-bargaining goes on, but insist that it does not let countries off lightly. [What is this utter nonsense: "plea-bargaining" (?) "does not let countries off lightly" (?) Are representatives of "guilty" nations hauled off to some FATF Star Chamber and forced to perform lewd acts with smart cards?!?] Whatever the truth, [the truth being that money laundering is not a crime; acknowledgment of which would run counter to your basic philosophical premise and thus be dismissed as extremist libertarian kookery] there is an even bigger problem with the task force's approach [the problem is the existence of FATF and other agencies of its ilk]. Every time it persuades a financial centre [against it's best interests] to crack down on laundering, crooks will move to new ones [as would any normal person who places a value on customer service]. As the amount of money that comes with them grows, so the incentive for these other havens to change their ways will dimish. [until they become fat and happy like Helvetia, then they begin to evidence a strange desire to look 'respectable' in front of the 'world community' and now readily strap on the knee-pads for their pimp: the United States] The FATF seems to be hoping that peer-group pressure is the solution. [Oh yeah? Just because your friends have abolished (de facto) bank secrecy and have ceased jailing informants and foreign moles does that mean you're going to do it as well? What would your mother say about that?] It has set up a regional Caribbean task [tax] force and is ["]supporting["] the creation of an Asia-Pacific anti-laundering group. [picture an enterprising cretin at FATF calling some string-puller over at the IMF: 'Tell them to give us all the access we want to foreign account holder data or else no more taxpayer coerced bailout for you Asians'...] But even if this attempt to sign up new members works, such an approach will take a long time. And there is a danger that many members will sign up to get the FATF's badge of respectability [and the cushy do-nothing jobs that go along with it for political hacks and career bureaucrats], and then drag their feet over implementing its recommendations. [confusing, are they _edicts_ or _recommendations_ ?] So are economic sanctions against refuseniks the answer? The sort of "economic warfare" envisaged by Senator Kerry is not. Banning citizen[-hostage]s of a few rich countries from dealing with known laundromats would hurt legitimate businesses, while crafty launderers would find ways round the restrictions. [Senator Kerry, (Looter-Taxachusetts): "Yeah right, that's a wimpy apologetic journalist pretending to present both sides of an issue, let's get real here, no _legitimate_ business would need to have an Aruban bank account when our local S&L offers backup withholding, full disclosure on request to any and all government employees, demands for SSN's and fingerprints, deposit insurance and CTRs, in short all the protection and benefits the surveillance state has to offer. So those who have the mistaken notion that all assets DO NOT belong to the state and DO NOT submit to the fact that those assets they are trying to keep from our grasp belong TO US and are only on temporary loan to individual shee, um, people need to be set straight and made an example of. I say we must pull another Panama and invade these small narco-terrorist haven countries and shut all their banks down permanently. If citizens of these pathetic excuses for states want a bank account, our good Bwoston banks are more than happy to serve them."] That leaves Mr Tanzi's proposed strategy as the only current proposal with something to recommend it. Of course, getting an international agreement on minimum anti-laundering standards will not be an easy task. But it is worth a try. For without a concerted global response [= global surveillance of every transaction = dictatorial global bureaucracies] to the problem of ["]dirty["] money, the world's money-laundering machine will be off on yet another devastating [to whom?] cycle. [Summary: Banking secrecy is a serious problem. Unreported asset possession is a serious problem. Non-governmental ComSec is a serious problem. Non-intelligence-agency laundering is a serious problem. Anonymous ownership transfers are a serious problem. Unreported cash transactions are a serious problem. Cash is a serious problem. Teenage fucking is a serious problem. Non-alcohol, non-prescription drug consumption is a serious problem. Contraband smuggling is a serious problem. The emerging e-cash threat is a serious problem. Anonymous accounts are a serious problem. Bearer shares are a serious problem. Multiple identities are a serious problem. Unregistered gun ownership is a serious problem. Inadequate government staffing is a serious problem. Inadequate international cooperation is a serious problem. Inadequate tax revenue is a serious problem. Freedom is a serious problem. Unacceptable. These activities will be stopped. You will be assimilated. These FATF swine need a good ass-kicking.] > E-Communist > 25 St James's Street > London SW1A 1HG > www.economist.com Fly Low S'n'S Pro:__Money Laundering__Self Medication__Militia Grade Arms__Realism________ __Indirect Taxation___________Adults___________Individual Irrevocable Right$ } Smurf N Sniff Non-Member, Gunfiscators of Canberra | } P.O. Bunker 6669 "We don't want to be like those paranoid | } Hohoe, Ghana Americans, this is a social DemoBracy." | } fn-fal(a)edict.gov.un +233 55 1234 boycott GovernMedia NLC | ANTI:_feral guVermin____Vooters__________blue hellmutts______nihilists______ __biometric herd management__"(The) children"__state granted privilege_____!---------------------------------------------------------------------------

1 0

Spam
by The Sheriff 17 Dec '03

17 Dec '03

-----BEGIN PGP SIGNED MESSAGE----- I've got a question for y'all. Some idiot finally sent me a junk e-mail message that I couldn't do anything about with what I have the knowledge to do -- reading the headers turned up only one ISP, which was apparently owned by the spammer. I'm hoping you guys would know where I could find out more about this individual -- I'm hoping that he does in fact buy his service from someone else, and if so, I'm not sure how to find that out. If he doesn't, is there anything I can do? -----BEGIN PGP SIGNATURE----- Version: PGPfreeware 5.0 for non-commercial use <http://www.pgp.com> Charset: noconv iQEVAwUBNLenyABMw4+NR29ZAQHvrgf+NnvFR55ExZrzp2m/XDT5MisT2rem4Hct /okK9HV/DkZJzCsklbqjOrJkEHg96txCPyQ+DKBWatP5ywoaw4O47Tn8udiuDNwI 7DGiFcbYtG5fFHKYzDxM3KWtXbIDn1bliFF80xSoYzYdJKqxCkYPtuaDjasr1EIG iYC9Sm+BQoeFb2n0ptxwB8PsK7Pi5nlf5DCXsIMGrQmcm6GqhgkzC3aNPqNucka4 lyY0YjLnx9WC2JDRrg0Xji1zffC5MiZJrf/1ne9HXylEubWXHh49UdCeAXwyzmDS 5vW7FY2XeQL2OcPOKRVU26eiqnyCxxkx/tLi3yq4yRDt/MfIDHBOuQ== =5oGu -----END PGP SIGNATURE-----

4 6

Congratulations!
by WebSoft Associates 17 Dec '03

17 Dec '03

Dear Sir or Ms: We at WebSoft Associates (http://www.websoftassoc.com) would like to congratulate you on your recent selection by Inc. Magazine as one of the 500 fastest growing private companies in the United States. Being a small private company like yourself, we understand the need for innovative and technically advanced business solutions. We believe that we can offer these solutions at a fair price and at an unmatched professional level. If you are committed to having an Internet presence, we are committed to making that presence be as affordable, practical, and professional as possible. We are currently increasing both our customer base and the services that we provide, as we strive to one day be included in the Inc. 500. We would like you to consider contacting WebSoft for any of your future Internet and business technology needs, and help us meet that goal. Once again congratulations, and thank you for your time and consideration. We will not send further email to your account unless you contact us first. Sincerely, Brian L. Cheek President WebSoft Associates E-mail: Websoft(a)websoftassoc.com Website: http://www.websoftassoc.com

1 0

Re: Freedom Forum report on the State of the First Amendment (fwd)
by Jim Choate 17 Dec '03

17 Dec '03

Forwarded message: > Date: Sat, 10 Jan 1998 13:32:31 -0500 (EST) > From: Jon Galt <jongalt(a)everest.pinn.net> > Subject: Re: Freedom Forum report on the State of the First Amendment > > On 23 Dec 1997, Colin Rafferty wrote: > > > Oppression is done by a society. It can only be stopped by acting > > against the individuals in the society that are doing the oppressing. > > Well make up your mind! Is it done "by a society" or by "individuals"??? Actualy it's both, societies, their beliefs and actions, are individuals acting in concert. The relationship is identical to that of a tree in a forest. ____________________________________________________________________ | | | Those who make peaceful revolution impossible will make | | violent revolution inevitable. | | | | John F. Kennedy | | | | | | _____ The Armadillo Group | | ,::////;::-. Austin, Tx. USA | | /:'///// ``::>/|/ http://www.ssz.com/ | | .', |||| `/( e\ | | -====~~mm-'`-```-mm --'- Jim Choate | | ravage(a)ssz.com | | 512-451-7087 | |____________________________________________________________________|

1 0

Theory Behind USA v. Microsoft
by John Young 17 Dec '03

17 Dec '03

John Cassidy writes in the January 12 New Yorker mag of the controversial economic theory which undergirds DoJ's antitrust action against Microsoft. He cites a seminal 1984 paper by Brian Arthur, "Competing Technologies and Lock-in by Historical Small Events: The Dynamics of Choice Under Increasing Returns." After years of disparagement the theory seems to have caught on, at least at Justice and with others who oppose the theory of free market determination of winners and losers. Arthur argues that market dominance by inferior products is possible, and cites MS-DOS as an example. Arthur is now a scientist at the Santa Fe Institute. He says his theory "stands a great deal of economics on its head." One critic said to Arthur, "If you are right, capitalism can't work." For those unable to get the magazine, we offer a copy of Cassidy's essay: http://jya.com/arthur.htm (33K) A side note: the same issue has a short piece noting that the early charges of militant conspiracy behind the OKC bombing have disappeared from the trials of McVeigh and Nichols, and proposes that an apology is due militants, militia and other paranoiac targets.

3 2

The name "Crypto Kong"
by James A. Donald 17 Dec '03

17 Dec '03

-- I have received some negative feedback about the name "Crypto Kong". Two people have complained that it is unprofessional sounding. This is not necessarily grounds for alarm. One reason the name irritates people is that it sticks in the mind like a bad song, which was of course an important reason for choosing it. No one is likely to say "Hey, I saw this plug for some digital signing tool, but I can't remember the name." On the other hand ... What do you think? --digsig James A. Donald 6YeGpsZR+nOTh/cGwvITnSR3TdzclVpR0+pr3YYQdkG dOmrVP48CpP0XXqoK97INGkIpJVWXfGzg3ZO/DO5 40BWwXgdXOaD0gGym/BpRFmyDIg3eYHNBgULka9Ix --------------------------------------------------------------------- We have the right to defend ourselves and our property, because of the kind of animals that we are. True law derives from this right, not from the arbitrary power of the state. http://www.jim.com/jamesd/

2 1

Freedom, Starvation, and Uncoerced Relationships (fwd)
by Jim Choate 17 Dec '03

17 Dec '03

Forwarded message: > Date: Sat, 10 Jan 1998 11:15:42 -0800 > From: Tim May <tcmay(a)got.net> > Subject: Freedom, Starvation, and Uncoerced Relationships > >Since when has a crypto anarchist been a market anarchist? > > And how else could it be? Easily. The acceptance of freedom of speech is not equivalent to the acceptance to spend and earn money freely and without regulation. Speech and money are *not* equivalent. This is as specious as Vulis' argument that these positions are equivalent to pregnancy in the logical realm, in short you are or aren't. The reality is that few people, other than statists or extremists look at the world let alone their personal beliefs in that simplistic fashion. I believe in the unregulated exercise of speech, including the dissemination and use of crypto technology. To do otherwise implies some sort of ownership of the individual by the society doing the regulating. Clearly an incorrect conclusion. The ability of those same groups to spend their money as they see fit is not supportable by that same logic. Groups must have regulated monetary systems or else they collapse because of the monopolization and therefore loss of vitality of markets. To believe otherwise is to accept the premise that these monopolies could somehow buy an individuals rights. Clearly a result even a market anarchist can't accept. ____________________________________________________________________ | | | Those who make peaceful revolution impossible will make | | violent revolution inevitable. | | | | John F. Kennedy | | | | | | _____ The Armadillo Group | | ,::////;::-. Austin, Tx. USA | | /:'///// ``::>/|/ http://www.ssz.com/ | | .', |||| `/( e\ | | -====~~mm-'`-```-mm --'- Jim Choate | | ravage(a)ssz.com | | 512-451-7087 | |____________________________________________________________________|

1 0

The name "Crypto Kong" (fwd)
by Jim Choate 17 Dec '03

17 Dec '03

Forwarded message: > Date: Sat, 10 Jan 1998 11:18:17 -0800 (PST) > From: "James A. Donald" <jamesd(a)echeque.com> > Subject: The name "Crypto Kong" > I have received some negative feedback about the name > "Crypto Kong". > > Two people have complained that it is unprofessional > sounding. Two people? That's it? > This is not necessarily grounds for alarm. One reason the > name irritates people is that it sticks in the mind like a > bad song, which was of course an important reason for > choosing it. No one is likely to say "Hey, I saw this plug > for some digital signing tool, but I can't remember the > name." When I think of it I think of 'Donkey Kong'. > What do you think? Unless the loss would result in ten's of thousands of dollars of income leave it. If it would effect a large sales market it under a more acceptable name to the business community. Nothing unethical about selling the same product under two different names... ____________________________________________________________________ | | | Those who make peaceful revolution impossible will make | | violent revolution inevitable. | | | | John F. Kennedy | | | | | | _____ The Armadillo Group | | ,::////;::-. Austin, Tx. USA | | /:'///// ``::>/|/ http://www.ssz.com/ | | .', |||| `/( e\ | | -====~~mm-'`-```-mm --'- Jim Choate | | ravage(a)ssz.com | | 512-451-7087 | |____________________________________________________________________|

1 0

Nervous Nellies at the PO
by Gary Harland 17 Dec '03

17 Dec '03

Came across this by chance...having never heard of this 'disgruntled' web site, I'm curious as to how the PO managed to learn about the offending story...if they fired him because of an explicity fictional article expressing a fantasy shared by vast hordes of Americans then it kind of looks like the Post Office 'went postal' on one of their employees. > DISGRUNTLED POSTAL WORKER > > A South Bay postal worker has been fired for a fictional article he > got published on the Internet, in which he depicted a worker who was > so fed up with conditions in his San Jose office that he pulled out a > gun and shot his dictatorial and much despised supervisor. The article > appeared in December in the on-line publication Disgruntled, which > bills itself as the business magazine for people who work for a > living. > > The story, "Scrooged Again," appeared to have struck a nerve with his > employer, who informed him that he would be removed from his job at > the postal service effective Jan. 27 because of "unacceptable and > disrespectful conduct." > > The Web page site for Disgruntled is: http://www.disgruntled.com > ----------------------------------------------------------------- foggy(a)netisle.net lat:47d36'32" long:122d20'12" "Rather perish than hate and fear, and twice rather perish than make oneself hated and feared." -F. Nietzche- -----------------------------------------------------------------

1 0

Re: Spam
by lcs Mixmaster Remailer 17 Dec '03

17 Dec '03

>I've got a question for y'all. > >Some idiot finally sent me a junk e-mail message that >I couldn't do anything about with what I have the >knowledge to do -- reading the headers turned up only >one ISP, which was apparently owned by the spammer. > >I'm hoping you guys would know where I could find out >more about this individual -- I'm hoping that he does >in fact buy his service from someone else, and if so, >I'm not sure how to find that out. If he doesn't, is >there anything I can do? His traffic has to be routing through somebody or multiple somebodies. Traceroute it and complain to the upstream site. Unless they're cretins like CIX they'll kill his connection.

1 0

LUC Public Key Crypto...
by Jim Choate 17 Dec '03

17 Dec '03

Hi, In the process of doing some research on Gauss I stumbled across this... ____________________________________________________________________ | | | Those who make peaceful revolution impossible will make | | violent revolution inevitable. | | | | John F. Kennedy | | | | | | _____ The Armadillo Group | | ,::////;::-. Austin, Tx. USA | | /:'///// ``::>/|/ http://www.ssz.com/ | | .', |||| `/( e\ | | -====~~mm-'`-```-mm --'- Jim Choate | | ravage(a)ssz.com | | 512-451-7087 | |____________________________________________________________________| Forwarded message: > Dr. Dobb's Web Site > > LUC PUBLIC-KEY ENCRYPTION > > > > A secure alternative to RSA > > Peter Smith > > Peter has worked in the computer industry for 15 years as a > programmer, analyst, and consultant and has served as deputy editor of > Asian Computer Monthly. Peter's interest in number theory led to the > invention of LUC in 1991. He can be reached at 25 Lawrence Street, > Herne Bay, Auckland, New Zealand. > > > _________________________________________________________________ > > According to former NSA director Bobby Innman, public-key cryptography > was discovered by the National Security Agency in the early seventies. > At the time, pundits remarked that public-key cryptography (PKC) was > like binary nerve gas--it was potent when two different substances > were brought together, but quite innocuous in its separate parts. > Because the NSA promptly classified it, not much was known about PKC > until the mid-seventies when Martin Hellman and Whitfield Diffie > independently came up with the notion and published papers about it. > > Traditional cryptographic systems like the venerable Data Encryption > Standard (DES) use the same key at both ends of a message > transmission. The problem of ensuring correct keys leads to such > expensive expedients as distributing the keys physically with trusted > couriers. Diffie and Hellman (and the NSA) had the idea of making the > keys different at each end. In addition to encryption, they envisioned > this scheme would also lead to a powerful means of source > authentication known as digital signatures. > > RSA, developed in 1977, was the first reliable method of source > authentication. The RSA approach (patented in the early eighties) > initiated intense research in "number theory," one of the most > recondite areas of mathematics. Although C.F. Gauss studied this topic > in the early 1800s (referring to it then as "higher arithmetic"), very > little real progress has been made in solving the problem of factoring > since then. The means available today are essentially no better than > exhaustive searching for prime factors. In terms of intractability > theory, however, no one has yet proved that the problem is > intractable, although researchers believe it to be so. > > > > The RSA Algorithm > > > > RSA works by raising a message block to a very large power, then > reducing this modulo N, where N (the product of two large prime > numbers) is part of the key. Typical systems use an N of 512 bits, and > the exponent to which blocks are raised in decryption is of the same > order. An immediate problem in implementing such a system is the > representation and efficient manipulation of such large integers. > (Standard microprocessors don't really have the power to handle normal > integer sizes and functions; even numeric coprocessors are inadequate > when integers of this size are involved.) > > RSA has dominated public-key encryption for the last 15 years as > research has failed to turn up a reliable alternative--until the > advent of LUC. Based on the same difficult mathematical problem as > RSA, LUC uses the calculation of Lucas functions instead of > exponentiation. (See text box entitled, "How the Lucas Alternative > Works.") > > Because we're working in the area of mathematics, we can formally > prove that LUC is a true alternative to RSA. Furthermore, we can show > that a cipher based on LUC will be at least as efficient. More > importantly, we can show that LUC is a stronger cipher than RSA. The > reason is that under RSA, the digital signature of a product is the > product of the signatures making up the product; in mathematical > terms, M{e}L{e}=(ML){e}. This opens RSA to a cryptographic attack > known as adaptive chosen-message forgery. Ironically, this is outlined > in a paper co-authored by Ron Rivest (the "R" in RSA). LUC is not > multiplicative and therefore not susceptible to this attack. Using > Lucas functions, V[e](M,1)V[e](L,1) is not equal to V[e](ML,1). In > other words, the use of exponentiation leads to RSA being > multiplicative in this way, while LUC's use of Lucas functions avoids > this weakness. > > Choosing the Algorithms > > > > Lucas functions have been studied mainly in relation to primality > testing, and it was to these sources we turned when researching > efficient algorithms for implementing LUC. For given parameters, the > Lucas functions give rise to two series, U[n] and V[n]. The first > algorithm (see Listing One, page 90) calculated both, even though we > were only interested in V[n]. It was only in a paper on factoring > integers that we found a means of calculating V[n] alone (see Listing > Two, page 90). The pseudocode examples show that both algorithms have > two phases: The work done when the current bit is a 0 is half the work > necessary when the current bit is a 1. > > More Details. > > Typically, in systems like LUC the exponent used for encryption is a > much smaller integer than that used for decryption. A commonly chosen > encryption exponent is the prime number 65,537. This is a good choice > for fast encryption as all but 2 of the 17 bits are 0s. We have no > such control over the decryption exponent, but there is a way of > halving the work, and thus, of introducing a limited degree of > parallelism into the calculation. > > Since LUC is a public-key cryptosystem, we can always assume that the > possessor of the private decrypting keys knows the two primes (p and > q) which make up the modulus, N. Consequently, we can reduce the > exponent and message with respect to the two primes, in each case at > least halving the amount of work. At the end of the calculation with > respect to the primes, we bring the results together to produce the > final plain text (see Listing Three, page 90). > > Large-integer Arithmetic > > > > There's really only one source of information about large-integer > arithmetic: Knuth's The Art of Computer Programming. We found that > almost every time we referred to his book, we came up with some new > angle or way of tweaking some extra performance out of our code. > > We decided to represent the large integers as 256-byte arrays, with > the low byte giving the length (in bytes) of the integer. For > instance, the 8-byte hexadecimal number 1234567890ABCDEF would appear > in a file view as 08 EF CD AB 90 78 56 34 12. These arrays became a > Pascal-type har (for hexadecimal array). We can store integers of over > 600 decimal digits in our hars, but because the hars must be able to > hold the results of a multiplication, we are limited to manipulating > integers up to 300 decimal digits in length. > > Implementation of addition, subtraction, and multiplication went quite > smoothly; implementation of division took more effort. (We took > comfort in not being the first to encounter problems with division. > Lady Ada Lovelace, the first computer programmer, said, "I am still > working at some most entangled notations of division, but see my way > through them at the expense of heavy labor, from which I shall not > shrink as long as my head can bear it.") We tried various methods, > including one based on Newton which calculated the inverse of the > divisor and then multiplied. (See Knuth's discussion.) We finally > opted for Knuth's Algorithm D, despite his warning that it contained > possible discontinuities. At that stage, we were working on a 16-bit > 80286 PC; see Listing Four, page 90. > > Of course there was much more than the division routine to consider, > but we found that it was the critical routine in terms of getting LUC > to run at a reasonable speed. Once we had upgraded to an 80386, we > converted to a full 32-bit implementation. The assembler code for the > division (still Algorithm D) is given in Listing Five (page 91). > Although space constraints prevent a complete presentation of the > code, suffice to say that we have been able to achieve a > signing/decryption speed on a modulus of 512 bits of over 200 bits per > second (33-MHz 80386, 0 wait states). > > Other Issues > > > > Central to any cryptographic system are keys. In LUC, if an adversary > is able to find p and q, the prime factors of modulus N, then all > messages sent with N can be either read in the case of encryption or > forged in the case of signing. > > Since the days of Gauss, research on factoring has come up with > various so-called "aleatoric" methods of factoring some numbers. These > methods are like cures for poison ivy: numerous, and occasionally > efficacious. One old method, found by Pierre Fermat, is very quick at > factoring some types of composite numbers. If N is the product of two > primes which are close together, then it can be easily factored. For > example, if p=1949, and q=1951, then N=3802499. Taking the square root > of N, we find that it is approximately 1949.999. Adding 1 to the > integral part of this (giving 1950), we square this, giving 3802500. > If we now subtract N from this square, we get a difference of 1, which > is the square of itself. This means that N has been expressed as the > difference of two squares. As we learned in high school, x{2}-y{2} = > (x-y)(x+y), and so we obtain the two factors. > > Fermat's method works whenever the ratio of the factors is close to an > integer. (Note that the ratio is close to 1 in the above discussion.) > This attack, as cryptographers call methods used to break a cipher, > has to be guarded against in generating the modulus N. > > Another guard is that neither (p + 1) and (q + 1) nor (p - 1) and (q - > 1) should be made up of small prime factors. There are many other > guards of varying degrees of importance, but the entire area needs > consideration depending on the level of security required, and how > long the keys are meant to last. > > The basic idea behind LUC is that of providing an alternative to RSA > by substituting the calculation of Lucas functions for that of > exponentiation. While Lucas functions are somewhat more complex > mathematically than exponentiation, they produce superior ciphers. > > This substitution process can be done with systems other than the RSA. > Among these are the Hellman-Diffie-Merkle key exchange system (U.S. > Patent number 4,200,770), the El Gamal public-key cryptosystem, the El > Gamal digital signature, and the recently proposed Digital Signature > Standard (DSS), all of which use exponentiation. > > The nonmultiplicative aspect of Lucas functions carries over, allowing > us to produce alternatives to all these. In the case of the DSS, Lucas > functions allow us to dispense with the one-way hashing cited (but not > specified) in the draft standard. > > A New Zealand consortium has been set up to develop and license > systems based on LUC, which is protected by a provisional patent. For > more information, contact me or Horace R. Moore, 101 E. Bonita, Sierra > Madre, California 91024. > > References > > > > Athanasiou, Tom. "Encryption Technology, Privacy, and National > Security." MIT Technology Review (August/September, 1986). > > Diffie, W. and M.E. Hellman. "New Directions in Cryptography." IEEE > Transactions on Information Theory (November, 1976). > > El Gamal, Taher. "A Public Key Cryptosystem and a Signature Scheme > Based on Discrete Logarithms." IEEE Transactions on Information Theory > (July, 1985). > > Gauss, C.F. "Disquisitiones Arithmeticae," Article 329. > > Goldwasser, S., S. Micali, and R. Rivest. "A Digital Signature Scheme > Secure Against Adaptive Chosen Message Attack." SIAM J. COMPUT (April, > 1988). > > Kaliski, Burton S., Jr. "Multiple-precision Arithmetic in C." Dr. > Dobb's Journal (August, 1992). > > Knuth, D.E. The Art of Computer Programming: Volume II: Semi-Numerical > Algorithms, second edition. Reading, MA: Addison-Wesley, 1981. > > Schneier, Bruce. "Untangling Public Key Cryptography." Dr. Dobb's > Journal (May, 1992). > > Williams, H.C. "A p + 1 method of factoring." Mathematics of > Computation (vol. 39, 1982). > > How the Lucas Alternative Works > > > > As with RSA encryption, use of the Lucas alternative involves two > public keys: N and e. The number N is assumed to be the product of two > large (odd) prime numbers, p and q. Encryption and decryption of a > message is achieved using Lucas sequences, which may be defined as > shown in Example 1. Note that P and Q are integers. > > If a message P is to be sent, it is encoded as the residue P1 modulo N > of the eth term of the Lucas sequence V[n](P,1), and then transmitted. > The receiver uses a secret key d (based on the prime factorization of > N) to decode the received message P1, by taking the residue modulo N > of the dth term of the Lucas sequence V[n](P1,1). The secret key d is > determined so that V[d](V[e](P,1),1) = P modulo N, ensuring the > decryption of the received message P1 as P. The existence of such a > key d is based on the following theorem. > > Theorem > > > > Suppose N is any odd positive integer, and P is any positive integer, > such as P{2}-4 is coprime to N. If r is the Lehmer totient function of > N with respect to D = P{2}-4 (see Example 2), then V[mr+1](P,1)=P > modulo N for every positive integer m. The condition that P{2}-4 be > coprime to N is easily checked, as P{2}-4=(P+2)(P-2). Also, because > V[d](V[e](P,1),1)=V[de](P,1), according to Example 4(e), the key d may > simply be chosen so that de=1 modulo r. > > The Lehmer Totient Function > > > > Suppose P and Q are integers, and a and b are the zeros of X{2}-Px+Q > (so that P = a+b while Q = ab). Also, let D be the discriminant of > x{2}-Px+Q. That is, D = P{2}-4Q = (a-b){2}. > > The Lucas sequences U[n] = U[n] (P,Q) and V[n] = V[n] (P,Q) are > defined for n = 0,1,2, and so on by the equation in Example3. > > In particular, U[0] = 0, U[1] = 1, and then U[n+1] = PU[n] - QU[n-1] > (for n = 1,2,3,...), while V[0] = 2, V[1] = P, and similarly V[n+1]= > PV[n]-QV[n-1] (for n = 1,2,3,...). These sequences satisfy a number of > identities, including the following which may be simply obtained from > the definitions in Example 4. > > Next, suppose N is any positive integer, and let r be the Lehmer > totient function of N with respect to D = P{2}-4Q, defined the same > way as in the statement of the theorem. In the special case where N is > an odd prime p, the Lehmer totient function of p with respect to D is > the number given by the equation in Example 5(a). In this case, the > Lucas-Lehmer theorem states that if p does not divide Q then the > equation in Example 5(b) holds true. > > Example of LUC > > > > Let N = pxq = 1949x2089=4071461, and P = 11111, which equals the > message to encrypt/decrypt. The public keys will be e and N; the > private key will be d. First, calculate r, the Lehmer totient function > of P with respect to N. To do this we need to calculate the Legendre > of p and q. Let D = p{2}-4; then (D/1949) =-1 and (D/2089)=-1 are the > two Legendre values. Hence r is the least common multiple of 1949 + 1 > and 2089 + 1; see Example 6(a). Choosing e = 1103 for our public key, > we use the Extended Euclidean Algorithm to find the secret key d, by > solving the modular equation ed = 1 mod r. d turns out to equal 24017. > > To encrypt the message 11111, we make the calculation shown in Example > 6(b). To decrypt the encrypted message, we calculate as in Example > 6(c). --P.S. > > > _LUC PUBLIC-KEY ENCRYPTION_ > by Peter Smith > > > [LISTING ONE] > > { To calculate Ve(P,1) modulo N } > Procedure LUCcalc; > {Initialise} > BEGIN > D := P*P - 4; ut := 1; vt := P; u := ut; v := vt; > If not odd(e) then BEGIN u := 0; v := 2; END; > e := e div 2; > {Start main} > While e > 0 do > BEGIN > ut := ut*vt mod N; vt := vt*vt mod N; > If vt < 3 then vt := vt + N; > vt := vt - 2; > If odd(e) then > BEGIN > c := (ut*v + u*vt) mod N; > v := (vt*v + D*u*ut) mod N; > If odd(v) then v := v + N; v := v/2; > If odd(c) then c := c + N; u := c/2; > END; > e := e div 2; > END; > END; {LUCcalc} > > { The required result is the value of v.} > > > > > > > [LISTING TWO] > Pseudocode for calculating Lucas Functions > > Procedure wiluc { V = V(M) Mod N, the Mth Lucas number(P,1) } > Var > V,Vb,P,Vf,N,M,NP, Vd, Vf : LargeInteger ; > carry, high_bit_set : boolean ; > bz : word ; > BEGIN > Va := 2 ; { V[0] } Vb = P ; { V[1] } > NP := N - P; bz := bits(M) -1 ; { test bits from high bit downwards } > For j := 1 to bz do > BEGIN > Vc := Vb * Vb; Vf = Vc ; If Vf < 2 then Vf := Vf + N > Vf := Vf - 2; Vd := Va * Vb > { Vc := V, Vd := V*Vb, Vf := V-2} > If high_bit_set Then > BEGIN > Vb := P * Vc; If Vb < Vd then Vb := Vb + N; Vb := Vb - Vd; > If Vb < P then Vb := Vb + N; Vb := Vb - P; Va := Vf > END ; > Else BEGIN { "even" ie high bit not set } > Va := Vd; If Va < P then Va := Va + N; Va := Va - P; > Vb := Vf; > END ; > High_bit_set := next_bit_down(M); > {This boolean function determines the setting of the next bit down} > Va := Va Mod N; Vb := Vb Mod N > END ; { for j to bz } > END ; {wiluc} > > > > > > > [LISTING THREE] > > { Pseudocode for splitting decryption/signing over p and q > (N = p*q) } > Procedure hafluc ( var s,p,q,m,e : LargeInteger ; qix : word ) ; > var ep,emq, > temp,pi,qi, > b,n,pa,qa : LargeInteger ; > > { This procedure applies only to decipherment and signing, where the primes > making up the modulus N ( = p * q) are known (or can be easily deduced, > since both keys are known). Applying it allows us to halve the amount of > work. Encipherment is usually done with a small key - standard is 65537. } > Begin > Qpr (pa,qa,p,q,m,qix ) ; {} {assumes qix already calculated } > ep = e ; ep = ep Mod pa > emq = e ; emq = emq Mod qa > mp = m ; mp = mp Mod p > mq = m ; mq = mq Mod q > wiluc(q2,mq,emq,q) ; wiluc(p2,mp,ep,p) ; > if p2 < q2 then > Begin > temp = q q = p p = temp > temp = q2 q2 = p2 p2 = temp > End ; > temp = p2 temp = temp - q2 > n = p * q > { Solve with Extended Euclidean algorithm qi = 1/q Mod p. The algorithm > for the Extended Euclidean calculation can be found in Knuth. } > r = temp * p > r = r mod N > s = r * qi > s = s Mod n > s = s + p2 > End ; { hafluc } > Procedure SignVerify ; > Begin > h4 = 4 > p = large prime... > q = large prime... > n = p * q > bz := bits(n) ; > {write(cf,' generate 4 keysets (d,e) for p1,q1') ;} > { > qix table for T[qix] > Convention for qix > This calculation is explained below. > Lehmer totient qix Legendre values for p and q > i.e. T[qix] = LCM > (p - 1),(q - 1) 1 1 1 > (p - 1),(q + 1) 2 1 -1 > (p + 1),(q - 1) 3 -1 1 > (p + 1),(q + 1) 4 -1 -1 > e = encryption key, small prime eg 65537 > mu = message as large integer less than n > Solve e * d[qix] = 1 Mod T[qix] using Extended Euclidean Algorithm > where T[qix] is lcm(p1,q1), the Lehmer totient function of N > with repect to mu, according to the above table. > This gives 4 possible values of d, the decryption/signing key. > The particular value used depends on the message mu, as follows: > Let D = mu2 - 4. Calculate the Legendre values of D with respect to > both p and q. This value is -1 if D is a quadratic non-residue of > p (or q), and equal to 1 if D is a quadratic residue of p (or q). > N.B. This part is the most difficult part of LUC! Take care. > > Signing (Deciphering): > hafluc (a,pu,qu,mu,d,qix) > > Verifying (Enciphering): > Use Wiluc. > End. > > > > > > > [LISTING FOUR] > > Algorithm D in 32-bit Intel assmbler > Author: Christopher T. Skinner > Short version of Mod32.Txt with scalings just as comments > Modulus routine for Large Integers > u = u Mod v > Based on: > D.E.Knuth The Art of Computer Programming > Vol 2 Semi-Numerical Algorithms 2ed 1981 > Algorithm D page 257 > We use a Pascal Type called "har" ( for "hexadecimal array") > Type > har = Array[0..255] of byte ; > Var u,v : har ; > Note that u[0] is the length of u and that the > integer begins in u[1] > It is desirable that u[1] is on a double word boundary. > > ; Turbo Pascal Usage: ( Turbo Pascal v6.0) > ; {$L Mod32a} { contains mod32 far } > ; {$F+} { far pointers } > ; procedure Mod32 ( var u,v : har ) ; > ; Turbo Assembler code: (TASM v2.01)--requires 32-bit chip ie 386 or 486 > ; nb FS and GS can be used as temporary storage. Don't try to use them as > ; segment registers because Windows 3.0 restricts their allowed range, even > ; after you have finished out of Windows. You will hang for sure, unless you > ; have used a well-behaved protected-mode program to reset them, or cold boot. > > Data Segment Word Public Use16 > vdz dw ? ; size v words > va dd ? ; hi dword v > vb dd ? ; 2nd " v > vi dw ? ; ^v[1] > savdi dw ? ; used in addback > Data EndS > > Code Segment Word Public Use16 > Assume cs:Code, ds:Data ,es:Nothing > Public mod32 > ; Pascal Parameters: > u Equ DWord Ptr ss:[bp+10] ; Parameter 1 of 2 (far) > v Equ DWord Ptr ss:[bp+ 6] ; parameter 2 of 2 > uof equ word ptr ss:[bp+10] > vinof equ word ptr ss:[bp+ 6] > > mod32 Proc far > push bp > mov bp,sp > push di > push si > push ds ; save the DS > > ; Before using Mod32 check that: > ; v > 0 > ; v < u u <= 125 words > ; v[0] is a multiple of 4 and at least 8 > ; v[top] >= 80h (may need to scale u & v) > ; make u[0] = 0 Mod 4 (add 1..3 if required) > domod: > ; now point to our v > mov ax,seg v > mov ds,ax > assume ds:Data > mov si, offset v > cld > assume es:Nothing > xor ah,ah > mov al,es:[di] ; ax = size of u in bytes "uz" > mov cx,ax ; cx = uz > mov bx,ax ; bx = uz > mov al,[si] > mov dx,ax ; dx = size v bytes > shr ax,2 > mov vdz,ax ; vdz " dwords vz = 0 mod 4 > sub bx,dx ; bx = uz - vz difference in bytes > mov ax,bx ; ax = uz - vz > sub ax,3 ; ax = uz - vz - 3 -> gs > sub cx,3 ; cx = uz - 3 > add cx,di ; cx = ^top dword u > add ax,di > mov gs,ax ; gs = ^(uz-vz-3) u start (by -4 down to 1) > inc di > mov fs,di ; fs = uf = ^u[1] , end point > inc si > mov vi,si ; vi = ^v[1] > add si,dx > mov eax,[si-4] > mov va,eax ; va = high word of v > mov eax,[si-8] > mov vb,eax ; vb = 2nd highest word v > mov di,cx ; set di to ut , as at bottom of loop > d3: > mov edx,es:[di] ; dx is current high dword of u > sub di,4 > mov eax,es:[di] ; ax is current 2nd highest dword of u > mov ecx,va > cmp edx,ecx > jae aa ; if high word u is 0 , never greater than > div ecx ; mov ebx,eax > mov esi,edx ; si = rh > jmp short ad ; Normal route -- -- -- -- --> > aa: mov eax,0FFFFFFFFh > mov edx,es:[di] ; 2nd highest wrd u > jmp short ac > ab: mov eax,ebx ; q2 > dec eax > mov edx,esi ; rh > ac: mov ebx,eax ; q3 > add edx,ecx > jc d4 ; Knuth tests overflow, > mov esi,edx > ; normal route: > ad: > mul vb ; Quotient by 2nd digit of divisor > cmp edx,esi ; high word of product : remainder > jb d4 ; no correction to quot, drop thru to mulsub > ja ab ; nb unsigned use ja/b not jg/l > cmp eax,es:[di-4] ; low word of product : 3rd high of u > ja ab > d4: ; Multiply & subtract * * * * * * * > mov cx,gs > mov di,cx ; low start pos in u for subtraction of q * v > sub cx,4 > mov gs,cx > xor ecx,ecx > Mov cx,vdz ; word count for q * v > mov si,vi ; si points to v[1] > xor ebp,ebp ; carry 14Oct90 bp had problems in mu-lp > even > ; ** ** ** ** ** ** ** ** > ba: lodsd ; eax <- ds[si] > mul ebx ; dx:ax contains product carry set if dx > 0 > add eax,ebp > adc edx,0 > sub es:[di],eax > adc edx,0 > mov ebp,edx > add di,4 > loop ba ; dec cx , jmp if not 0 > ; .. .. .. . .. .. . .. .. . .. . . .. > sub es:[di],edx > jnc d7 > > mov si,vi ; add back (rare) > mov savdi,di > mov di,gs > add di,4 > clc > mov cx,vdz > bb: lodsd ; eax = ds[si] si + 2 > adc es:[di],eax > inc di > inc di > inc di > inc di > loop bb > xor eax,eax > mov es:[di],eax > mov di,savdi > ; test with: > ; 1,00000000,00000000,00000001/ 80000000,00000000,00000001 > d7: > mov bx,fs ; fs ^u[1] > mov ax,gs ; gs = current u start position > cmp ax,bx ; current - bottom > jb d8 > sub di,4 > jmp d3 > d8: > ; here we would scale u down if it had been scaled up > quex: ; quick exit if v < u > cld ; just in case > pop ds > pop si > pop di > pop bp > ret 8 ; 2 pointers = 4 words = 8 bytes > mod32 EndP ; > Code Ends > End > > > > > > [LISTING FIVE] > > Algorithm D in 16-bit Intel assembler > Author: Christopher T. Skinner > mod16.txt 21 Au8 92 16 bit modulus > ; divm Modulus > Data Segment Word Public > vwz dw ? ; size v words > va dw ? ; hi word v > vb dw ? ; 2nd " v > vi dw ? ; ^v[1] > uf dw ? ; ^u[3] > uz dw ? ; size u byte > vz dw ? ; " v " > ua dw ? ; ^( u[0] + uz - vz -1 ) , mul sub start > ut dw ? ; ^ u[topword] > qh dw ? > uzofs dw ? ; ttt > vzofs dw ? ; ttt > Data EndS > Code Segment Word Public > Assume cs:Code, ds:Data > Public diva > > u Equ DWord Ptr [bp+10] ; ES:DI > v Equ DWord Ptr [bp+6] ; DS:SI > ; NB v Must be Global, DS based... > diva Proc far > push bp > mov bp,sp > push ds > cld ; increment lodsw in mulsub > lds si,v > les di,u > xor ah,ah > mov al,es:[di] ; ax = uz size of u in bytes N.B. uz is not actually used > mov cx,ax ; cx = uz > mov bx,ax ; bx = uz > mov al,ds:[si] > mov dx,ax ; dx = size v bytes > shr ax,1 > mov vwz,ax ; vwz " words > sub bx,dx ; bx = uz - vz difference in bytes > mov ax,bx ; ax = uz - vz > dec ax ; ax = uz - vz - 1 -> ua > dec cx ; cx = uz - 1 > add cx,di ; cx = ^top word u > mov ut,cx ; ut = ^top word u > add ax,di > mov ua,ax ; ua = ^(uz-vz-1) u start (by -2 down to 1) > inc di > mov uf,di ; uf = ^u[1] , end point > inc si > mov vi,si ; vi = ^v[1] > add si,dx > mov ax,ds:[si-2] > mov va,ax ; va = high word of v > mov ax,ds:[si-4] > mov vb,ax ; vb = 2nd highest word v > mov di,cx ; set di to ut , as at bottom of loop > d3: > mov dx,es:[di] ; dx is current high word of u > dec di > dec di > mov ut,di > mov ax,es:[di] ; ax is current 2nd highest word of u > mov cx,va > cmp dx,cx > jae aa ;if high word u is 0 , never greater than > div cx ; > mov qh,ax > mov si,dx ; si = rh > jmp ad ; Normal route -- -- -- -- --> > aa: mov ax,0FFFFh > mov dx,es:[di] ; 2nd highest wrd u > jmp ac > ab: mov ax,qh > dec ax > mov dx,si ; rh > ac: mov qh,ax > add dx,cx > jc d4 ; Knuth tests overflow, > mov si,dx > ad: mul vb ; Quotient by 2nd digit of divisor > cmp dx,si ; high word of product : remainder > jb d4 ; no correction to quot, drop thru to mulsub > ja ab ; nb unsigned use ja/b not jg/l > cmp ax,es:[di-2] ; low word of product : 3rd high of u > ja ab > d4: ; Multiply & subtract * * * * * * * > mov bx,ua > mov di,bx ; low start pos in u for subtraction of q * v > dec bx > dec bx ; > mov ua,bx > Mov cx,vwz ; word count for q * v > mov si,vi ; si points to v[1] > mov bx,qh > xor bp,bp > ; ** ** ** ** ** ** ** ** > ba: lodsw ; ax <- ds[si] si + 2 preserve carry over mul ? > mul bx ; dx:ax contains product carry set if dx > 0 > add dx,bp > xor bp,bp > sub es:[di],ax > inc di > inc di > sbb es:[di],dx > rcl bp,1 > loop ba ; dec cx , jmp if not 0 > ; .. .. .. . .. .. . .. .. . .. . . .. > rcr bp,1 > jnc d7 > > mov si,vi ; add back (rare) > mov di,ua > inc di > inc di > clc > mov cx,vwz > bb: lodsw ; ax = ds[si] si + 2 > adc es:[di],ax > inc di > inc di > loop bb > mov cx,ut > add cx,4 > sub cx,di > shr cx,1 ; word length of u > bc: mov Word Ptr es:[di],0 > inc di > inc di > loop bc ; > dec di ; > dec di ; > clc > d7: > mov ax,uf > cmp ua,ax > jb d8 > dec di ; New these are suspicious, with an add back and a > dec di ; New > jmp d3 > d8: > cld ; just in case > pop ds > pop bp > ret 8 ; 2 pointers = 4 words = 8 bytes ??? > diva EndP ; > Code Ends > End > > > _________________________________________________________________ > > Copyright © 1998, Dr. Dobb's Journal > Dr. Dobb's Web Site Home Page -- Top of This Page > >

1 0

RB_Fermat.html
by Jim Choate 17 Dec '03

17 Dec '03

PIERRE DE FERMAT (1601 - 1665) From `A Short Account of the History of Mathematics' (4th edition, 1908) by W. W. Rouse Ball. While Descartes was laying the foundations of analytical geometry, the same subject was occupying the attention of another and not less distinguished Frenchman. This was Fermat. Pierre de Fermat, who was born near Montauban in 1601, and died at Castres on January 12, 1665, was the son of a leather-merchant; he was educated at home; in 1631 he obtained the post of councillor for the local parliament at Toulouse, and he discharged the duties of the office with scrupulous accuracy and fidelity. There, devoting most of his leisure to mathematics, he spent the remainder of his life - a life which, but for a somewhat acrimonious dispute with Descartes on the validity of certain analysis used by the latter, was unruffled by any event which calls for special notice. The dispute was chiefly due to the obscurity of Descartes, but the tact and courtesy of Fermat brought it to a friendly conclusion. Fermat was a good scholar, and amused himself by conjecturally restoring the work of Apollonius on plane loci. Except a few isolated papers, Fermat published nothing in his lifetime, and gave no systematic exposition of his methods. Some of the most striking of his results were found after his death on loose sheets of paper or written in the margins of works which he had read and annotated, and are unaccompanied by any proof. It is thus somewhat difficult to estimate the dates and originality of his work. He was constitutionally modest and retiring, and does not seem to have intended his papers to be published. It is probable that he revised his notes as occasion required, and that his published works represent the final form of his researches, and therefore cannot be dated much earlier than 1660. I shall consider separately (i) his investigations in the theory of numbers; (ii) his use in geometry of analysis and of infinitesimals; and (iii) his method for treating questions of probability. (i) The theory of numbers appears to have been the favourite study of Fermat. He prepared an edition of Diophantus, and the notes and comments thereon contain numerous theorems of considerable elegance. Most of the proofs of Fermat are lost, and it is possible that some of them were not rigorous - an induction by analogy and the intuition of genius sufficing to lead him to correct results. The following examples will illustrate these investigations. (a) If p be a prime and a be prime to p then a^(p-1) - 1 is divisible by p, that is, a^(p-1) - 1 \equiv 0 (mod p). A proof of this, first given by Euler, is well known. A more general theorem is that a^(\phi(n)) - 1 \equiv 0 (mod n) (mod n), where a is prime to n and \phi(n) is the number of integers less than n and prime to it. (b) An odd prime can be expressed as the difference of two square integers in one and only one way. Fermat's proof is as follows. Let n be the prime, and suppose it equal to x² - y², that is, to (x + y)(x - y). Now, by hypothesis, the only integral factors of n are n and unity, hence x + y = n and x - y = 1. Solving these equations we get x = œ (n + 1) and y = œ (n - 1). (c) He gave a proof of the statement made by Diophantus that the sum of the squares of two integers cannot be of the form 4n - 1; and he added a corollary which I take to mean that it is impossible that the product of a square and a prime of the form 4n - 1 [even if multiplied by a number prime to the latter], can be either a square or the sum of two squares. For example, 44 is a multiple of 11 (which is of the form 4 × 3 - 1) by 4, hence it cannot be expressed as the sum of two squares. He also stated that a number of the form a² + b², where a is prime to b, cannot be divided by a prime of the form 4n - 1. (d) Every prime of the form 4n + 1 is expressible, and that in one way only, as the sum of two squares. This problem was first solved by Euler, who shewed that a number of the form 2^m (4n + 1) can be always expressed as the sum of two squares. (e) If a, b, c, be integers, such that a² + b² = c², then ab cannot be a square. Lagrange gave a solution of this. (f) The determination of a number x such that x²n + 1 may be a square, where n is a given integer which is not a square. Lagrange gave a solution of this. (g) There is only one integral solution of the equation x² + 2 = y³; and there are only two integral solutions of the equation x² + 4 = y³. The required solutions are evidently for the first equation x = 5, and for the second equation x = 2 and x = 11. This question was issued as a challenge to the English mathematicians Wallis and Digby. (h) No integral values of x, y, z can be found to satisfy the equation x^n + y^n = z^n ; if n be an integer greater than 2. This proposition has acquired extraordinary celebrity from the fact that no general demonstration of it has been given, but there is no reason to doubt that it is true. Probably Fermat discovered its truth first for the case n = 3, and then for the case n = 4. His proof for the former of these cases is lost, but that for the latter is extant, and a similar proof for the case of n = 3 was given by Euler. These proofs depend on shewing that, if three integral values of x, y, z can be found which satisfy the equation, then it will be possible to find three other and smaller integers which also satisfy it: in this way, finally, we shew that the equation must be satisfied by three values which obviously do not satisfy it. Thus no integral solution is possible. It would seem that this method is inapplicable to any cases except those of n = 3 and n = 4. Fermat's discovery of the general theorem was made later. A proof can be given on the assumption that a number can be resolved into the product of powers of primes in one and only one way. The assumption has been made by some writers; it is true of real numbers, but it is not necessarily true of every complex number. It is possible that Fermat made some erroneous supposition, but, on the whole, it seems more likely that he discovered a rigorous demonstration. In 1823 Legendre obtained a proof for the case of n = 5; in 1832 Lejeune Dirichlet gave one for n = 14, and in 1840 Lamé and Lebesgue gave proofs for n = 7. The proposition appears to be true universally, and in 1849 Kummer, by means of ideal primes, proved it to be so for all numbers except those (if any) which satisfy three conditions. It is not certain whether any number can be found to satisfy these conditions, but there is no number less than 100 which does so. The proof is complicated and difficult, and there can be no doubt is based on considerations unknown to Fermat. I may add that, to prove the truth of the proposition, when n is greater than 4 obviously it is sufficient to confine ourselves to cases when n is a prime, and the first step in Kummer's demonstration is to shew that one of the numbers x, y, z must be divisible by n. The following extracts, from a letter now in the university library at Leyden, will give an idea of Fermat's methods; the letter is undated, but it would appear that, at the time Fermat wrote it, he had proved the proposition (h) above only for the case when n = 3. Je ne m'en servis au commencement qe pour demontrer les propositions negatives, comme par exemple, qu'il n'y a aucu nombre moindre de l'unité qu'un multiple de 3 qui soit composé d'un quarré et du triple d'un autre quarré. Qu'il n'y a aucun triangle rectangle de nombres dont l'aire soit un nombre quarré. La preuve se fait par apagogeen en cette manière. S'il y auoit aucun triangle rectangle en nombres entiers, qui eust son aire esgale à un quarré, il y auroit un autre triangle moindre que celuy la qui auroit la mesme proprieté. S'il y en auoit un second moindre que le premier qui eust la mesme proprieté il y en auroit par un pareil raisonnement un troisieme moindre que ce second qui auroit la mesme proprieté et enfin un quatrieme, un cinquieme etc. a l'infini en descendant. Or est il qu'estant donné un nombre il n'y en a point infinis en descendant moindres que celuy la, j'entens parler tousjours des nombres entiers. D'ou on conclud qu'il est donc impossible qu'il y ait aucun triangle rectange dont l'aire soit quarré. Vide foliu post sequens.... Je fus longtemps sans pouvour appliquer ma methode aux questions affirmatives, parce que le tour et le biais pour y venir est beaucoup plus malaisé que celuy dont je me sers aux negatives. De sorte que lors qu'il me falut demonstrer que tout nombre premier qui surpasse de l'unité un multiple de 4, est composé de deux quarrez je me treuvay en belle peine. Mais enfin une meditation diverses fois reiterée me donna les lumieres qui me manquoient. Et les questions affirmatives passerent par ma methods a l'ayde de quelques nouveaux principes qu'il y fallust joindre par necessité. Ce progres de mon raisonnement en ces questions affirmatives estoit tel. Si un nombre premier pris a discretion qui surpasse de l'unité un multiple de 4 n'est point composé de deux quarrez il y aura un nombre premier de mesme nature moindre que le donné; et ensuite un troisieme encore moindre, etc. en descendant a l'infini jusques a ce que vous arriviez au nombre 5, qui est le moindre de tous ceux de cette nature, lequel il s'en suivroit n'estre pas composé de deux quarrez, ce qu'il est pourtant d'ou on doit inferer par la deduction a l'impossible que tous ceux de cette nature sont par consequent composez de 2 quarrez. Il y a infinies questions de cette espece. Mais il y en a quelques autres que demandent de nouveaux principes pour y appliquer la descente, et la recherche en est quelques fois si mal aisée, qu'on n'y peut venir qu'avec une peine extreme. Telle est la question suivante que Bachet sur Diophante avoüe n'avoir jamais peu demonstrer, sur le suject de laquelle Mr. Descartes fait dans une de ses lettres la mesme declaration, jusques la qu'il confesse qu'il la juge si difficile, qu'il ne voit point de voye pour la resoudre. Tout nombre est quarré, ou composé de deux, de trois, ou de quatre quarrez. Je l'ay enfin rangée sous ma methode et je demonstre que si un nombre donné n'estoit point de cette nature il y en auroit un moindre que ne le seroit par non plus, puis un troisieme moindre que le second etc. a l'infini, d'ou l'on infere que tous les nombres sont de cette nature.... J'ay ensuit consideré questions que bien que negatives ne restent pas de recevoir tres-grande difficulté, la methods pour y pratiquer la descente estant tout a fait diverse des precedentes comme il sera aisé d'espouver. Telles sont les suivantes. Il n'y a aucun cube divisible en deux cubes. Il n'y a qu'un seul quarré en entiers que augmenté du binaire fasse un cube, ledit quarré est 25. Il n'y a que deux quarrez en entiers lesquels augmentés de 4 fassent cube, lesdits quarrez sont 4 et 121.... Apres avoir couru toutes ces questions la plupart de diverses (sic) nature et de differente façon de demonstrer, j'ay passé a l'invention des regles generales pour resoudre les equations simples et doubles de Diophante. On propose par exemple 2 quarr. + 7957 esgaux a un quarré (hoc est 2xx + 7967 \propto quadr.) J'ay une regle generale pour resoudre cette equation si elle est possible, on decouvrir son impossibilité. Et ainsi en tous les cas et en tous nombres tant des quarrez que des unitez. On propose cette equation double 2x + 3 et 3x + 5 esgaux chaucon a un quarré. Bachet se glorifie en ses commentaires sur Diophante d'avoir trouvé une regle en deux cas particuliers. Je me donne generale en toute sorte de cas. Et determine par regle si elle est possible ou non.... Voila sommairement le conte de mes recherches sur le sujet des nombres. Je ne l'ay escrit que parce que j'apprehende que le loisir d'estendre et de mettre au long toutes ces demonstrations et ces methodes me manquera. En tout cas cette indication seruira aux sçauants pour trouver d'eux mesmes ce que je n'estens point, principlement si Mr. de Carcaui et Frenicle leur font part de quelques demonstrations par la descente que je leur ay envoyees sur le suject de quelques propositions negatives. Et peut estre la posterité me scaure gré de luy avoir fait connoistre que les anciens n'ont pas tout sceu, et cette relation pourra passer dans l'esprit de ceux qui viendront apres moy pour traditio lampadis ad filios, comme parle le grand Chancelier d'Angleterre, suivant le sentiment et la devise duquel j'adjousteray, multi pertransibunt et augebitur scientia. (ii) I next proceed to mention Fermat's use in geometry of analysis and of infinitesimals. It would seem from his correspondence that he had thought out the principles of analytical geometry for himself before reading Descartes's Géométrie, and had realised that from the equation, or, as he calls it, the ``specific property,'' of a curve all its properties could be deduced. His extant papers on geometry deal, however, mainly with the application of infinitesimals to the determination of the tangents to curves, to the quadrature of curves, and to questions of maxima and minima; probably these papers are a revision of his original manuscripts (which he destroyed), and were written about 1663, but there is no doubt that he was in possession of the general idea of his method for finding maxima and minima as early as 1628 or 1629. He obtained the subtangent to the ellipse, cycloid, cissoid, conchoid, and quadratrix by making the ordinates of the curve and a straight line the same for two points whose abscissae were x and x - e; but there is nothing to indicate that he was aware that the process was general, it is probable that he never separated it, so to speak, from the symbols of the particular problem he was considering. The first definite statement of the method was due to Barrow, and was published in 1669. Fermat also obtained the areas of parabolas and hyperbolas of any order, and determined the centres of mass of a few simple laminae and of a paraboloid of revolution. As an example of his method of solving these questions I will quote his solution of the problem to find the area between the parabola y³ = p x², the axis of x, and the line x = a. He says that, if the several ordinates of the points for which x is equal to a, a(1 - e), a(1 - e)²,... be drawn, then the area will be split into a number of little rectangles whose areas are respectively ae(pa^2)^(1/3), ae(1-e) ( pa^2(1-e)^2 )^(1/3),... . The sum of these is p^(1/3) a^(5/3) e / ( 1 - (1 - e)^(5/3) ) ; and by a subsidiary proposition (for he was not acquainted with the binomial theorem) he finds the limit of this, when e vanishes, to be (3/5) p^(1/3) a^(5/3) . The theorems last mentioned were published only after his death; and probably they were not written till after he had read the works of Cavalieri and Wallis. Kepler had remarked that the values of a function immediately adjacent to and on either side of a maximum (or minimum) value must be equal. Fermat applied this principle to a few examples. Thus, to find the maximum value of x(a - x), his method is essentially equivalent to taking a consecutive value of x, namely x - e where e is very small, and putting x(a - x) = (x - e)(a - x + e). Simplifying, and ultimately putting e = 0, we get x = œ. This value of x makes the given expression a maximum. (iii) Fermat must share with Pascal the honour of having founded the theory of probabilities. I have already mentioned the problem proposed to Pascal, and which he communicated to Fermat, and have there given Pascal's solution. Fermat's solution depends on the theory of combinations, and will be sufficiently illustrated by the following example, the substance of which is taken from a letter dated August 24, 1654, which occurs in the correspondence with Pascal. Fermat discusses the case of two players, A and B, where A wants two points to win and B three points. Then the game will be certainly decided in the course of four trials. Take the letters a and b, and write down all the combinations that can be formed of four letters. These combinations are 16 in number, namely, aaaa, aaab, aaba, aabb; abaa, abab, abba, abbb; baaa, baab, baba, babb; bbaa, bbab, bbba, bbbb. Now every combination in which a occurs twice or oftener represents a case favourable to A, and every combination in which b occurs three times or oftener represents a case favourable to B. Thus, on counting them, it will be found that there are 11 cases favourable to A, and 5 cases favourable to B; and since these cases are all equally likely, A's chance of winning the game is to B's chance as 11 is to 5. The only other problem on this subject which, as far as I know, attracted the attention of Fermat was also proposed to him by Pascal, and was as follows. A person undertakes to throw a six with a die in eight throws; supposing him to have made three throws without success, what portion of the stake should he be allowed to take on condition of giving up his fourth throw? Fermat's reasoning is as follows. The chance of success is 1/6, so that he should be allowed to take 1/6 of the stake on condition of giving up his throw. But if we wish to estimate the value of the fourth throw before any throw is made, then the first throw is worth 1/6 of the stake; the second is worth 1/6 of what remains, that is 5/36 of the stake; the third throw is worth 1/6 of what now remains, that is, 25/216 of the stake; the fourth throw is worth 1/6 of what now remains, that is, 125/1296 of the stake. Fermat does not seem to have carried the matter much further, but his correspondence with Pascal shows that his views on the fundamental principles of the subject were accurate: those of Pascal were not altogether correct. Fermat's reputation is quite unique in the history of science. The problems on numbers which he had proposed long defied all efforts to solve them, and many of them yielded only to the skill of Euler. One still remains unsolved. This extraordinary achievement has overshadowed his other work, but in fact it is all of the highest order of excellence, and we can only regret that he thought fit to write so little. _________________________________________________________________ This page is included in a collection of mathematical biographies taken from A Short Account of the History of Mathematics by W. W. Rouse Ball (4th Edition, 1908). Transcribed by D.R. Wilkins (dwilkins(a)maths.tcd.ie) School of Mathematics Trinity College, Dublin

1 0