Cryptography-Digest Digest #440, Volume #11 Wed, 29 Mar 00 01:13:01 EST
Contents:
prime number solution ([EMAIL PROTECTED])
prime number solution ([EMAIL PROTECTED])
prime number solution ([EMAIL PROTECTED])
Re: DES question (David Hopwood)
prime solution ([EMAIL PROTECTED])
Re: prime solution (Rob Johnson)
Re: Schoof's Algorithm (DJohn37050)
Re: prime solution (DJohn37050)
Re: prime solution ("Dann Corbit")
Re: Is it really NSA ?! ([EMAIL PROTECTED])
Re: prime solution (David G Radcliffe)
number 32 in a series (wtshaw)
Re: ecc equation (David A Molnar)
RESULT: sci.crypt.random-numbers passes 134:12 (Dave Cornejo)
----------------------------------------------------------------------------
From: [EMAIL PROTECTED]
Subject: prime number solution
Date: Wed, 29 Mar 2000 03:06:16 GMT
I offer the following solution to prime numbers.
This solution, as trivial as it is, has been
hidden from us until now. I hope people
appreciate what it takes to keep this hidden for
so long.
A(n)=6*n-1
B(n)=6*n+1
for all n=1,2,3...
A and B define the "possible prime space." Let's
go through some examples.
5 7
11 13
17 19
23 (25) (25=5*5)
29 31
(35) 37 (35=5*7)
41 43
47 (49) (49=7*7)
etc.
So everything is prime unless it is the
combination of two other things in this set.
Another interesting thing:
A()*A()=B()
B()*B()=B()
A()*B()=A()
So any p^2-1 is divisible by 6.
I won't give away the ending just yet, but you can
use this to find large primes or the prime factors
of huge numbers with relative ease. Can you see
the solution?
This is like the "special theory of primality"
There is also a to-be-revealed "general theory of
primality" which describes how 1,2, and 3 create
our entire number system (1 _is_ prime). Read Tao
Te Ching ch. 42 and Isiah 42 for more hints.
Baruch Hashem,
Joseph Ben-Adam Ben-Emet
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED]
Subject: prime number solution
Date: Wed, 29 Mar 2000 03:06:20 GMT
I offer the following solution to prime numbers.
This solution, as trivial as it is, has been
hidden from us until now. I hope people
appreciate what it takes to keep this hidden for
so long.
A(n)=6*n-1
B(n)=6*n+1
for all n=1,2,3...
A and B define the "possible prime space." Let's
go through some examples.
5 7
11 13
17 19
23 (25) (25=5*5)
29 31
(35) 37 (35=5*7)
41 43
47 (49) (49=7*7)
etc.
So everything is prime unless it is the
combination of two other things in this set.
Another interesting thing:
A()*A()=B()
B()*B()=B()
A()*B()=A()
So any p^2-1 is divisible by 6.
I won't give away the ending just yet, but you can
use this to find large primes or the prime factors
of huge numbers with relative ease. Can you see
the solution?
This is like the "special theory of primality"
There is also a to-be-revealed "general theory of
primality" which describes how 1,2, and 3 create
our entire number system (1 _is_ prime). Read Tao
Te Ching ch. 42 and Isiah 42 for more hints.
Baruch Hashem,
Joseph Ben-Adam Ben-Emet
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED]
Subject: prime number solution
Date: Wed, 29 Mar 2000 03:06:17 GMT
I offer the following solution to prime numbers.
This solution, as trivial as it is, has been
hidden from us until now. I hope people
appreciate what it takes to keep this hidden for
so long.
A(n)=6*n-1
B(n)=6*n+1
for all n=1,2,3...
A and B define the "possible prime space." Let's
go through some examples.
5 7
11 13
17 19
23 (25) (25=5*5)
29 31
(35) 37 (35=5*7)
41 43
47 (49) (49=7*7)
etc.
So everything is prime unless it is the
combination of two other things in this set.
Another interesting thing:
A()*A()=B()
B()*B()=B()
A()*B()=A()
So any p^2-1 is divisible by 6.
I won't give away the ending just yet, but you can
use this to find large primes or the prime factors
of huge numbers with relative ease. Can you see
the solution?
This is like the "special theory of primality"
There is also a to-be-revealed "general theory of
primality" which describes how 1,2, and 3 create
our entire number system (1 _is_ prime). Read Tao
Te Ching ch. 42 and Isiah 42 for more hints.
Baruch Hashem,
Joseph Ben-Adam Ben-Emet
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
Date: Tue, 28 Mar 2000 21:26:09 +0100
From: David Hopwood <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
Subject: Re: DES question
=====BEGIN PGP SIGNED MESSAGE=====
Scott Fluhrer wrote:
> David Hopwood <[EMAIL PROTECTED]> wrote in message
> news:[EMAIL PROTECTED]...
> > -----BEGIN PGP SIGNED MESSAGE-----
> >
> > Paul Rubin wrote:
> > > In article <[EMAIL PROTECTED]>, doc
> > > <[EMAIL PROTECTED]> wrote:
> > [...]
> > > >Perhaps a more general way of asking this question is to
> > > >inquire about the domain of the ciphertext.
> > > >
> > > >Or, is it possible to have a ciphertext that does NOT
> > > >decrypt using DES?
> > >
> > > That wouldn't make any sense. It would mean the encryption was not
> > > reversible.
> >
> > It is possible to have a reversible encryption algorithm with this
> > property, but it would have to be probabilistic, and the ciphertext
> > would have to be longer than the plaintext (a concrete example is
> > DHAES).
> Actually, there's no reason it would have to be probabilistic.
You're right, I stand corrected.
- --
David Hopwood <[EMAIL PROTECTED]>
PGP public key: http://www.users.zetnet.co.uk/hopwood/public.asc
RSA 2048-bit; fingerprint 71 8E A6 23 0E D3 4C E5 0F 69 8C D4 FA 66 15 01
=====BEGIN PGP SIGNATURE=====
Version: 2.6.3i
Charset: noconv
iQEVAwUBOOEjYDkCAxeYt5gVAQE+Ygf+JHcBIDELI1L03wrMOI3tuCKQRVETFNMv
fHi4DQ2L1vjhoRJXUPuZA/dC+chPvrrgJt5xkIcgllYOfWhjVYp+C5R1jR33uvJL
UMy/nQTqU9fis3CKaW933vJfEGIOggk/nvDFoJIfv1/nwjjR8vSGLcdEi+ziHsI7
+Vy/p2HpVhGANQkeaosB8b07Ga2O+QXhZMKexSVIQkyOjIEbIwZn4OF+KXlp2Mff
M7g68DTLrMR5LOD5YJh/loY+PpMqCo22uPVyUlJA/8QG4N6fUeySQWGUG+WlWOKr
HXPmc6FWi4MDKH3BOrD9cM+AWK6HiQK36YlzjwLJ320MC3rLsGM8Zw==
=V7NP
=====END PGP SIGNATURE=====
------------------------------
From: [EMAIL PROTECTED]
Crossposted-To: sci.math
Subject: prime solution
Date: Tue, 28 Mar 2000 20:47:42 -0700
I offer the following solution to prime numbers.
This solution, as trivial as it is, has been
hidden from us until now. I hope people
appreciate what it takes to keep this hidden for
so long.
A(n)=6*n-1
B(n)=6*n+1
for all n=1,2,3...
A and B define the "possible prime space." Let's
go through some examples.
A B
5 7
11 13
17 19
23 (25) (25=5*5)
29 31
(35) 37 (35=5*7)
41 43
47 (49) (49=7*7)
etc.
So everything is prime unless it is the
combination of two other things in this set.
Another interesting thing:
A()*A()=B()
B()*B()=B()
A()*B()=A()
So any p^2-1 is divisible by 6.
I won't give away the ending just yet, but you can
use this to find large primes or the prime factors
of huge numbers with relative ease. Can you see
the solution?
This is like the "special theory of primality"
There is also a to-be-revealed "general theory of
primality" which describes how 1,2, and 3 create
our entire number system (1 _is_ prime). Read Tao
Te Ching ch. 42 and Isiah 42 for more hints.
Baruch Hashem,
Joseph Ben-Adam Ben-Emet
------------------------------
From: [EMAIL PROTECTED] (Rob Johnson)
Crossposted-To: sci.math
Subject: Re: prime solution
Date: 29 Mar 2000 03:50:53 GMT
Reply-To: [EMAIL PROTECTED] (Rob Johnson)
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] wrote:
>I offer the following solution to prime numbers.
>This solution, as trivial as it is, has been
>hidden from us until now. I hope people
>appreciate what it takes to keep this hidden for
>so long.
>
>A(n)=6*n-1
>B(n)=6*n+1
>for all n=1,2,3...
>
>A and B define the "possible prime space." Let's
>go through some examples.
[snip]
This is fairly basic number theory. If p is a prime other than 2 or 3,
then p must be relatively prime to 6. There are only two equivalence
classes modulo 6 that are relatively prime to 6, +1 and -1. So any
prime number other than 2 or 3 is going to be of the form 6n+1 or 6n-1.
>So any p^2-1 is divisible by 6.
This fails for p = 2 and p = 3. Otherwise, p is +1 or -1 mod 6, so
p^2 is going to be 1 mod 6, and p^2-1 is going to be 0 mod 6, which
means that 6 divides p^2-1.
Rob Johnson
[EMAIL PROTECTED]
------------------------------
From: [EMAIL PROTECTED] (DJohn37050)
Subject: Re: Schoof's Algorithm
Date: 29 Mar 2000 03:55:30 GMT
This is impressive and I am impressed.
Don Johnson
------------------------------
From: [EMAIL PROTECTED] (DJohn37050)
Subject: Re: prime solution
Date: 29 Mar 2000 03:56:40 GMT
All primes bigger than 3 cannot have 2 or 3 as factors?
Don Johnson
------------------------------
From: "Dann Corbit" <[EMAIL PROTECTED]>
Crossposted-To: sci.math
Subject: Re: prime solution
Date: Tue, 28 Mar 2000 20:01:10 -0800
Why stop with 3 & 2? Go on with factors 5, 7, 11 and at least you'll get
decent compression for your sieve.
By the way, your formula is completely useless for factoring large primes.
--
C-FAQ: http://www.eskimo.com/~scs/C-faq/top.html
"The C-FAQ Book" ISBN 0-201-84519-9
C.A.P. Newsgroup http://www.dejanews.com/~c_a_p
C.A.P. FAQ: ftp://38.168.214.175/pub/Chess%20Analysis%20Project%20FAQ.htm
------------------------------
From: [EMAIL PROTECTED]
Subject: Re: Is it really NSA ?!
Date: Wed, 29 Mar 2000 03:58:10 GMT
In article <
aha2es86dduequv9kmmrarhvc2m87b5rsk@4ax.
com>,
[EMAIL PROTECTED] wrote:
> Unless NSA is using C&W as a "cut-out" I suspect that this is
> someone's (pretty good) idea of humor.
>
Earlier I saw that some Brits (including
hackers) are annoyed with C & W. Reminded of
this, I suggest to Disastry that you might
consider asking the hacker community if they
have heard of "Spookweb" (some of them who
have hacked government systems may have
seen this term). I myself have fantasized
about hacking the NSA but wouldn't actually
attempt it because it's too risky- I don't want
to end up " a breaking rocks in the hot sun
because I fought the law and the law won" *or
worse*- I'm an adult male and adult prison
ain't my bag, baby. Besides, Big Brother (or his
underlings) can view what I'm doing from this
pc.
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: David G Radcliffe <[EMAIL PROTECTED]>
Crossposted-To: sci.math
Subject: Re: prime solution
Date: 29 Mar 2000 04:16:55 GMT
In sci.math [EMAIL PROTECTED] wrote:
: Another interesting thing:
: A()*A()=B()
: B()*B()=B()
: A()*B()=A()
: So any p^2-1 is divisible by 6.
Surely you can do better than that. If p is a prime number
greater than 3, then p^2-1 is divisible by 24.
: I won't give away the ending just yet, but you can
: use this to find large primes or the prime factors
: of huge numbers with relative ease. Can you see
: the solution?
No, I cannot. Would you care to demonstrate your method by factoring
23191853949132775016046280012050082371924489779 ?
--
David Radcliffe [EMAIL PROTECTED]
------------------------------
From: [EMAIL PROTECTED] (wtshaw)
Subject: number 32 in a series
Date: Tue, 28 Mar 2000 21:32:29 -0600
My recent algorithm, Pinsk, converted base 26 to base 52, even converted
output to card values...a la 52 pickup.
The current addition is Maas, which converts base 51 to 52. Keys and much
of the math are inherited from Pinsk. Even the 26 letter substitution key
is the same, so with Maas, you don't get really mas, but less than you
expect, since it would be possible to have the alphabet-26 key screwed up
and still get all the formatting right. You might think of this as
similiar to substituting letters, but still relying on other unchanged
ascii values, or absence of them, which can give a cracker lots of help.
To get a 51-character plaintext set, work with 46 of the 47 usual keyboard
keys, use a separate character "|" to shift to upper or to lower case "\"
for them, which makes the subtotal 48. Use the other 3 for random space
characters, taken one at a time for a space, two for a carriage return,
and three for a blank line.
For ciphertext, the 52-characters, a to z, A to Z, are a Pinsk, and the
card representing scheme is the same. The tightness of Maas is better than
that of Pinsk, which was marginal.
I hope it will be simple to go to the next algorithm, which is to be much
the same as Mass, more space options, and a pair of jokers in the output
set. Then, I see only one more that also uses a 54 card deck and base
translation, but it would be a shame to let all this nifty card handling
stuff end there, so I probably won't.
--
Given all other distractions, I'd rather be programming.
------------------------------
From: David A Molnar <[EMAIL PROTECTED]>
Subject: Re: ecc equation
Date: 29 Mar 2000 04:30:22 GMT
Paul Rubin <[EMAIL PROTECTED]> wrote:
> I have this book and agree with Bob that it is great. However,
> it is quite advanced. I have a math degree (undergrad) and can't
> understand much of it. It is definitely a graduate level math text.
seconded. I have it as a reference (especially for lattice basis
reduction), but large parts of it are completely
inaccessible to me. This is changing a little bit this term, since
I'm auditing a course covering some algebraic number theory...
> Much more accessible is: A Course in Number Theory and Cryptography,
> by Neal Koblitz. I can understand most of that one.
I like this book a great deal. My only "complaint" is that it doesn't
cover such things as how to actually use the primitives it describes
in order to create a secure cryptosystem. no definitions of security,
no OAEP, that kind of thing. I wouldn't try to implement a real
cryptosystem using only this book (that's what HAC is for).
On the other hand, its introduction to factoring algorithms is
wonderful, and maybe worth the price alone.
Thanks,
-David
------------------------------
From: Dave Cornejo <[EMAIL PROTECTED]>
Crossposted-To: news.announce.newgroups,news.groups,sci.electronics.misc,sci.physics
Subject: RESULT: sci.crypt.random-numbers passes 134:12
Date: Wed, 29 Mar 2000 05:16:30 GMT
RESULT
unmoderated group sci.crypt.random-numbers passes 134:12
There were 134 YES votes and 12 NO votes, for a total of 146 valid
votes. There were 2 abstentions.
For a group to pass, YES votes must be at least 2/3 of all valid
(YES and NO) votes. There must also be at least 100 more YES votes
than NO votes.
A five day discussion period follows this announcement. If no
serious allegations of voting irregularities are raised, the
moderator of news.announce.newgroups will create the group shortly
thereafter.
Newsgroups line:
sci.crypt.random-numbers Generating cryptographic strength randomness.
Voting closed at 23:59:59 UTC, 28 Mar 2000.
This vote was conducted by a neutral third party. Questions
about the proposed group should be directed to the proponent.
Proponent: Scott Nelson <[EMAIL PROTECTED]>
Votetaker: Dave Cornejo <[EMAIL PROTECTED]>
RATIONALE: sci.crypt.random-numbers
Over the years, there's been a lot of traffic on this topic in
sci.crypt, and it makes sense to split it off into it's own
sub-group, both to relieve the pressure on sci.crypt,
and so more people who are interested in just the randomness
part and not the cryptography part of the topic can find it.
It was once believed that there would be support for a broader
version of this group, which could handle traffic for all aspects
of randomness, not just cryptographic strength randomness.
At this time however, there seems to be insufficient consensus on
where in the hierarchy such a group should go.
CHARTER: sci.crypt.random-numbers
Sci.crypt.random-numbers is for the discussion of cryptographic
strength random number generators, both "true" (hardware) and
"pseudo" (software), and anything else related to the science
of cryptographic strength randomness. Fit topics include but
are not limited to;
* New designs for and questions about hardware and software
random number generators.
* Questions about the nature of randomness and the definition of
randomness.
This is NOT a place to post lists of random-numbers.
END CHARTER.
sci.crypt.random-numbers Final Voter list
Voted YES
===============================================================================
lipo#bofh.at Roland E. Lipovits
Elisabeth.Oswald#iaik.at Elisabeth Oswald
matthew#astracon.com.au Matthew Henricksen
rstrand#ihug.com.au Robert Strand
toivo#ucs.uwa.edu.au Toivo Pedaste
aq697#chebucto.ns.ca George Thomas Weldon
trevort#vianet.on.ca Trevor Tymchuk
het#pangea.ca Harvey Taylor
macpherson-a#rmc.ca Alex MacPherson
CraigWyllie#sympatico.ca Craig Wyllie
daniel.b.belanger#ca.abb.com
thogard#abnormal.com Tim Hogard
dseal#arm.com David Seal
shalunov#att.com stanislav shalunov
hermit#BayView.COM William R. Ward
kimdv#best.com Kim DeVaughn
roses#cape.com Dolores Scaldini-Klimm
72027.3605#compuserve.com
edwards#crl.com Gregory Edwards
WmHBlair#dnai.com William H. Blair
jfn#enteract.com J.F. Nelson
julesd#erols.com Jules Dubois
mcclenon#erols.com Bob McClenon
biow#ezmort.com Christopher Biow
smlucas#famvid.com Steven Lucas
mattj#flashmail.com Matt
gregor#focusresearch.com Gregor N. Purdy
john.feth#honeywell.com Feth, John (AZ75)
nictamer#hotmail.com Nick Tamer
dietz#interaccess.com Paul F. Dietz
nlauerman#interaccess.com Nicholas Lauerman
carlson#ironbridgenetworks.com James Carlson
chris#kzim.com Christopher Robin Zimmerman
Leemon#Leemon.com Leemon Baird
Kurt.InAlbon#lonzagroup.com Kurt In Albon
ashwood#msn.com Joseph Ashwood
tina#starbase.neosoft.com Tina Marie
ime#netcom.com Randy Hudson
sleepy#os.com Alexander Pennace
dc#panix.com David W. Crawford
squid#panix.com Yeoh Yiu
buff#pobox.com William Denton
jepace#pobox.com James Pace
mra#pobox.com Mark Atwood
nartsegg#pobox.com Jonathan Roberts
ggr#qualcomm.com Gregory G Rose
mcoleman2#kc.rr.com Mike Coleman
derouet#montrouge.tt.slb.com Odile Derouet
pautot#montrouge.tt.slb.com Fabrice PAUTOT
jcoffin#taeus.com Jerry Coffin
Dennis.Keats#ti.com </FONT><FONT SIZE=2 FACE="Arial"> Dennis R. Keats</FONT>
davidsen#tmr.com Bill Davidsen
ed#twin-cities.com ed bertsch
thomas.zz-williams#ubs.com Thomas Williams
hustvedt#ma.ultranet.com Eric Hustvedt
xanthian#well.com Kent Paul Dolan
rascproponents#yahoo.com Brian P. Sweeney
Ekkehard.Uthke#gmx.de Ekkehard Uthke
nhoffm#in-kiel.de Norbert Hoffmann
list-votes#dream.kn-bremen.de Martin Schr"oder
mok-kong.shen#t-online.de Mok-Kong Shen
hsauer#marnie.teuto.de Henning Sauer
juettner#trustcenter.de Hans-Ulrich J�ttner
perle#cs.tu-berlin.de Frank Wilde
pom#imsd.uni-mainz.de Klaus Pommerening
lucks#weisskugel.informatik.uni-mannheim.de Stefan Lucks
bouvin#daimi.au.dk Niels Olof Bouvin
mors#daimi.au.dk mors#daimi.au.dk
kasper#bitnisse.dk Kasper Kjeld Pedersen
pink#diku.dk Christian Boesgaard
peteralf#mailme.dk Peter Alfredsen
rajwi#bu.edu Rajwinder Singh
mph#astro.caltech.edu Matthew Hunt
jac#mailer.scri.fsu.edu Jim Carr
willner#cfa.harvard.edu Steve Willner
dmolnar#fas.harvard.edu David Molnar
jeffreyh#hawaii.edu Jeffrey Herman
rra#stanford.edu Russ Allbery
jones#cs.uiowa.edu Douglas W. Jones
carrx019#tc.umn.edu p1p3r
bruno#cerberus.csd.uwm.edu
rufinus#mbe.ece.wisc.edu J Rufinus
rosing#physiology.wisc.edu Mike Rosing
christof#ece.wpi.edu Christof Paar
barranquero#laley.wke.es Juanma Barranquero
vesak#cutery.fi Vesa Karjalainen
kristian.liimatainen#helsinki.fi Lauri Liimatainen
ttw#lanl.gov Tony T. Warnock
jmyre#sandia.gov John W Myre
mau#beatles.cselt.it Maurizio Codogno
nospam.newton#gmx.li Philip Newton
4basil#worldnet.att.net basil sadler
dsmolen#bellatlantic.net Donald Smolen
ellis#ftel.net Rick Ellis
jmh#gmx.net Jan Haar
starhan#gmx.net Franz -STAR- Starhan
ltb#haruspex.net Len Blanks
cmcurtin#interhack.net Matt Curtin
tc#mcs.net Thomas Cuny
samstee#netnet.net Robert Steele
shrao#nyx.net Shrisha Rao
mmontcha#OregonVOS.net Matthew Montchalin
wakelyn#pinn.net N. T. Wakelyn
evert#royal.net Evert Meulie esq
fogazzid#softhome.net Daniele Fogazzi
theamk#softhome.net Mikhail A
gavan#spamcop.net Gavan Schneider
cind0revs#toadmail.toad.net Art Mongan
SteveMacGregor#USA.Net Steve MacGregor
Peter-Lawrence.Montgomery#cwi.nl Peter L. Montgomery
erik#flits102-126.flits.rug.nl Erik Warmelink
scarblac-rt#pino.selwerd.nl Remco Gerlich
agregorio#acm.org Alfonso De Gregorio
John_David_Galt#acm.org John David Galt
kb5cng#amsat.org R. L. Thompson
darkskyz#cyberspace.org Tomer Brisker
tom#dasoft.org Tom St Denis
zed#debian.org Zed Pobre
scott#helsbreth.org Scott Nelson <scott#helsbreth.org>
larry#smith-house.org Larry Smith
dave#technopagan.org David E. Smith
szymon#uci.agh.edu.pl Szymon Sokol
Michael.Salmon#uab.ericsson.se Michael Salmon
bo.doemstedt#mbox200.swipnet.se Bo D�mstedt
tim#bits.bris.ac.uk Tim Tyler
alex.dawson#uea.ac.uk Alex Dawson
jgd#cix.co.uk John Dallman
klockstone#cix.compulink.co.uk Keith Lockstone
wrd#glaurung.demon.co.uk Will Dickson
timpart#perdix.demon.co.uk Timothy Partridge
keith#quetz.demon.co.uk Keith Brazington
screech#krash.f9.co.uk Screech
james#sfgiants22.freeserve.co.uk James Farrar
Voted NO
===============================================================================
Norbert.Pfannerer#sail-labs.at Norbert Pfannerer
mskala#ansuz.sooke.bc.ca Matthew Skala
stainles#bga.com Dwight Brown
mwooding#ncipher.com Mark Wooding
jaygee#primenet.com Jim Geary
naddy#mips.rhein-neckar.de Christian Weisgerber
rick#bcm.tmc.edu Richard H. Miller
gwyn#arl.mil Douglas A. Gwyn (IST)
fwbrown#bellsouth.net Wayne Brown
hal#finney.org Hal Finney
h.nareid#nareid.demon.co.uk Helge Nareid
chriseb#ukshells.co.uk Chris Ebenezer
Abstained
===============================================================================
r.vanette#pink.nl Robert-Jan van Ette
merlin#netlink.co.uk Darren Wyn Rees
Invalid ballots
===============================================================================
No invalid votes
To restore the email addresses above, pipe the ack list through the
following command:
sed -e 's/#/@/g'
--
Voting question & problems: Dave Cornejo <[EMAIL PROTECTED]>
Voting address: [EMAIL PROTECTED]
------------------------------
** 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 (and sci.crypt) via:
Internet: [EMAIL PROTECTED]
End of Cryptography-Digest Digest
******************************
