Cryptography-Digest Digest #749, Volume #11 Wed, 10 May 00 16:13:01 EDT
Contents:
Re: Scary Possibility: Ticklish Chips (Ian Goldberg)
Re: Prime Generation in C,C++ or Java ([EMAIL PROTECTED])
Re: zeroknowledge.com and freedom.net - Snake oil? ("Dr. Yongge Wang")
Microsoft CryptoAPI: Crypt32.lib problem (Luis Sousa)
Re: More on Pi and randomness (Paul Koning)
Re: testing sbox system (Mike Rosing)
Re: *** New Record in Point Counting on Elliptic Curves *** (Mike Rosing)
RSA Cryptography Today FAQ (1/1) ([EMAIL PROTECTED])
Re: GPS encryption turned off (Doug Stell)
Re: TLAs (was: Re: Tempest Attacks with EMF Radiation) (John Myre)
Re: zeroknowledge.com and freedom.net - Snake oil? (David A. Wagner)
Re: Q: Searching for authentication protocols (Thomas Wu)
Re: *** New Record in Point Counting on Elliptic Curves *** (DJohn37050)
Re: More on Pi and randomness (Mok-Kong Shen)
Re: UK issue; How to determine if a file contains encrypted data? (Andy Dingley)
Re: UK issue; How to determine if a file contains encrypted data? (Andy Dingley)
Living in my car in Miami ... 5/10/2000 - cryptography and other matters ... read
all my messages on alt.politics.org.cia (Markku J. Saarelainen)
Actually, my experience and then postings since the fall of 1999 provide an
excellent behavior study - the Game of General ... (Markku J. Saarelainen)
Re: Prime Generation in C,C++ or Java (Herb Savage)
Re: Why no civilian GPS anti-spoofing? / proposal (David Formosa (aka ? the
Platypus))
Re: Prime Generation in C,C++ or Java (Herb Savage)
Re: Prime Generation in C,C++ or Java (Herb Savage)
Re: Prime Generation in C,C++ or Java (Herb Savage)
----------------------------------------------------------------------------
From: [EMAIL PROTECTED] (Ian Goldberg)
Subject: Re: Scary Possibility: Ticklish Chips
Date: 10 May 2000 15:43:30 GMT
In article <8f94if$29e$[EMAIL PROTECTED]>, <[EMAIL PROTECTED]> wrote:
>In article <8f8g1l$2cn$[EMAIL PROTECTED]>,
> [EMAIL PROTECTED] (Paul Rubin) wrote:
>> That's called differential fault analysis and it's a serious problem
>> for smart card manufacturers. Several papers have been written about
>it.
>>
>> For modules with more complicated packaging than smart cards, it's
>easier
>> to protect against, though I don't think any type of hardware tamper
>> resistance can stop a really determined and rich attacker.
>
>I believe Bruce Schneier and his Counterpane Labs claim to be able to
>break most existing smart cards in their lab. They're not a particularly
>large company, so apparently you don't need Megabucks to be able to do
>it.
Are you sure you're not thinking of Paul Kocher and Cryptography Research?
- Ian
------------------------------
From: [EMAIL PROTECTED]
Subject: Re: Prime Generation in C,C++ or Java
Date: Wed, 10 May 2000 16:06:16 GMT
User923005 <[EMAIL PROTECTED]> wrote:
> I'm curious as to how long it takes this class to create ten digits worth of
> primes.
On a P-166 using Sun's linux jdk the following program marches along
at a stately 18 32-bit primes / second (558.05 cpu seconds, 9:21.42
elapsed wall time):
import java.math.*;
import java.util.*;
public class Primes {
public static void main(String argv[]) {
Random rng = new Random();
for (int i = 0; i < 10000; i++) {
BigInteger prime = new BigInteger(32, 98, rng);
System.out.println(prime.toString());
}
}
}
However, the discenering eye will quickly note that this isn't a
benchmark, I only ran it once. ;) Also:
1. This generates primes with a 98% probability, lowering that will of
course speed things up.
2. The printout requires converting the prime to decimal and printing
on an unbuffered stream. Eliminating it may speed things up
notiably. And, if all you want is to generate 10k primes for later,
the assignment op is enough.
3. A P-166 is hardly representative of current cpu speeds.
4. The Sun jdk isn't famous for either it's compiler optomisations or
the speed of its interpreter. A more aggressive compiler or JIT should
be faster.
Basically, the important point here is that this timing is more of a
worse case scenario than typical. And it's tough to argue that the C
or C++ would offer either faster development or shorter code in this
case. ;) Although, they could likely be made to run faster if prime
generation really is the bottleneck.
--
Matt Gauthier <[EMAIL PROTECTED]>
------------------------------
From: "Dr. Yongge Wang" <[EMAIL PROTECTED]>
Subject: Re: zeroknowledge.com and freedom.net - Snake oil?
Date: 10 May 2000 16:55:31 GMT
Surely I agree with you that is not a practical attack..
which is just the same as the key-escrow system or the
threshhold cryptosystem... I have just had a rough look at
their whitepage (I have to say that I have no time to look
at details, so I may wrong some where)..It seems that
there is much for the deployment of the Freenet servers.
If all the servers are deployed by ZKS, then indeed you
have no privacy. You have to trust ZKS (ZKS can easily
trace you). Then the problem is why we need a such complicated
system instead of choosing a simple anonymizer proxy like
www.anonymizer.com ?
OK, if the freenet servers are run by independent volunteers
(this is the case that the ATT lab Crowd works), then
it is should work and indeed I suspect that why we
need cryptography here even... (have a look at the
simple flip-a-coin method by CROWD...)..
Matt Curtin <[EMAIL PROTECTED]> wrote:
:>>>>> "Yongge" == Yongge Wang <[EMAIL PROTECTED]> writes:
: Yongge> The problem is that if one guy has access to all these
: Yongge> freenet proxies, then he can trace the log file and trace
: Yongge> back u.. u will not be anonymous then .
: This isn't a practical attack in the general case because of the need
: to have access them at the same time, while a session is active, and
: before the session changes its path in the network. Given that you're
: almost certain not to send all of your traffic through a single legal
: jurisdiction, getting that kind of access to the system would be a
: difficult proposition indeed, even if you do it illegally.
======================================================.
Yongge Wang |
Center for Applied Cryptographic Research |
University of Waterloo |
Waterloo, Ontario, N2L 3G1 |
Canada |
Phone:(519)8884567 x 5295 |
[EMAIL PROTECTED] |
http://cacr.math.uwaterloo.ca/~ygwang |
======================================================'
------------------------------
Date: Wed, 10 May 2000 17:55:43 +0100
From: Luis Sousa <[EMAIL PROTECTED]>
Subject: Microsoft CryptoAPI: Crypt32.lib problem
Hi there folks ....
While exploring the Microsoft Crypto API that comes with Visual C++ 6.0
I've found that the wincript.h file does not contain some of the
functions declarations and macros documented in MSDN, also crypt32.lib
does not exports those functions. nevertheless the crypt32.dll that is
in the \winnt\system32 exports all those functions missing in the header
file ! Does anyone knows where to get this updated header and lib files
? I've tried microsoft's site with no luck yet !
Any help appreciated!
Luis Sousa <[EMAIL PROTECTED]>
PS: Sorry if this post is somehow off topic !
------------------------------
From: Paul Koning <[EMAIL PROTECTED]>
Crossposted-To: sci.math
Subject: Re: More on Pi and randomness
Date: Wed, 10 May 2000 12:19:16 -0400
Mok-Kong Shen wrote:
>
> Roger Schlafly wrote:
>
> > Mok-Kong Shen wrote:
> > > Question: If one gets a number of disjoint segments of Pi, have these
> > > as input to good a block cipher and xor the different output sequences,
> > > would the result be practically useful? Thanks.
> >
> > Better yet, take a chunk of the binary expansion of Pi, and
> > rearrange all the 0s and 1s randomly! <g>
>
> If you are capable enough to do that, why not? For those who are
> less capable, finding some other 'practical' methods may be a
> worthwhile undertaking.
You missed the <g> ("grin") -- what Roger said is merely
a complicated way of saying "use a real one time pad".
Pi doesn't actually enter into the picture at all.
(The statement works equally well if you replace "pi" by
"1/3" in his comment.)
paul
------------------------------
From: Mike Rosing <[EMAIL PROTECTED]>
Subject: Re: testing sbox system
Date: Wed, 10 May 2000 12:21:59 -0500
Tom St Denis wrote:
>
> Say I use four sboxes in parallel, what is a way to measure the
> independance between the other sboxes... I was thinking like
>
> (four 8x8 sboxes...)
> for x = 0 to 256
> sbox[4][x] = sbox[0][x] xor sbox[1][x] xor sbox[2][x] xor sbox[3][x]
> Then test for ideal non-linearness (as supplied by the user), SAC and
> BIC?
You are linearly combining non-linear functions. The result might be
linear! It probably won't be, but the result may not be bijective
either.
Example: sbox0 = x^3 + x, sbox1 = x^5 + x^3, sbox2 = x^7 + x^5, sbox3 =
x^7.
The total sum (as above) gives sbox4 = x.
Given you're doing a random selection, this is not likely. The xor of
rejected sboxes might give you a single useful sbox, since it's just
another
random permutation.
Patience, persistence, truth,
Dr. mike
------------------------------
From: Mike Rosing <[EMAIL PROTECTED]>
Subject: Re: *** New Record in Point Counting on Elliptic Curves ***
Date: Wed, 10 May 2000 12:31:11 -0500
Robert Harley wrote:
>
> New Record in Point Counting on Elliptic Curves in Characteristic 2
[...]
> The computation took 54 hours using one 667 MHz processor on an
> AlphaServer ES40 and used 932 MB of memory. We are grateful to Paul
> Bourke from Swinburne Astrophysics and Supercomputing who graciously
> provided the CPU time for this record.
>
> The algorithm we used will be described in [FGH] and is a
> characteristic 2 extension of the algorithm in [Sat], with various
> improvements and optimisations.
>
> Further details will be available from the following Web page,
> along with new records as we set them.
>
> http://www.lix.polytechnique.fr/Labo/Mireille.Fouquet/elliptic.html
[...]
> [FGH]:
> Mireille Fouquet, Pierrick Gaudry, Robert Harley,
> "On Satoh's algorithm and its implementation",
> In preparation.
Congratulations, that's a huge field size in that short a time!
Can't wait to see the paper :-)
Patience, persistence, truth,
Dr. mike
------------------------------
Crossposted-To:
talk.politics.crypto,alt.security.ripem,sci.answers,talk.answers,alt.answers,news.answers
Subject: RSA Cryptography Today FAQ (1/1)
from: [EMAIL PROTECTED]
reply-to: [EMAIL PROTECTED]
Date: 10 May 2000 17:38:52 GMT
Archive-name: cryptography-faq/rsa/part1
Last-modified: 1997/05/21
An old version of the RSA Labs' publication "Answers to Frequently Asked
Questions about Today's Cryptography" used to be posted here until May
1997. These postings were not sponsored or updated by RSA Labs, and
for some time we were unable to stop them. While we hope the information
in our FAQ is useful, the version that was being posted here was quite
outdated. The latest version of the FAQ is more complete and up-to-date.
Unfortunately, our FAQ is no longer available in ASCII due to its
mathematical content. Please visit our website at
http://www.rsa.com/rsalabs/ to view the new version of the FAQ with your
browser or download it in the Adobe Acrobat (.pdf) format.
RSA Labs FAQ Editor
[EMAIL PROTECTED]
------------------------------
From: [EMAIL PROTECTED] (Doug Stell)
Subject: Re: GPS encryption turned off
Date: Wed, 10 May 2000 17:32:01 GMT
On Tue, 09 May 2000 23:28:55 GMT, [EMAIL PROTECTED] (Dan Day) wrote:
>What was "the Warthog incident"?
Apart form its possible relationship to SA being turned off, the A-10
incident was a major event at the time. The A-10 took off from the
Phoenix area for a training mission in southwestern Arizona. Instead,
it headed straight for Colorado with no contact. There was much
discussion and conflicting reports as to whether or not the pilot was
in control or not.
The public safety issue was that the plane was reportedly carrying two
bombs and a significant number of flares. There was great concern
about some hiker in the Rockies stumbling across them and being killed
or injured. There also was concern that the snow could cause the
dangerous material to migrate down hill and increase the threat. Since
there is a very short window for recovering items in this rugged area,
there was a major push to locate the plane, pilot and dangerous
materials. Obviouslsy, all possible resources were mobilized to locate
the wreck and that would be sufficient reason to turn off SA.
There was also the question of "Why?" There was a high-visibility
trial going on in Colorado and there was the thought that the pilot
may drop his load there. (He didn't make it that far.) It was finally
ruled a pilot suicide, but there were lots of unanwered questions.
------------------------------
From: John Myre <[EMAIL PROTECTED]>
Subject: Re: TLAs (was: Re: Tempest Attacks with EMF Radiation)
Date: Wed, 10 May 2000 11:55:38 -0600
Richard Herring wrote:
>
> > In article <8f0pl8$[EMAIL PROTECTED]>,
> > Guy Macon <[EMAIL PROTECTED]> wrote:
> > >What really ticks me off is Asynch Transfer mode. Uh, fellows, the
> > >acronym "ATM" is already taken...
>
> At the Moment?
>
See
http://www.acronymfinder.com/af-query.asp?Acronym=ATM&String=off&search.x=50&search.y=8
Don't forget the "more" button on the bottom...
John M.
------------------------------
From: [EMAIL PROTECTED] (David A. Wagner)
Subject: Re: zeroknowledge.com and freedom.net - Snake oil?
Date: 10 May 2000 10:37:18 -0700
I believe the idea is that many Freedom servers would be run by other
parties, not just by ZKS. This eliminates the single point of failure
at, e.g., www.anonymizer.com. I don't know what the current deployment
status of ZKS is, though. This isn't on their web page?
------------------------------
From: Thomas Wu <[EMAIL PROTECTED]>
Crossposted-To: comp.security.misc
Subject: Re: Q: Searching for authentication protocols
Date: 10 May 2000 11:17:45 -0700
Tom´s Perlines Hormann <[EMAIL PROTECTED]> writes:
> > Strong password authentication protocols like SRP and SPEKE also exchange
> > a symmetric session key as a byproduct of successful authentication.
> > You can use this key to provide session integrity and confidentiality.
> I have printed out your papers about it, and will read through them
> carefully.
> BTW: can you tell me who is succesfully applying your protocol? Has it
> been (crypto-)analysed from third parties???
> Do you know an evaluation vs. other well-known protocols?
I can't speak for David Jablon, though I do know that SPEKE is being used
in Entrust/PKI 5.0. SRP is being used in a number of widely deployed
telnet/ftp applications, both commercial (like Kermit and NetTerm) and
freeware. Strong password protocols in general and SRP in particular
have withstood a good deal of public analysis and scrutiny, both on
the 'Net and offline. A few well-directed searches should be enough
to get you started.
--
Tom Wu * finger -l [EMAIL PROTECTED] for PGP key *
E-mail: [EMAIL PROTECTED] "Those who would give up their freedoms in
Phone: (650) 723-1565 exchange for security deserve neither."
http://www-cs-students.stanford.edu/~tjw/ http://srp.stanford.edu/srp/
------------------------------
From: [EMAIL PROTECTED] (DJohn37050)
Subject: Re: *** New Record in Point Counting on Elliptic Curves ***
Date: 10 May 2000 18:22:02 GMT
Congratulations in furthering our knowledge of elliptic curves.
Don Johnson
------------------------------
From: Mok-Kong Shen <[EMAIL PROTECTED]>
Crossposted-To: sci.math
Subject: Re: More on Pi and randomness
Date: Wed, 10 May 2000 21:11:39 +0200
Paul Koning wrote:
> Mok-Kong Shen wrote:
> >
> > Roger Schlafly wrote:
> >
> > > Mok-Kong Shen wrote:
> > > > Question: If one gets a number of disjoint segments of Pi, have these
> > > > as input to good a block cipher and xor the different output sequences,
> > > > would the result be practically useful? Thanks.
> > >
> > > Better yet, take a chunk of the binary expansion of Pi, and
> > > rearrange all the 0s and 1s randomly! <g>
> >
> > If you are capable enough to do that, why not? For those who are
> > less capable, finding some other 'practical' methods may be a
> > worthwhile undertaking.
>
> You missed the <g> ("grin") -- what Roger said is merely
> a complicated way of saying "use a real one time pad".
> Pi doesn't actually enter into the picture at all.
> (The statement works equally well if you replace "pi" by
> "1/3" in his comment.)
>
You seemed to have missed what I meant by 'capability'.
M. K. Shen
------------------------------
From: Andy Dingley <[EMAIL PROTECTED]>
Subject: Re: UK issue; How to determine if a file contains encrypted data?
Date: Wed, 10 May 2000 20:05:31 +0100
[EMAIL PROTECTED] (Richard Herring) a écrit :
>Wouldn't help. It's possession that counts, not how you acquired it.
>If They "have reason to believe" that it contains encrypted data,
>the onus is on you to provide the keys.
So what happens with a large jpeg, when one of Straw's minions asserts
that it contains something steganographic (even if it doesn't) and
you're faced with a 2 year jail sentence for refusal to provide the
keys to something that doesn't even have them,
The UK. It's the best place to do e-commerce, honest.
------------------------------
From: Andy Dingley <[EMAIL PROTECTED]>
Subject: Re: UK issue; How to determine if a file contains encrypted data?
Date: Wed, 10 May 2000 20:05:32 +0100
Runu Knips <[EMAIL PROTECTED]> a écrit :
>Any random data might be encrypted, OR it might be
>random data.
When the "Does Notes have a crypto backdoor ?" issue arose a while
back, wasn't a key found by examining the entropy of series of bytes
-- the supposed "key" was _too_ random to be typical content for
executable binary code.
--
Smert' Spamionam
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: alt.security
Subject: Living in my car in Miami ... 5/10/2000 - cryptography and other matters ...
read all my messages on alt.politics.org.cia
Date: Wed, 10 May 2000 18:56:37 GMT
Living in my car in Miami ... 5/10/2000
When I woke up in this morning, it was around 5:50 A.M. and I saw a
shopping mall. I was in the parking lot of this mall. Well, it was the
same place were I stopped last night and listened some tape recordings
on public key encryption and other cryptography issues. Only few
people provided enough detailness in their speeches and most were
relatively general sessions. Well, I listened and made few note. If you
like I can teach you some good cryptography here on the Internet.
. Actually, some of these speakers were professionals such as the chief
scientist of RSA and some U.K. based smart card specialists. Anyway,
when I woke up, the sun was just rising and my current favorite radio
station, beethoven.com, played Billy Joel's Piano Man - " .. you know
it is me they are coming to see .. so forget about the life for a
while .." - actually one very enjoyable moment again. I am one of the
earliest person to go places in each morning. I ususally start sleeping
around 1:00 A.M. and wake up around 6-7:00 A.M.
One interesting memory of mine from a National Science and Technology
Park of the USSR in Moscow is a classical music that was played in the
area. It is one of those moments where you feel youself to be in a
total peace and get that "ux" (you are a part of the universe and can
experience it in its fullest) feeling. I am sure you understand what I
mean. In the same way, I had this "ux" in the Grand Canyon, Barcelona,
in the top of the Cathedral Vatican, in Miami Beach on January 9, 2000,
when I saw the wonderful sunrise and so on and so on.
Yours,
Markku
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: soc.culture.usa,soc.culture.soviet
Subject: Actually, my experience and then postings since the fall of 1999 provide an
excellent behavior study - the Game of General ...
Date: Wed, 10 May 2000 19:35:34 GMT
Actually, my experience and then postings since the fall of 1999
provide an excellent behavior study. It is like a multi-player game as
it was intended to be. I especially liked some physical interaction
such as
1. the Gwinnett county police coming in and illegally searching the
place,
2. two persons saing straight to my face "fuck you" and giving the
finger,
3. some people calling in (national hotlines, individuals and so on),
4. getting involvement from Europe and people doing things and
communicating all kinds of messages (on phone, telegrams, letters and
so on),
5. my ex-spouse and her lawyer using my Internet postings in the court
room (they used that the double-double agent posting :),
6. the Gwinnett county´s public library´s network shut down or
distrupted by the CIA/NSA,
7. people in the cafe in Barnes & Nobles and Borders Bookstore coming
close to me and telling they are my friends and playing the chess (it
was likely an effort to get me in),
8. some people following me from Atlanta to Miami in March, 2000 and
Jack and two of his friends (one was his wife) coming and telling me
that he identifies me from a picture and said my name "Mark" that I
used for years (actually it was invented by my ex-spouse´s grandmother,
Mrs. Etherton, because she was not able to say my name - and then later
evolved to other regular business application),
9. a person with an ear device in New Mexico and my extraordinary
behavior in Toas, New Mexico,
10. my ex-spouse bringing a picture of a lion and a cat from her office
and many others.
And all this has resulted from posting or emailing specific issues and
matters on the Internet. I have posted many here on the USENET, but I
have few others that I have still in my notebooks that I have posted.
It is like I knew what would happen. So in many ways, it has been
a "human interaction" intelligence agent game (an element of the Game
of General (M)), where people are real and communication processes are
both electronic and human. In many ways, it was also a ploy to take
down all those who were violating my privacy since 1994. You see the
game started already in February, 1999 (and for those who think you
started the game - I am so amused :) ). I really wanted to fire Boris
Yeltsin, because he did more damage to the Russian Federation than good
in my opinion (CNN check your log files from February, 1999 :) ).
Yours,
M
P.S. Actually, you can play this game from anywhere around the world.
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
Date: Wed, 10 May 2000 14:55:52 -0500
From: Herb Savage <[EMAIL PROTECTED]>
Subject: Re: Prime Generation in C,C++ or Java
[EMAIL PROTECTED] wrote:
> User923005 <[EMAIL PROTECTED]> wrote:
> > I'm curious as to how long it takes this class to create ten digits worth of
> > primes.
>
> On a P-166 using Sun's linux jdk the following program marches along
> at a stately 18 32-bit primes / second (558.05 cpu seconds, 9:21.42
> elapsed wall time):
>
> import java.math.*;
> import java.util.*;
>
> public class Primes {
> public static void main(String argv[]) {
> Random rng = new Random();
>
> for (int i = 0; i < 10000; i++) {
> BigInteger prime = new BigInteger(32, 98, rng);
> System.out.println(prime.toString());
> }
> }
> }
>
> However, the discenering eye will quickly note that this isn't a
> benchmark, I only ran it once. ;) Also:
>
> 1. This generates primes with a 98% probability, lowering that will of
> course speed things up.
That's actually a (1-1/2^98) probability or greater than
99.999999999999999999999999999% probability.
Regards,
Herb Savage
------------------------------
From: [EMAIL PROTECTED] (David Formosa (aka ? the Platypus))
Subject: Re: Why no civilian GPS anti-spoofing? / proposal
Date: 10 May 2000 20:00:15 GMT
Reply-To: dformosa@[202.7.69.25]
On Tue, 09 May 2000 12:37:19 -0400, Trevor L. Jackson, III
<[EMAIL PROTECTED]> wrote:
[...]
>A Maglite probably doesn't have enough volume to present a serious
>threat,
Well a vial of mercury in the maglite would be enought to scrap the
airplane. A vial of hydrogen cyanide could kill everyone (or at least
alot of people) in the plane. I expect you could fit enough plastic
explosive to blow a hole in the plane's hull.
--
Please excuse my spelling as I suffer from agraphia. See
http://dformosa.zeta.org.au/~dformosa/Spelling.html to find out more.
Interested in drawing platypie for money? Email me.
Crack my Hash win$200 http://dformosa.zeta.org.au/~dformosa/PlatyMAC.txt
------------------------------
Date: Wed, 10 May 2000 15:01:36 -0500
From: Herb Savage <[EMAIL PROTECTED]>
Subject: Re: Prime Generation in C,C++ or Java
[EMAIL PROTECTED] wrote:
> User923005 <[EMAIL PROTECTED]> wrote:
> > I'm curious as to how long it takes this class to create ten digits worth of
> > primes.
>
> On a P-166 using Sun's linux jdk the following program marches along
> at a stately 18 32-bit primes / second (558.05 cpu seconds, 9:21.42
> elapsed wall time):
>
> import java.math.*;
> import java.util.*;
>
> public class Primes {
> public static void main(String argv[]) {
> Random rng = new Random();
>
> for (int i = 0; i < 10000; i++) {
> BigInteger prime = new BigInteger(32, 98, rng);
> System.out.println(prime.toString());
> }
> }
> }
>
> However, the discenering eye will quickly note that this isn't a
> benchmark, I only ran it once. ;) Also:
>
> 1. This generates primes with a 98% probability, lowering that will of
> course speed things up.
That's actually a (1-1/2^98) probability or greater than
99.999999999999999999999999999% probability.
Regards,
Herb Savage
------------------------------
Date: Wed, 10 May 2000 15:02:10 -0500
From: Herb Savage <[EMAIL PROTECTED]>
Subject: Re: Prime Generation in C,C++ or Java
[EMAIL PROTECTED] wrote:
> User923005 <[EMAIL PROTECTED]> wrote:
> > I'm curious as to how long it takes this class to create ten digits worth of
> > primes.
>
> On a P-166 using Sun's linux jdk the following program marches along
> at a stately 18 32-bit primes / second (558.05 cpu seconds, 9:21.42
> elapsed wall time):
>
> import java.math.*;
> import java.util.*;
>
> public class Primes {
> public static void main(String argv[]) {
> Random rng = new Random();
>
> for (int i = 0; i < 10000; i++) {
> BigInteger prime = new BigInteger(32, 98, rng);
> System.out.println(prime.toString());
> }
> }
> }
>
> However, the discenering eye will quickly note that this isn't a
> benchmark, I only ran it once. ;) Also:
>
> 1. This generates primes with a 98% probability, lowering that will of
> course speed things up.
That's actually a (1-1/2^98) probability or greater than
99.999999999999999999999999999% probability.
Regards,
Herb Savage
------------------------------
Date: Wed, 10 May 2000 15:04:14 -0500
From: Herb Savage <[EMAIL PROTECTED]>
Subject: Re: Prime Generation in C,C++ or Java
[EMAIL PROTECTED] wrote:
> User923005 <[EMAIL PROTECTED]> wrote:
> > I'm curious as to how long it takes this class to create ten digits worth of
> > primes.
>
> On a P-166 using Sun's linux jdk the following program marches along
> at a stately 18 32-bit primes / second (558.05 cpu seconds, 9:21.42
> elapsed wall time):
>
> import java.math.*;
> import java.util.*;
>
> public class Primes {
> public static void main(String argv[]) {
> Random rng = new Random();
>
> for (int i = 0; i < 10000; i++) {
> BigInteger prime = new BigInteger(32, 98, rng);
> System.out.println(prime.toString());
> }
> }
> }
>
> However, the discenering eye will quickly note that this isn't a
> benchmark, I only ran it once. ;) Also:
>
> 1. This generates primes with a 98% probability, lowering that will of
> course speed things up.
That's actually a (1-1/2^98) probability or greater than
99.999999999999999999999999999% probability.
Regards,
Herb Savage
------------------------------
** 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
******************************
