Cryptography-Digest Digest #672, Volume #13 Sat, 10 Feb 01 22:13:00 EST
Contents:
Re: The Kingdom of God (wtshaw)
Re: The Kingdom of God needs Comsec and HA Public Key Management (wtshaw)
Re: Mono cipher, genetic algorithm .. appropriate "Crossover?" ("John A. Malley")
Re: I encourage people to boycott and ban all Russian goods and services, if the
Russian Federation is banning Jehovah's Witnesses ....... (John M Price PhD)
Re: ideas of D.Chaum about digital cash and whether tax offices are (Darren New)
Anonymous communications (Splaat23)
Re: RSA is not secure in many instances... ([EMAIL PROTECTED])
Re: Mono ciphers and genetics .. a bacterial twist! ("Robert Reynard")
Re: RSA is not secure in many instances... ([EMAIL PROTECTED])
Re: I encourage people to boycott and ban all Russian goods and services, if the
Russian Federation is banning Jehovah's Witnesses ....... (John Savard)
Re: Purenoise defeats Man In The Middle attack? (John Savard)
Re: Cryptologia back-issues .. a wishful idea for the publishers (JPeschel)
Re: I encourage people to boycott and ban all Russian goods ([ Dr. Jeff ])
Frauen =?iso-8859-1?Q?f=FCr?= Dich (Wolfgang Cronrath)
----------------------------------------------------------------------------
From: [EMAIL PROTECTED] (wtshaw)
Crossposted-To: alt.security,comp.security,alt.2600
Subject: Re: The Kingdom of God
Date: Sat, 10 Feb 2001 15:42:00 -0600
In article <96484j$j3s$[EMAIL PROTECTED]>, Tom St Denis
<[EMAIL PROTECTED]> wrote:
> In article <D%eh6.259071$[EMAIL PROTECTED]>,
> "drumstik" <[EMAIL PROTECTED]> wrote:
> > Smile! There is no god.
>
> And if there was would it matter anyways?
>
> Tom
>
Well, he could not be a Republican, would seem to like a variable length
block cipher in base 4, and makes psudorandom faulty copies of keys.
--
Better to pardon hundreds of guilty people than execute one
that is innocent.
------------------------------
From: [EMAIL PROTECTED] (wtshaw)
Crossposted-To: alt.security,comp.security,alt.2600
Subject: Re: The Kingdom of God needs Comsec and HA Public Key Management
Date: Sat, 10 Feb 2001 15:54:13 -0600
In article <[EMAIL PROTECTED]>, Crypto Key Management
Associates <[EMAIL PROTECTED]> wrote:
> How about
> Watchtower, we can make it so secure no one can read it. Any takers?
>
The bigger question is whether it hides any meaning in what is already
readible...must be stegnograhy. But, anyway, their home delivery program
assures you that you receive it when you least want it, like spam.
--
Better to pardon hundreds of guilty people than execute one
that is innocent.
------------------------------
From: "John A. Malley" <[EMAIL PROTECTED]>
Subject: Re: Mono cipher, genetic algorithm .. appropriate "Crossover?"
Date: Sat, 10 Feb 2001 14:50:16 -0800
Here's an idea for cross-over of permutations (monoalphabetic
substitutions) - but I bet you already thought of it/tried it.
Please tell me how it worked if you already tried it. For any two
"chromosomes" to cross-over:
Let the first substitution key be permutation Pi_1( Alphabet )
corresponding to "chromosome 1."
Let the second substitution key be permutation Pi_2( Alphabet )
corresponding to "chromosome 2."
Hybridize Chromosome 1 and 2 to make a third substitution key
"chromosome 3" as follows:
permutation Pi_3 = Pi_1( Pi_2** -1 ( Pi_1( Alphabet ) ) ).
where Pi_n means permutation n to label the nth possible permutation,
and a Pi to the negative power means the inverse permutation of Pi_n.
So again in words ('cause ASCII lends itself not to clear formula
writing)
1. Take the substitution key of chromosome 1 and decrypt it with the
substitution key of chromosome 2.
2. Take the resulting "plaintext" from step 1 and encrypt it with the
substitution key of chromosome 1.
3. The result is a new substitution key chromosome 3.
The new substitution key looks like its parents but has some
differences, and those parental differences get "shuffled" around in the
resulting third key - so it also acts like mutation.
Where ever substitution key 1 and 2 map the plaintext Alphabet to the
same ciphertext characters, so does substitution key 3. Where ever
substitution key 1 and 2 map the plaintext Alphabet to different
ciphertext characters, substitution key 3 may have some of the same
substitutions as key 1 and key 2 or it may have different substitutions
for those plaintext characters.
So this cross-over algorithm fixes those portions of the substitution
keys in common between two parent keys. The more the two keys agree in
portions of the substitution, the more their offspring reflects that
same portion. This behavior simulates a dominant gene in the gene pool.
This algorithm also assumes that if a particular portion appears in most
of the population selected to "breed" then the portion must be
beneficial, since only those chromosomes closer to answering the cipher
question are making it to "breed."
Eventually genetic diversity is lost and only (or mostly only) the
substitution key that's correct remains in the "gene pool."
John A. Malley
[EMAIL PROTECTED]
------------------------------
From: John M Price PhD <[EMAIL PROTECTED]>
Subject: Re: I encourage people to boycott and ban all Russian goods and services,
if the Russian Federation is banning Jehovah's Witnesses .......
Crossposted-To: comp.security,alt.security,alt.2600
Reply-To: [EMAIL PROTECTED]
Date: 10 Feb 2001 15:20:45 -0800
In alt.2600 article <[EMAIL PROTECTED]> David Schwartz
<[EMAIL PROTECTED]> wrote:
: John M Price PhD wrote:
:> : Is the financial well-being of Watchtower really that important?
:
:> I think it is a freedom of superstition argument. People should be
:> allowed to believe whatever hoakum they desire, evidence or not.
: So would it be okay for cigarette companies to finance a superstition
: that smoking brings you closer to god? This is a purely commercial
: superstition that serves only to enrich its backer to the detriment of
: its backer's customers. I don't think you'd find the U.S. allowing that.
First, I said believe.
Second, there is indeed a 1st amend. argument against the advertising
restrictions on tobacco. The question is weight of effect.
Third, see the Rostifarians and the Native American Church.
--
John M. Price, PhD [EMAIL PROTECTED]
Life: Chemistry, but with feeling! | PGP Key on request or FTP!
Email responses to my Usenet articles will be posted at my discretion.
Comoderator: sci.psychology.psychotherapy.moderated Atheist# 683
One trend that bothers me is the glorification of stupidity, that the media
is reassuring people it's alright not to know anything. That to me is far
more dangerous than a little pornography on the Internet.
- Carl Sagan
------------------------------
From: Darren New <[EMAIL PROTECTED]>
Crossposted-To: talk.politics.crypto,alt.cypherpunks
Subject: Re: ideas of D.Chaum about digital cash and whether tax offices are
Date: Sat, 10 Feb 2001 23:23:20 GMT
Thomas J. Boschloo wrote:
> Problem is, that with anonymous publishing and anonymous 'donations' and
> anonymous virtual vaults it cannot be stopped.
Then you don't need the gambling aspect at all. Simply put up a secure site
saying "Donations to kill Lord Henry: $35,000 Click here to donate --> O
Anyway, kiddie porn is illegal in the USA even if no kiddies are ever
involved in it, so it's clearly not to protect the children, but to give
people someone to hate.
--
Darren New / Senior MTS & Free Radical / Invisible Worlds Inc.
San Diego, CA, USA (PST). Cryptokeys on demand.
Ignorance can be cured. Naivety cures itself.
------------------------------
From: Splaat23 <[EMAIL PROTECTED]>
Subject: Anonymous communications
Date: Sat, 10 Feb 2001 23:24:08 GMT
This is a hard question to phrase, so I'll set it up as a fill-in-the-
blank: "In order to have real-time, secure, anonymous communications
with another person on the Internet, I will do _______, relying only on
______"
I've been thinking about this, and it is very apropos of the situations
today involving privacy, copyright, and growing use/theory on attacks
such as traffic analysis. A solution to this that relies on the least
might be an important evolution (as opposed to revolution) in Internet
communication.
- Andrew
Sent via Deja.com
http://www.deja.com/
------------------------------
From: [EMAIL PROTECTED]
Subject: Re: RSA is not secure in many instances...
Date: Sat, 10 Feb 2001 23:58:23 GMT
Now I remember...
> Even if m happens to have a large cycle, that doesn't mean the
> cyphertext c has a large cycle.
Forget this part. If m has small order, then c has small order.
> (From what I remember roughly, there's a theorem that guarantees there
> is 1 generator. But there's no guarantee how many generators there
are.)
The theorem is like this:
Let U(N) be the number of elements relatively prime to N.
# of elements with order T=(p-1)(q-1) is only 1.
For each divisor d of T, # of elemnts with order d is U(T/d)
The sum of all U(T/d) is T.
RSA only requires one large prime factor pk:
Suppose T = 2^2 * 5^3 * ... * pk.
Then # of elements with order 2 is U(T/2), which is big
# of elements with order 4 is U(T/4), which is big
# of elemtents with order pk is U(T/pk), which is small
See? There are far more elements with small order than elements with
large order.
So if Alice wants to send message m to Bob using Bob's public key, the
chance that m has small order is LARGE.
But Alice does not know that. She cannot determine whether m has small
or large order because she does not know Bob's secret factors p and q.
Doesn't that sound scary?
Sent via Deja.com
http://www.deja.com/
------------------------------
From: "Robert Reynard" <[EMAIL PROTECTED]>
Subject: Re: Mono ciphers and genetics .. a bacterial twist!
Date: Sat, 10 Feb 2001 20:06:16 -0500
"Sundial Services" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
<< My reasoning is thus:
The great determinant of a genetic algorithm is also the great unknown,
namely the crossover algorithm. >>
I would suggest that the great determinate of the genetic algorithm is the
test to determine 'fitness.'
The analysis I have been able to do indicates that the ability for an
algorithm (computer program) to successfully solve the monoalphabetic
keystring (KEY) has relatively little to do with the method of keystring
generation, be it genetic, simulated annealing, random, or whatever.
The critical aspect is the 'test for fitness.' It's the ability of the
program to recognize that a particular keystring is in fact 'better' than
previous keystrings.
<< The fitness of each rat before and after the transformation is
calculated. If the transformation improves the rat, the transformation is
kept and the bacteria scores one point. >>
Therein lies the rub. It is often difficult to determine the fitness of the
rat, however it has been transformed.
If you want to 'test' the validity of your genetic keystring generation, you
might try what I call the 'answer in the back of the book' test. This
requires the correct plaintext solution for a given ciphertext.
Use the correct plaintext (answer) to generate your frequency data (mono and
digraph occurrences). Then use this data to run the program. If the
keystring generator is working correctly (selecting a 'better' keystring
after each round of tests) then the program will be able to find a solution
in record time. For a good 'solver' it would take less than a second to
completely solve the ciphertext. For a genetic keystring generator it can
pass this test with a mutation rate as low as two swaps per round.
If the program can't find a solution in a reasonable amount of time (a few
minutes) then the keystring generator may in fact be 'broken.'
Robert Reynard
Author, Secret Code Breaker series of crypto books for young readers (8-16
yr.)
Secret Code Breaker Online at ==> http://codebreaker.dids.com
------------------------------
From: [EMAIL PROTECTED]
Subject: Re: RSA is not secure in many instances...
Date: Sun, 11 Feb 2001 01:09:32 GMT
In article <964kit$t1i$[EMAIL PROTECTED]>,
[EMAIL PROTECTED] wrote:
> ...
> Then # of elements with order 2 is U(T/2), which is big
> # of elements with order 4 is U(T/4), which is big
> # of elemtents with order pk is U(T/pk), which is small
You are mistaken (and I hope I get it right myself this time ;-)).
Suppose that g is a generator of Zpq* (i.e. the group of all positive
integers less than pq, except integer multiples of p and integer
multiples of q). Then, for each 0 < k < (p-1)(q-1), there is exactly
one integer 0 < m < pq such that g^k = m mod pq. Suppose that m is an
element with order 2, i.e. m^2 = 1 mod pq. Then, if g^k = m mod pq, it
must be the case that k = (p-1)(q-1)/2. Hence, there can be only one
integer m. Likewise, if m is an element with order 3, you have k = (p-1)
(q-1)/3 or k = 2(p-1)(q-1)/3, etc. Furthermore, there are phi(phi(pq))-
1 generators of Zpq*, i.e. the numbers of positive integers greater
than one and less than pq relatively prime to both pq and (p-1)(q-1).
This includes a large number of primes, so the amount is clearly larger
than one.
Sent via Deja.com
http://www.deja.com/
------------------------------
From: [EMAIL PROTECTED] (John Savard)
Crossposted-To: comp.security,alt.security,alt.2600
Subject: Re: I encourage people to boycott and ban all Russian goods and services, if
the Russian Federation is banning Jehovah's Witnesses .......
Date: Sun, 11 Feb 2001 01:10:58 GMT
On Sat, 10 Feb 2001 18:11:45 GMT, Markku J. Saarelainen
<[EMAIL PROTECTED]> wrote, in part:
>I encourage all people around the world to boycott and ban all Russian
>goods and services, if the Russian Federation is banning Jehovah's
>Witnesses .......
And we can also add:
- the attacks on Chechnya comitted with disregard for civilian life
- the unwillingness of Russia to waive diplomatic immunity in the case
of a drunk driver who killed a Canadian woman
John Savard
http://home.ecn.ab.ca/~jsavard/crypto.htm
------------------------------
From: [EMAIL PROTECTED] (John Savard)
Subject: Re: Purenoise defeats Man In The Middle attack?
Date: Sun, 11 Feb 2001 01:12:26 GMT
On Sat, 10 Feb 2001 13:26:28 -0500, Rich W. <[EMAIL PROTECTED]>
wrote, in part:
> "Patent Pending secure key exchange protocol that defeats the 'Man In
>The Middle Attack.'"
That's entirely possible, if the two parties have a secret shared in
advance. Although, from the sound of it, I don't feel encouraged about
the site you are quoting from.
John Savard
http://home.ecn.ab.ca/~jsavard/crypto.htm
------------------------------
From: [EMAIL PROTECTED] (JPeschel)
Date: 11 Feb 2001 02:04:07 GMT
Subject: Re: Cryptologia back-issues .. a wishful idea for the publishers
Sundial Services [EMAIL PROTECTED] writes:
>You know, when I see references to materials in issues long since dead,
>I sorely wish that journals such as Cryptologia would RE-PUBLISH their
>old material on a SUBSCRIPTION web-site.
>
>In other words, you can see an abstract of the papers on file. If you
>want to read the full thing, you enroll in the site using a
>credit-card. You can then purchase the full text of the article you
>want, in (say) PDF or PS form, and download it to your computer.
>Authors would receive royalties as usual.
>
>I'd cheerfully pay a reasonable fee for this and it would unlock the
>vast resource of knowledge that was thus-far produced only in print
>form. Those words are still desirable ... still valuable.
>
Many of the back issues of <i>Cryptologia</i> are available.
See: http://www.dean.usma.edu/math/resource/pubs/cryptolo/index.htm.
I do wish, however, that <i>Cryptologia</i> would include
an author listing, and, as you suggest, a brief abstract of the
paper. The journal's back-issue sales would certainly increase.
Having a fee-based site to view old papers isn't a bad idea, though
I'm sure that many journals would not take the time to and absorb
the cost of putting print-media papers in a HTML, PDF, or PS format.
Unfortunately, authors of magazine and journal articles don't get
roylaties, but I wish they did.
In most cases, old journal articles can be reprinted on the
web by the author. All that the author usually needs to do is
contact the journal or magazine and ask for permission to reprint
the paper on the web.
You'll find <i>Cryptologia</i> articles, for instance, by Hamer,
Gillogy, and others already on the web. I am hosting a few of Jim's
papers on my site; he asked and received permission from the editors
to reprint them on the web. The journal asked only for a link
to its web site in return.
If anyone here is interested having me scan, and host on the web
their published print-media cryptanalysis articles, you can
contact me by e-mail. My fee is reasonable in that I ask only
that you pay for the postage of sending the copy, and that I
have the exclusive privelge of hosting it.
Are you working on any new stuff, Jim?
Joe
__________________________________________
Joe Peschel
D.O.E. SysWorks
http://members.aol.com/jpeschel/index.htm
__________________________________________
------------------------------
From: [EMAIL PROTECTED] ([ Dr. Jeff ])
Crossposted-To: comp.security,alt.security,alt.2600
Subject: Re: I encourage people to boycott and ban all Russian goods
Date: 10 Feb 2001 20:14:35 -0600
In article <96408r$csb$[EMAIL PROTECTED]>,
Markku J. Saarelainen <[EMAIL PROTECTED]> wrote:
>
>I encourage all people around the world to boycott and ban
Which would you prefer? Boycotting isn't as controlled as
banning you know...
>goods and services, if the Russian Federation is banning Jehovah's
>Witnesses .......
I ban JW's from my place. If they do happen to come here, I make
them take a brush and scrub the places where they came. :-)
--
>From the dawn of time Doc came; moving silently down through the centuries,
living many secret lives, struggling to reach the time of the Gathering;
when he would win the battle to claim Nitallica's heart. No one has ever
known he was among you... until now. Blast those blueberry squishies! ;)
------------------------------
From: Wolfgang Cronrath <[EMAIL PROTECTED]>
Subject: Frauen =?iso-8859-1?Q?f=FCr?= Dich
Date: Sun, 11 Feb 2001 11:09:48 +0800
Reply-To: [EMAIL PROTECTED]
Viele h=FCbsche Vietnamesinnen:
http://www.vietnamesebusiness.com/bluedragon/ und dann "Age Groups".
http://www.exoticmatchmaker.com/
http://www.asiaworld2000.com/
Thais:
http://www.thailadies.com/
Und andere:
http://altmatch.com/
http://www.one-and-only.com/
Und zum Spa=DF schau Dir an:
www.darmgas.de
www.amihotornot (braucht Javascript)
Was ganz anderes: Wie man f=FCr Farbenblinde gestaltet. =
http://www.cimmerii.demon.co.uk/colourblind/design.html
http://www.labs.bt.com/people/rigdence/colours/index.html
-- =
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
From a complaint of an employee against bullying: "Co-workers
refuse to support me with essential information ..."
Answer from an accused co-worker: "... but we have a database that
is available for everybody for important stuff."
(personal communication with the involved people)
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
------------------------------
** FOR YOUR REFERENCE **
The service address, to which questions about the list itself and requests
to be added to or deleted from it should be directed, is:
Internet: [EMAIL PROTECTED]
You can send mail to the entire list by posting to sci.crypt.
End of Cryptography-Digest Digest
******************************
