HDTenEightyP/NetNews huggingface dataset:
From: rcain@netcom.com (Robert Cain)
Newsgroups: sci.crypt
Subject: Help! Primality testing algorithm.
Date: 21 Aug 92 20:08:34 GMT
Organization: Netcom - Online Communication Services  (408 241-9760 guest)


Some time back the primality testing algorithm currently most favored
was posted and I thought I saved it.  Apparantly not and I am in urgent
need.  If someone has it could you repost please.

Thanks,

Bob
-- 
Bob Cain    rcain@netcom.com   408-358-2007

                ____________________________________________
               \                                           /
                \ Flames to /dev/null    Advice by email! /
                 \                                       /
                  \ PGP public key available on request /
                   \                                   /
                    -----------------------------------
Newsgroups: sci.crypt
From: dflynn@aludra.usc.edu (Daniel Flynn)
Newsgroups: sci.crypt
Subject: Secure mail
Date: 20 Aug 1992 02:04:08 -0700
Organization: University of Southern California, Los Angeles, CA
NNTP-Posting-Host: aludra.usc.edu
Summary: A secure mail system using RSA

I am not that knowledgable on various encryption methods, but I have 
read various articles on RSA public key encryption. I was wondering has 
anyone considered incorperating public key encryption in a mail program
as a means of having secure electronic communications?

Dan Flynn

Newsgroups: sci.crypt
From: schultz@halley.est.3m.com (John C. Schultz)
Subject: Re: WANTED: MS-DOS PD program based on RSA Public Key 
In-reply-to: hgpeach@ms.uky.edu's message of Wed, 12 Aug 1992 20:37:35 GMT
Organization: 3M Company, 3M Center, Minnesota, USA
Date: Thu, 13 Aug 92 00:20:34 GMT

you might try PGP - Phil's Pretty Good Software provides Pretty Good
Privacy (PGP) from Philip Zimmerman.  (lots of P's I know :-)

Anyway works well on a DOS machine.  Be aware of patent status of RSA
in the US (through 2000) for commercial use.

Check with ARCHIE for an ftp site.  I seem to have misplaced it.
--
   John C. Schultz   +1 (612) 733-4047   schultz@halley.serc.3m.com
   How to include the taste of Glendronach in a multi-media system?
Newsgroups: sci.crypt
From: tlimonce@drew.drew.edu (Tom Limoncelli)
Subject: Re: Secure netnews
Summary: Oh nothing important.  I just have this Perl script that I use to generate this stream of posts whenever someone posts the silly suggestion that netnews could be made secure.
Keywords: silly automated
Organization: Drew University - Alumni
Date: Wed, 19 Aug 1992 23:14:47 GMT

In <f4@Warren.MENTORG.COM> tal@Warren.MENTORG.COM (Tom Limoncelli) writes:

> Finally people will really understand the proposal.

At which time Geoff will post a short message showing how simple it
is to subvert such a system.

Tom
--
There is nothing wrong with talking to yourself...
I met an interesting person that way!
-- 
Tom Limoncelli -- tal@warren.mentorg.com (work) -- tal@plts.uucp (play)
"Oh! I thought it was one of those useless demos of everything that
    a GUI builder could do." -Anonymous person watching demo of
         Solaris 2.0's graphical tool for managing NIS+
From: jbs@WATSON.IBM.COM
Newsgroups: sci.crypt
Subject: RSA-129 contest
Date: 22 Aug 92 01:13:04 GMT


         Dan Berstein posts:
:To factor RSA-129 with GNFS would take many hundreds or thousands of
:MIPS-years with a random polynomial. In the two weeks since the contest
:was announced, quite a few people have submitted polynomials, and the
:best so far---yours---is roughly 1000 times better than random.
:being equal. (Most polynomials are somewhere in the middle.)
         Actually it is about 100 times better than random using
your stated figure of merit.  More to the point it is only about 10
times better than simply trying a few million values of m.
         Dan Berstein also posts:
:Keep in mind that f(m) doesn't have to equal n---it be any positive
:multiple. So there are a huge number of polynomials to search through.
         Since the density of good representations for k*n goes as
k**(-9/4) considering multiples of n is unlikely to give a significant
improvement.
         Dan Berstein also posts:
:In any case, the polynomial-searching contest has produced spectacular
:results so far. Keep those submissions coming in! I'm sorry I don't yet
:have precise estimates of exactly how much RSA-129 GNFS time is saved by
:any particular polynomial, but I can assure you that a few weeks of
:polynomial searching will be time very, very well spent.
         I must disagree, extensive searches without an accurate figure
of merit are basically a waste of time.  I have little enthusiasm for
burning weeks of computer time searching for good fifth degree poly-
nomials only to learn that a more complete figure of merit shows that
I should have been searching for sixth degree polynomials.
         Dan Berstein also posts:
:Keep in mind that---even if Bob's pessimistic estimate of 14 digits is
:close to reality, which I very much doubt---f(m) can be any multiple of
:n, and two-variable polynomials f(m_1,m_2) also work for GNFS. If we
:were to allow 10^5 multiples of n, 10^24 choices of m_1, 10^24 choices
:of m_2, and 10^14 choices of each c_i, then there would be roughly 10^9
:sufficiently small polynomials for RSA-129. So from a theoretical point
:of view there's no problem.
         As I point out above, considering all multiples of n increases
the density of representations (of the form f(m), f degree 5) by, sum
over k of k**(-9/4), which is less than 2 (not 10**5).  I can't comment
on searching for two-variable polynomials without knowing the figure
of merit.
                       James B. Shearer
Newsgroups: sci.crypt
From: limonce@pilot.njin.net (Tom Limoncelli)
Subject: Re: Secure netnews
Summary: Oh nothing important.  I just have this Perl script that I use to generate this stream of posts whenever someone posts the silly suggestion that netnews could be made secure.
Keywords: silly automated
Organization: New Jersey Intercampus Network
Date: Wed, 19 Aug 1992 23:14:28 GMT

In <f2@drew.drew.edu> tlimonce@drew.drew.edu (Tom Limoncelli) writes:

> Such posts are always followed by someone talking about how it
> can't be done without breaking all old systems.

This is always followed by someone who really believes that they've
figured out a way to do it.

Tom
--
There is nothing wrong with talking to yourself...
at least you know you're going to win any arguments!
-- 
Tom Limoncelli -- tal@warren.mentorg.com (work) -- tal@plts.uucp (play)
"Oh! I thought it was one of those useless demos of everything that
    a GUI builder could do." -Anonymous person watching demo of
         Solaris 2.0's graphical tool for managing NIS+
Newsgroups: sci.crypt
From: lewis@aera8700.mitre.org (Keith Lewis)
Subject: Re: random values
Organization: The MITRE Corporation
Date: Fri, 21 Aug 1992 13:42:17 GMT

In article <1992Aug20.864.127@ALMAC>, keith.willis@almac.co.uk writes:
>        This is fine as a random bitstream, but for his application,
>        he needs a set of random _values_, in a defined range, with

You can convert from a random bitstream to a stream of random discrete
values (let's say, integers from 0..R) by the following algorithm.

    Determine N, the number of bits you need (lowest N such that 2**N > R)

    while (more bits available)
        construct integer X out of next N bits (X = b(1)+2*b(2)+4*b(3)+...)
        if X <= R
            output X to stream
        else
            do nothing (discard bad X)
    endwhile

For ranges that are exactly a power of two, this algorithm works perfectly. 
For other ranges, it may discard (waste) almost half your bitstream.

>        the constraint that there must be at least one of each
>        possible value.  

At least one of each possible value?  That's a weird requirement.  Could you
just add a list of all possible values onto the end of the stream?

Keith Lewis             klewis@mitre.org          "Mr. Cheap"
I don't dance to music; music dances to me.  Email me for my PGP key.
The above may not (yet) represent the opinions of my employer.
Newsgroups: sci.crypt
From: tlimonce@drew.drew.edu (Tom Limoncelli)
Subject: Re: Secure netnews
Summary: Oh nothing important.  I just have this Perl script that I use to generate this stream of posts whenever someone posts the silly suggestion that netnews could be made secure.
Keywords: silly automated
Organization: Drew University - Alumni
Date: Wed, 19 Aug 1992 23:15:18 GMT

In <f7@Warren.MENTORG.COM> tal@Warren.MENTORG.COM (Tom Limoncelli) writes:

> At that time, someone will suggest that netnews be reimplemented
> from the ground up with security and authenticity as prime
> concerns.

When someone posts that this will slow the system down to a halt, 2-3
posts will appear claiming that the speed will be worth it.  Claims
such as "if netnews isn't secure, it just doesn't have a future" will
be made.

Actually, I think Kent already said that.

Tom
--
There is nothing wrong with talking to yourself...
I met an interesting person that way!
-- 
Tom Limoncelli -- tal@warren.mentorg.com (work) -- tal@plts.uucp (play)
"Oh! I thought it was one of those useless demos of everything that
    a GUI builder could do." -Anonymous person watching demo of
         Solaris 2.0's graphical tool for managing NIS+
From: dpkemp@afterlife.ncsc.mil (David P. Kemp)
Newsgroups: sci.crypt
Subject: Re: tabulation of primes
Date: 12 Aug 92 12:55:30 GMT
Organization: The Great Beyond

In article <Bstqr2.Lxq@cs.columbia.edu> ji@cs.columbia.edu (John Ioannidis) writes:
>In article <1557@anagld.analytics.com> sammy@anagld.analytics.com (Sam Blackburn) writes:
>
>>In my humble excursions into this arena, I've noticed that primes are roughly
>>11% of the numbers of x digits in length.  Is it feasible to compile a table
>>of primes? Sure.  But it's gonna be one heck of a list.  The number of primes
>>is not infinite (I'm probably going to get flamed on that remark).
>
>Flamed? FLAMED? Why, what was the last time anyone on the net was
>flamed for being ignorant? :-)
>

Several people have jumped on "The number of primes is not infinite" statment,
which clearly is flammable by itself.

In the context of the original message though, I believe the poster meant
"The number of primes of exactly 10**75 digits (or perhaps of
10**(75+/-3) digits) is not infinite."  This number may be more than the
number of atoms in the universe, but it *is* finite.


-- 
   Dave Kemp   dpkemp@afterlife.ncsc.mil 
-----------------------------------------------------------------------------
"The use of history as therapy means the corruption of history as history."
    -- Arthur Schlesinger          (quote stolen from Chet Ramey, CWRU)
Newsgroups: sci.crypt
From: jru@Comtech.com (Jimmy R. Upton)
Subject: Re: tabulation of primes
Organization: Comtech Labs Inc, Palo Alto
Date: Tue, 11 Aug 1992 11:35:46 GMT

>
>In my humble excursions into this arena, I've noticed that primes are roughly
>11% of the numbers of x digits in length.  Is it feasible to compile a table
>of primes? Sure.  But it's gonna be one heck of a list.  The number of primes
>is not infinite (I'm probably going to get flamed on that remark).

A reasonably accurate and easy to remember approximation for the fraction
of numbers that are prime for a given size is 1/n where n is the number
of bits in the number.  So for example for numbers around 10 bits long
11% is not a bad approximation but for numbers 100 bits long it is
terrible.

I am going to give you a change to back out gracefully here:  When
you said the number of primes was not infinite did you mean the total
number of primes or the number of primes in a given range.  (Hint:
answer the latter and you can more or less save face :-).

Jimmy
jru@Comtech.com
n

Newsgroups: sci.crypt
From: george@tessi.com (George Mitchell)
Subject: Re: tabulation of primes
Organization: Test Systems Strategies, Inc., Beaverton, Oregon
Date: Wed, 12 Aug 1992 17:16:56 GMT

graef@rs5.hrz.th-darmstadt.de (Ulrich Graef) writes:

>You must notice, that there exists a small community (even with
>mathematicians among them) which does not believe in inductive
>proofs. I think, they have a lot of problems with commonly
>accepted theorems.

Whoa!  Euclid's proof does not involve induction!  It is a
reductio ad absurdum proof, which shows that the premise:

   Assume that there is a largest prime n.

leads to a contradiction, and therefore the premise cannot be true.

You are correct that some people worry about inductive proofs, but
their worries fortunately do not apply here.

George Mitchell (george@tessi.com)
Newsgroups: sci.crypt
From: glenn@physics.su.OZ.AU (Glenn Geers)
Subject: ENIGMA machine in software
Followup-To: Poster
Keywords: ENIGMA
Organization: School of Physics, University of Sydney, Australia
Date: Wed, 19 Aug 1992 02:01:49 GMT

Hi,
	does anyone know if it is possible to obtain a complete version of the
German ENIGMA machine in software? I know that crypt(3) uses a two rotor
system (a trivialized ENIGMA machine) and I can get source code. I could
probably hack the code together from a mathematical description of the 
machine's workings. But heck, why reinvent the wheel :-)

Replies by email preferable.

Thanks in advance,
	Glenn
--
___________________________________________________________________________
Glenn Geers                       | "So when it's over, 
                                  |  we're back to people.
Department of Theoretical Physics |  Just to prove that human touch
The University of Sydney          |  can have no equal."
Sydney NSW 2006 Australia         |  - Basia Trzetrzelewska, 'Prime Time TV'
                                  |
Phone: +61 2 692-3241 (voice)     |_________________________________________
       +61 2 660-2903 (fax)       |
                                  |
glenn@physics.su.oz.au            | #include <standard_disclaimer.h>
                                  |
----------------------------------------------------------------------------
Newsgroups: sci.crypt
From: glenn@physics.su.OZ.AU (Glenn Geers)
Subject: Need more info on ENIGMA
Followup-To: Poster
Keywords: ENIGMA
Organization: School of Physics, University of Sydney, Australia
Date: Thu, 20 Aug 1992 02:27:01 GMT

Hi,
	Thanks to those who replied to my original post. I've grabbed Konheim's
book and it will not be a difficult task to write a program from the description
it contains. However, some information necessary for a reconstruction is
missing. What I need are the initial rotor substitutions for the three
rotors and the (fixed) substitution for the reflecting rotor. I've also
grabbed Rejewski's article from "Annals of Computing History" which contains
a preliminary version of the code used for ENIGMA_2. I have not copied the
code but suspect that it contains the stuff I need. Any help would be much
appreciated.

Glenn

--
___________________________________________________________________________
Glenn Geers                       | "So when it's over, 
                                  |  we're back to people.
Department of Theoretical Physics |  Just to prove that human touch
The University of Sydney          |  can have no equal."
Sydney NSW 2006 Australia         |  - Basia Trzetrzelewska, 'Prime Time TV'
                                  |
Phone: +61 2 692-3241 (voice)     |_________________________________________
       +61 2 660-2903 (fax)       |
                                  |
glenn@physics.su.oz.au            | #include <standard_disclaimer.h>
                                  |
----------------------------------------------------------------------------
Newsgroups: sci.crypt
From: ritter@cactus.org (Terry Ritter)
Subject: Multiplexing Ciphers
Keywords: Braided, Mass Encryption
Organization: Capital Area Central Texas UNIX Society, Austin, Tx
Date: Tue, 18 Aug 1992 05:46:00 GMT



 Recently, several messages have proposed cipher systems which use
 a multiplexer to combine two (or more) messages, or different parts
 of a single message, to form ciphertext.  When this was proposed
 last year in The Braided Stream Cipher, I posted a long forgotten
 analysis, which I will now revive.  But first:


 One of the problems we have in cryptology is that our few texts
 do not adequately describe the various techniques and capabilities
 of cryptanalysis, nor the major role cryptanalysis plays in the
 design of new systems.  When new cryptosystems are proposed here,
 we inevitably we end up with "it's obviously strong," "no it's not"
 arguments, ad infinitum.  And almost nobody has the kind of time
 to spare that it would take to develop the techniques to attack
 particular systems and prove weakness.  We rely on the literature
 to guide us, but newbies do not know the literature.

 We need to find a different way to handle the discussion of new
 designs, especially newbie designs.  For a start, I would like to
 see more comments and more participation.

 Moreover, many academics seem to view stream ciphers merely as
 historical oddities.  Few of the common crypto texts describe them
 otherwise.  Consequently, most any newbie in this field convinces
 his or herself that his or her particular stream cipher is new,
 unique, and obviously impossible to crack.  In reality, this is
 almost always wrong.

 But the problem is larger than just stream ciphers:  We need to
 find a way to convey the history of cipher designs and failures,
 even without a good design text to lean on.

 Yes, discussions with newbies are time-consuming and often
 irritating.  But everybody is a newbie at least once (indeed, as
 things progress, we may all be newbies many times).  Somehow we
 need to include these people, rather than just ignoring them, or
 running them off.


 Anyway, my Braided analysis, from a year ago:


Article 3606 in sci.crypt:
From: mrr@scss3.cl.msu.edu (Mark Riordan)
Newsgroups: sci.crypt
Subject: Re: Where can I find RSAREF
Date: 19 Aug 92 00:11:08 GMT
Distribution: na
Organization: Michigan State University
X-Newsreader: Tin 1.1 PL3

ccastdg@prism.gatech.EDU (Davide Gaetano) writes:
: 
:   I had heads a lot of talk about RSAREF a while back, but never did 
:   find out where I could get a copy, can someone send me information on 
:   this, and or an ftp sight for it ?

Send email to rsaref-info@rsa.com
From: segr@nessie.mcc.ac.uk (Simon Read)
Newsgroups: sci.crypt
Subject: Re: shift registers??
Date: 17 Aug 92 11:22:50 GMT
Organization: Manchester Computing Centre

In article <1992Aug14.135934.27422@linus.mitre.org>, hal@gateway.mitre.org
writes:

> Are these devices still that popular? I would have expected 
> them to have been replaced with computer type algorithms certainly within 
> the last decade?  Indeed why is their so much interest in them and not in 
> things like PKS?

Shift registers are still used very extensively in encrypting communications
links. The reason for this is that it is near impossible to achieve the data
rates (throughput) required using software. A small shift register and some logic
gates can be designed to achieve acceptable cover times if the keys can be kept
secret.

That's where PKS comes in, that allows key exchange over insecure channels (so
long as you've set it up right). The speed of this is not terribly important, so
they can be coded in software (though low-cost hardware is available).

In addition "goverment users" tend to be a bit suspicious of these mathematical
PKS techiniques and seem to prefer old-fashioned solutions.

As an illustration the fastest modular-exponentiator chips (which are quite
expensive at about $1000 a throw) can achieve about 64kbps, rising to 128kbps
soon. (modular-exponentiation is the fundamental step in RSA,
Diffie-Hellman, El Gamal etc). Shift register chips which are much smaller
costing $100 in small quantities, can achieve throughput in the order of Mbps.

+------------------------------------------------------------+
|                   INTEGRVM NON SARCIENDVM                  |
+------------------------+-----------------+-----------------+
| Simon Read             |  s-mail:        | v-mail:         |
|                        |                 |                 |
| aka edd the duck       |  Room MB/C25    |                 |
| nka Bart Simpson       |  Computation    | +44 61 200 3312 |
+------------------------+  UMIST          |                 |
| e-mail:                |  Manchester     | +44 61 442 3031 |
|                        |  M60 1QD        |                 |
| Simon.Read@umist.ac.uk |  Great Britain  |                 |
+------------------------+-----------------+-----------------+
Newsgroups: sci.crypt
From: ariel@world.std.com (Robert L Ullmann)
Subject: Re: The Next Pearl Harbor: We don't audit our chips
Organization: The World in Boston
Distribution: usa
Date: Mon, 17 Aug 1992 23:56:25 GMT

Ah, forgive me for questioning the technology of SPECTRE, but ...

If you have too many uncertainties in clocking, fabrication, and
operating temperature to measure the _duration_ of the (alleged)
AM signal ...

... how are you going to stay on "our frequency"?

<grin>

Rob
--
Robert Ullmann		Ariel@World.STD.COM	+1 508 879 6994 x226
Quand Maigret poussa la porte du Tabac Fontaine, vers une heure et demie,
le patron du bar, qui venait de se lever, descendait lentement un escalier
en colimaon qui s'amorait dans l'arrire-salle. ... Arriv derrire le
comptoir, il repousa le garon d'un geste ngligent de la main, saisit
une bouteille de vin blanc, un verre, mlangea au vin d l'eau minrale et,
la tte renverse en arrire, se gargarisa.  -- Simenon
From: adc@convex.cl.msu.edu (Alan D. Cabrera)
Newsgroups: sci.crypt
Subject: Re: PD public key system
Date: 15 Aug 92 16:46:41 GMT
Organization: Michigan State University, East Lansing

In article <1992Aug15.060903.7682@dsd.es.com> rjones@itchy.dsd.es.com (Ray Jones - Perp) writes:
>
>I'm working on a client/server pair that requires some sort of
>verification.  The method I wanted to use was:
>
>I was planning on using the RSA algorithm, but I also need to make this
>code almost completely distributable (PD).  I understand that if I try to
>do that with the RSA system, I'll probably get sued...
>
>Any suggestions?  Is it true I can't use RSA?  Is there a scheme that would
>work for the above and that I could also distribute?

Don't forget to mention that we also want to export the authentication
code.  I think that the key word here is authentication.  Also, the
code is for a game, Netrek.  This means that the PKE algorithm doesn't
need to be as bulletproof as RSA.  If a Netrekkie wants to puruchase
a couple supercomputers to break a key then the geek deserves to
masquarade as any client s/he desires.

--
Alan Cabrera				internet:  adc@tardis.cl.msu.edu
Computer Laboratory			phone:     (517) 353-3027
Michigan State University		fax:       (517) 353-9847
514 Computer Center			bitnet:    CABRERA@MSU
Newsgroups: sci.crypt
From: rschnapp@metaflow.com (Russ Schnapp)
Subject: Re: Amateur cryptosystem design
Keywords: DES mcrypt binary
Organization: Metaflow Technologies Inc.
Date: Fri, 14 Aug 1992 23:46:33 GMT

In article <1992Aug13.152133.19864@shearson.com>, pmetzger@snark.shearson.com (Perry E. Metzger) writes:

|> "Please be patient with me. I'm really enthusiastic about doing brain
|> surgery, and its highly unfair of all of you to discriminate against
|> me because I've never read a book on biology, and this stuff about
|> going to med school, well, I just can't afford it. You are all such
|> jerks for being nasty to me about all this; I think I can do brain
|> surgery as well as the next guy. Hell, I bought a scalpel last week,
|> see!"
|> 
|> --
|> Perry Metzger		pmetzger@shearson.com

Take it easy.  Weren't you ever young and over-eager?  Perhaps if Mr.
Knight can express himself better, we might be able to better classify
his algorithm.  Who knows, if we don't discourage people who think they
have good ideas, perhaps we might all learn something...
-- 

...Russ Schnapp
BIX: rschnapp           Email: uunet!metaflow!rschnapp or rschnapp@metaflow.com
Metaflow Technologies   Voice: 619/452-6608x230;  FAX: 619/452-0401
La Jolla, California    Unless otw specified, I`m speaking only for myself!