HDTenEightyP/NetNews huggingface dataset:
From: warlord@MIT.EDU (Derek Atkins)
Subject: Re: Public Key Ciphers
Organization: Massachusetts Institute of Technology
Date: Thu, 21 Jan 1993 02:02:32 GMT

If you are trying to secure the network, and if you can trust the
machines that you are trying to secure, then I suggest you look into
Kerberos (comp.protocols.kerberos, or kerberos@mit.edu).  It is based
on DES, and uses shared secrets between entities to prove
authenticity.

It doesn't sound like you need real-time key distribution, which is
something that Public Key algorithms have over secret-key algorithms,
but if you have physical access to both machines, then you can place a
shared secret on both machines and now that link is secure...

I hope this helps.  If you have any more questions, feel free to ask.

-derek

PGP 2 key available upon request, or via AFS:
	/afs/athena.mit.edu/user/w/a/warlord/pgp-pubkey.asc

--
  Derek Atkins, MIT '93, Electrical Engineering and Computer Science
      Chairman, MIT Student Information Processing Board (SIPB)
           MIT Media Laboratory, Speech Research Group
           warlord@MIT.EDU       PP-ASEL        N1NWH
Newsgroups: sci.crypt,alt.security.pgp
From: ted@nmsu.edu (Ted Dunning)
Subject: Re: PGP messages readable by more than one person
Organization: Computing Research Lab
Date: Mon, 25 Jan 1993 01:31:10 GMT


In article <1993Jan23.192239.14870@infodev.cam.ac.uk> gtf1000@cus.cam.ac.uk (G.T. Falk) writes:

   I was talking to mathew <mathew@mantis.co.uk> today and the following
   topic came up. How could you make a PGP message which could be read by,
   say, any of certain people, but nobody else?

	... the straightforward answer deleted ...



perhaps a more interesting (in the sense of puzzle solving) problem is
how to extend pgp so that you can send a message that ALL of a group
have to agree to read.  of course, it isn't that much harder than the
previous puzzle, but it is fun.

** answer below **


for N recipients to have to cooperate to read a message, you can make
up a session key, and then make up N-1 random numbers each the length
of the session key.  you then follow Falk and Mathew's suggestion and
encrypt each of these random numbers with the first N-1 users' public
keys.  then you use the last users' public key to encrypt the XOR of
the N-1 random numbers and the true session key.  using this method,
all N of the readers must decrypt their parts of the key so that all
parts can be combined using XOR before the message can be read.
signature methods can be used to verify that each reader is willing, but
a bit of a trick is needed to assure that all readers gets just as
much information as any other.


Newsgroups: sci.crypt
From: lwloen@rchland.vnet.ibm.com (Larry Loen)
Subject: Re: Programs in BASIC please
Date: Thu, 21 Jan 1993 17:09:34 GMT
Distribution: usa
Reply-To: lwloen@rchland.vnet.ibm.com
Disclaimer: This posting represents the poster's views, not necessarily those of IBM
Organization: IBM Rochester

In article <C17KGp.3tw@world.std.com>, jcluett@world.std.com (Jim Cluett) writes:
|> Could any of you point me to an encryption program or two,
|> written in BASIC that would be suitable for beginners? Security
|> is not important. Just looking for some introductory material
|> that would be fun and educational for students. Thanks. e-mail to
|> jcluett@world.std.com.
|>  
|>

If someone sends them to you, well and good.  But, this stuff is entirely
suitable for even beginner students to write from scratch if the system
is simple enough.

If no one sends you code, I suggest getting a copy of H F Gaines'
"Cryptography" and looking at any of the following:

  Vigenere (and its variants, possibly excepting Porta)

  Simple Substitution

  Quagmire

  Complete Columnar Transposition

and code them up yourself.

All of these are somewhere between 20 and 50 lines of code in BASIC,
especially if one uses READ/DATA instead of file I/O to provide the input.
Porta is not all that much harder than the rest, but it might be left out
of a beginner's course simply because it has the same security as the others
and is a bit nasty to program.

Also, with a little discipline, one can often use fragments of one program
to do the next one.   Be sure to teach about MID$(a$,i,1) kind of stuff (or
whatever your BASIC has for string manipulation).  If there is a LSET A$=
type command available, it can also be very handy along with MID$(A$,I,1)= exp
kind of stuff.  

You can get by without the fancy string stuff, too, but it is handy sometimes.
(Teaching strategy question:  Do you teach string manipulation, or do you
teach them to extract characters, translated to integers, and manipulate
ordinary integer arrays and then translate back to a string?  Or, let the 
students choose?  For some of these "historical" ciphers, translating the input
to the number string A=0, B=1, ...Z=25 is often the key insight.  In other
systems, one can settle for shuffling the strings).

The other systems in the book can also be done and very few of them would
take over 100 lines of BASIC code to do.


-- 
   Larry W. Loen        |  My Opinions are decidedly my own, so please
                        |  do not attribute them to my employer
Newsgroups: sci.crypt
From: ameyer@cbnews.cb.att.com (Andreas Meyer)
Subject: Any ACA members on the net?
Organization: AT&T Bell Laboratories, Holmdel NJ
Date: Mon, 25 Jan 1993 16:34:18 GMT
Followup-To: poster
Summary: message in a bottle

If you're a member of the American Cryptogram Association, 
please reply to this article.

Thanks,
Andy
-- 
    ==--
  -====---    Andreas Meyer, N2FYE                     ahm@hoqas2.att.com
  --==----    AT&T Bell Laboratories, Holmdel NJ        ..!att!hoqas2!ahm
    ----
From: jim@cs.strath.ac.uk (Jim Reid)
Newsgroups: sci.crypt
Subject: Re: Spycatcher
Date: 24 Jan 93 17:11:24 GMT
	<1993Jan23.181520.18783@magnus.acs.ohio-state.edu>
Organization: Computer Science Dept., Strathclyde Univ., Glasgow, Scotland.
In-reply-to: jebright@magnus.acs.ohio-state.edu's message of 23 Jan 93 18:15:20 GMT

In article <1993Jan23.181520.18783@magnus.acs.ohio-state.edu> jebright@magnus.acs.ohio-state.edu (James R Ebright) writes:

   In article <C19KHJ.AuL@csfb1.fir.fbc.com> uunet!csfb1!pjb writes:
   >Sorry, I can't stand it anymore. Will someone please tell me/us
   >some details re: Spycatcher. Author or Publisher and where it
   >was/is available and where it is/was banned ?

   SPY CATCHER The Candid Autobiography of a Senior Intellegence Officer
   By Peter Wright with Paul Greengrass
   Viking Penguin Inc. 40 West 23rd Street, NY, NY 10010 USA
   (c) Peter Wright, 1987
   ISBN 0-670-82055-5
   Lib of Congress Cat Card # 87-40243

   Available everywhere except the UK where it was alleged to violate the
   Official Secrets Act...

This is only partially true. The sale and distribution of this book was
suspended in the UK while the government went to ridiculous lengths to
suppress it. [I can't remember if the government used any statutory
powers or if the publishers held off to avoid prosecution - contempt
of court, the Official Secrets Act, etc - while the case against
Wright was in progress.] The courts eventually threw the Government's
case out because the book's contents were widely known because it had
been published in other countries.

While all this was going on, the book wasn't banned. People could (and
did) import copies. Once the courts gave a final ruling, the book
eventually went on sale in the UK. It was then discredited when Wright
claimed to have made up some of its allegations - like the plot
against then Prime Minister Harold Wilson - so that the book would get
a lot of publicity and generate extra sales.

		Jim
Xref: sparky sci.crypt:7162 alt.security.pgp:604
From: urlichs@smurf.sub.org (Matthias Urlichs)
Newsgroups: sci.crypt,alt.security.pgp
Subject: Re: PGP messages readable by more than one person
Date: 26 Jan 1993 22:35:27 +0100
Organization: University of Karlsruhe, FRG
NNTP-Posting-Host: 127.0.0.1

In alt.security.pgp, article <WARLORD.93Jan25185151@toxicwaste.mit.edu>,
  warlord@MIT.EDU (Derek Atkins) writes:
> In article <1k0d74$92c@smurf.sub.org> urlichs@smurf.sub.org (Matthias Urlichs) writes:
> 
>>   - When extracting a key, I'd like to select which certifications for
>>     that key get exported.
> 
> What do you mean?  What *kind* of certificates?  Signatures?  ID's?
> 
Quoting from pgpdoc1.txt, Extracting a Key fro your Key Ring:

"If the key has any certifying signatures attached to it on your key
 ring, they are copied off along with the key."

Suppose A has certified B's public key and passed it on to C.
C wants to give that key to D without revealing any association
with A.

>    - How do I get pgp -fst/-fsat to not encode the message I want to sign?
> 
> pgp -fsat +clearsig=on
> 
Ah. Thanks.

[ testing ]

... without changing the text at all?
(Lines starting with a minus sign get "- " prepended.)

>    - Thoughts about better MIME integration? The MIME multipart stuff
>      would be a far better idea than these BEGIN PGP lines.
>      Define an "application/pgp" subtype ?
> 
> I've heard people talking about this.  You want to do it?  ;-)
> 
Hmmm... I think the (RI)PEM people have some thoughts and/or an actual
Internet draft someplace, -- whatever they can do, PGP can do also ;-) --
but I have been unable to locate the thing yet.

Most of the necessary code should already exist in the metamail distribution.
Time to reread those MIME RFCs I suppose.  ;-)

-- 
Tech writers come with a manual.
-- 
Matthias Urlichs  --  urlichs@smurf.sub.org -- urlichs@smurf.ira.uka.de   /(o\
Humboldtstrasse 7 -- 7500 Karlsruhe 1 -- Germany  --  +49-721-9612521     \o)/
Newsgroups: sci.crypt
From: schneier@chinet.chi.il.us (Bruce Schneier)
Subject: Generating Quasi-Random Sequences
Organization: Chinet - Public Access UNIX
Date: Wed, 27 Jan 1993 03:05:33 GMT

Santha and Vizirani wrote an article, "Generating Quasi-Random Sequences from
Slightly-Random Sources."  It appeared in 1984 in some IEEE publication.  Does
anyone have the complete reference?

Bruce
Xref: sparky sci.crypt:7145 sci.math:18744
From: djb@silverton.berkeley.edu (D. J. Bernstein)
Newsgroups: sci.crypt,sci.math
Subject: Re: Oh yeah?  Factor this...
Date: 25 Jan 93 22:24:28 GMT
Organization: IR
X-Mail-Warning: Do not reply by mail---silverton not configured yet.

In article <1993Jan20.232616.5748@zip.eecs.umich.edu> gilgalad@quip.eecs.umich.edu (Ralph Seguin) writes:
> 273924503086030314234102342916746862811943643675809146279473679416086\
> 9202622699363433211840458243863492954873728399236975848797430631773058\
> 0753883429460344956410077034761330476016739454649828385541500213920807\
> Can you factor this number [in your lifetime]?

Yes, using the number field sieve and a roughly $10M initial investment.
This is with some rather conservative estimates of number field sieve
asymptotics, economic stability, and my lifetime; I imagine I'd turn a
tidy profit too.

---Dan
Newsgroups: sci.crypt
From: bontchev@fbihh.informatik.uni-hamburg.de (Vesselin Bontchev)
Subject: Re: Any problem with importing IDEA to US???
Reply-To: bontchev@fbihh.informatik.uni-hamburg.de
Organization: Virus Test Center, University of Hamburg
Date: 21 Jan 93 12:07:55 GMT

-----BEGIN PGP SIGNED MESSAGE-----

speth@cats.ucsc.edu (James Gustave) writes:

>  I'm writing an program and I'd like to use the IDEA algorithm for encryption.
> I know that the licensing on IDEA permits it to be used freely for non-
> commercial use.  What I'm wondering is whether there are import restrictions
> on using IDEA in the US?  Are there any other hidden legal problems with it?
>   Also, the only source that I know of for IDEA is from the PGP source
> distribution, and I'd like to avoid the legal problems involved in that.
> Where could I get a good implementation of it??

As far as understand, import/export of -documents- on crypto
algorithms is not illegal. There is a PostScript document, describing
the IDEA, available from our ftp site:

ftp.informatik.uni-hamburg.de:/pub/virus/texts/security/idea.zip

It should be trivial to implement the algorithm from the description.

Regards,
Vesselin

-----BEGIN PGP SIGNATURE-----
Version: 2.1

iQCVAgUBK16YSDZWl8Yy3ZjZAQHfKwP9HEKhSLkW9VxRGfWfsCM06dejIYH35sip
4UKcWGBtwrvdohk3mn5mLco7paOF6AFLXajJhRgr8qocOhyUCSEMVlrLX0MT6NC9
BHd+8BwrMe2V6MexhYxXp+AI1NDyKtk4fL8r5pp/TAXSPNOKWvEPqRNIztXi9V/d
OXG2wx+YxzQ=
=kS7o
-----END PGP SIGNATURE-----
-- 
Vesselin Vladimirov Bontchev          Virus Test Center, University of Hamburg
Tel.:+49-40-54715-224, Fax: +49-40-54715-226      Fachbereich Informatik - AGN
< PGP 2.1 public key available on request. > Vogt-Koelln-Strasse 30, rm. 107 C
e-mail: bontchev@fbihh.informatik.uni-hamburg.de    D-2000 Hamburg 54, Germany
Newsgroups: sci.crypt
From: sv@id.dth.dk (Stig Valentini (920401#PF))
Subject: D2MAC-eurocrypt hardware structure?
Organization: Department of Computer Science
Date: Wed, 27 Jan 1993 14:42:02 GMT

Well, how does it work?... What kind of microcontroller is on
the 'credit-card' which you can buy to receive D2MAC 
satelite TV.. Tech specs anyone ?  What information is
received from the satelite..? Or is it so, that the real
protection lies in that nobody knows anything about the
implementation of the encryption system...?
Could be fun if anybody had information about other hardware
protection types.
Don't get me wrong.. I'm a software-guy - wouldn't dream of
hardware reverse-engineering satelite coders. But I sure am
curious about the technology involved... 
Xref: sparky sci.crypt:7201 alt.security.pgp:612
From: res@colnet.cmhnet.org (Rob Stampfli)
Newsgroups: sci.crypt,alt.security.pgp
Subject: Re: PGP messages readable by more than one person
Date: 28 Jan 93 04:04:19 GMT
Organization: Little to None

>>While we're on the subject of new releases..:
>
>To add my own two problems:

Ditto:

When pgp is invoked (under Unix) with interrupts/quits/hangups ignored, it
should leave them ignored.  This is standard Unix procedure for processes
that potentially can run in the background, and pgp does very well as a
background process in certain modes (except for this).
-- 
Rob Stampfli  rob@colnet.cmhnet.org      The neat thing about standards:
614-864-9377  HAM RADIO: kd8wk@n8jyv.oh  There are so many to choose from.
From: emil@lamisun3.epfl.ch (Emil Laurentiu)
Newsgroups: sci.crypt
Subject: PKZIP 2.04 encryption
Date: 26 Jan 93 22:45:47 GMT
Organization: Ecole Polytechnique Federale de Lausanne

I've heard that pkzip 2.04c has a better encryption technique.
Does anyone know anything about this? If it's a new one can the
2.04c version decript the old zip files?
Also what about that last year pkzip contest. Are there any winners?
Anybody knows about some available pkzip encryption breaking program?

A lot of questions, eh.
-- 
---------------------------------------------------------
Waiting for the war to begin...                      Emil
Newsgroups: sci.crypt
From: oml@eloka.demon.co.uk (Owen Lewis)
Subject: Re: Programs in BASIC please 
Distribution: world
Organization: Eloka Consultancy & Project Management
Reply-To: oml@eloka.demon.co.uk
X-Mailer: Simple NEWS 1.90 (ka9q DIS 1.19)
Date: Fri, 22 Jan 1993 20:18:26 +0000

In article <C17KGp.3tw@world.std.com> jcluett@world.std.com writes:

>Could any of you point me to an encryption program or two,
>written in BASIC that would be suitable for beginners? Security
>is not important. Just looking for some introductory material
>that would be fun and educational for students. 

If you can find one, 'The Radio Hacker's Code Book'is a delight. Author George
Sassoon, published in the UK by Gerald Duckworth & Co Ltd in 1986,
ISBN 0-7156-2068-1. Signal Telegraphy, ASCII, Baudot, FEC/ARQ, Vernam, Vignere,
Enigma, RSA, DES and more.
>
From: jedwards@ms.uky.edu (Jonathan Edwards)
Newsgroups: sci.crypt
Subject: Is N a prime power?
Date: 25 Jan 93 14:04:48 GMT
Organization: University Of Kentucky, Dept. of Math Sciences

I am reading an old paper by Tompa that describes Blum's protocol for
flipping coins by telephone.  The first thing the verifier must do is
verify that a very large (hundreds of digits) number has at least two
distinct prime factors (i.e., that the number is not a prime power).
Tompa gives no hint how to do this and I haven't been able to find anyone
else who knows.  I'd very much appreciate it if someone could explain
how it's done or point me to a paper somewhere...
Newsgroups: sci.crypt
From: oml@eloka.demon.co.uk (Owen Lewis)
Subject: Re: Spycatcher 
Distribution: world
Organization: Eloka Consultancy & Project Management
Reply-To: oml@eloka.demon.co.uk
X-Mailer: Simple NEWS 1.90 (ka9q DIS 1.19)
Date: Tue, 26 Jan 1993 04:05:55 +0000

In article <1993Jan25.182906.9035@netcom.com> strnlght@netcom.com writes:

>particularly fascinating account of how the Soviets installed eavesdropping
>transmitters in the vertical support bar of U.S. typewriters in such a way
>that the workmanship was completely undetectable visually and the bugs had
>the same X-ray density as the support bar and thus didn't show up via
>X-ray. It took newer scanning techniques to spot the anomalies in the
>support bars and lead to the detection of the hidden bugs.

Another case of vapour ware?
If the typewriter was manual, and the bug so well concealed as to fool x-ray 
examination, from whence came its power?

Standard searches for bugs are as follows (in order):
	1. Spectrum scan from 1Khz to at least 2Ghz, while creating an 
activity that should stimulate any bug's activity.
	2. Search with a non-linear junction detector, for those bugs which 
are buried in some other material  and will only transmit on receipt of a 
code signal, also search for bugs inert because their power source is 
depleted/failed. 
	3. Only when 1. or 2. gives a positive return and physical discovery
will necessitate expensive damage is X-ray investigation used.

Off-topic for sci.crypt, I think, but vapour ware is vapour ware where ever 
one finds it.
-- 

                               -= Owen Lewis =-
                                      @
Tele/fax     +44-(0)794-301731      ELOKA       Consultancy & Project Management
                            oml@eloka.demon.co.uk
                        pgp 2.x public key on request
From: cme@ellisun.sw.stratus.com (Carl Ellison)
Newsgroups: sci.crypt
Subject: Re: Wanted: very fast random number generator
Date: 27 Jan 93 19:20:29 GMT
Organization: Stratus Computer, Software Engineering
NNTP-Posting-Host: ellisun.sw.stratus.com

In article <C1H7tG.7At.2@cs.cmu.edu> tgl+@cs.cmu.edu (Tom Lane) writes:
>What I need is a very very fast random number generator; it does NOT need to
>be cryptographically strong.


My favorite fast generator:

#define N_RANS  (65)
#define PRIMERADIX (1073741789)

long int  ran_arr[ N_RANS ] ;
int  ran_rdr = 0 ;


/* --------------------------------------------------------------------- */
/* raw_ran -- compute the next raw random number.			 */
/*	This routine uses only addition.				 */
/* --------------------------------------------------------------------- */

long int raw_ran()
{
    int  nrdr ;
    long int  v ;

    nrdr = ran_rdr + 1 ;
    if ( N_RANS <= nrdr ) nrdr = 0 ;
    v = ran_arr[ ran_rdr ] + ran_arr[ nrdr ] ;
    if ( v >= PRIMERADIX ) v -= PRIMERADIX ;	/* poor man's MOD function */
    ran_arr[ ran_rdr ] = v ;
    ran_rdr = nrdr ;
    return ( v ) ;
}   /* end of raw_ran */

/* --------------------------------------------------------------------- */
/* ran_radix --- return a random integer, radix r.			 */
/* --------------------------------------------------------------------- */

long int ran_radix( r )
long int r ;
{
    return ( raw_ran() % r ) ;
}   /* end of ran_radix */


You should fill the ran_arr with true random numbers, but I sometimes
use a typed string and then ask for (N_RANS)**2 raw_ran() values
before using a real one.

--Carl

-- 
-- <<Disclaimer: All opinions expressed are my own, of course.>>
-- Carl Ellison						cme@sw.stratus.com
-- Stratus Computer Inc.	M3-2-BKW		TEL: (508)460-2783
-- 55 Fairbanks Boulevard ; Marlborough MA 01752-1298	FAX: (508)624-7488
Newsgroups: sci.crypt
From: tucker@fisher.eedsp.gatech.edu (Jeff Tucker)
Subject: PGP for Sun needed
Organization: Georgia Institute of Technology
Distribution: usa
Date: Wed, 27 Jan 1993 21:52:31 GMT

Does anyone have PGP 2.1 compiled and running for the Sun 4 (Sparc) who
would give me a copy of the executable.  

I got the sources, and they seem to compile.  However, I get a run-time
error when I try to generate the first key.  Something about bad ioctl
when it asks me what key length.

Instead of beating my head over this, I hope that I can just get a 
running version from someone.

Thanks 
Jeff
-- 
-----------------------------
Jeff Tucker    ()<                  N9HZQ
tucker@eedsp.gatech.edu             Graduate Student, Electrical Engineering
W4AQL Contest Domination Team       Georgia Institute of Technology
                   -PGP Key Available On Request-
From: pdc@dcs.ed.ac.uk (Paul Crowley)
Newsgroups: sci.crypt
Subject: Re: Something about cryptology
Date: 21 Jan 93 11:47:09 GMT
Reply-To: pdc@dcs.ed.ac.uk (Paul Crowley)
Organization: Edinburgh University

Quoting cliftonr@netcom.com (Pope Clifton) in article <1993Jan19.222030.16193@netcom.com>:
>
>moreover, there is no sign of
>any improvements on the horizon, and there seem to be essentially no
>mathematicians or computer scientists who believe that P = NP.

Not quite; there was a debate on the subject in comp.theory, and many
of those posting were far from certain that P!=NP.  One lot are even
working towards an O(n^6) algorithm for the Subset Sum problem using
linear programming, based on the Gismondi and Swart paper "N=1".
  __                                  _____
\/ o\ Paul Crowley   pdc@dcs.ed.ac.uk \\ //
/\__/ Trust me. I know what I'm doing. \X/ 
Newsgroups: sci.crypt
From: exudnw@exu.ericsson.se (Dave Williams)
Subject: Re: Zimmermann's responses to Sidelnikov's
Reply-To: exudnw@exu.ericsson.se
Organization: Ericsson Network Systems
Date: Mon, 25 Jan 1993 19:39:14 GMT
X-Disclaimer: This article was posted by a user at Ericsson.
              Any opinions expressed are strictly those of the
              user and not necessarily those of Ericsson.

In article 727986636@unixg.ubc.ca, unruh@unixg.ubc.ca (Bill Unruh) writes:
>In <1993Jan25.115302.27951@cas.org> jac54@cas.org () writes:
>
>>	Polaris tests (late 50's-early 60's).  How many stories of
>>	U.S. astronauts being lost in flight can you remember.  I can
>>	remember one, and that had to do with faulty plumbing.
>
>In flight none before the Shuttle. On Launchpad ( not during a launch but
>during a dry run) three, in an Apollo capsule fire. (Grissom,,, and the two 
>others I can't remember).

...White and Chaffee (sp?) were the other 2 (my *memory* anyway).

---
= exudnw@exu.ericsson.se                                                =
= David Williams              "You can't win, you can't break even,     =
= Ericsson Network Systems     and you can't quit"                      =
= Richardson, TX 75081                                  my opinions...  =

Newsgroups: sci.crypt,alt.security.pgp
From: warlord@MIT.EDU (Derek Atkins)
Subject: Re: PGP messages readable by more than one person
Organization: Massachusetts Institute of Technology
Date: Mon, 25 Jan 1993 02:38:37 GMT


PGP 2.2 *WILL* have multiple-recipient encryption!  The code is done.
The patches are in.  All that's needed is a 2.2 release to happen!

-derek

PGP 2 key available upon request, or via AFS:
	/afs/athena.mit.edu/user/w/a/warlord/pgp-pubkey.asc
--
  Derek Atkins, MIT '93, Electrical Engineering and Computer Science
      Chairman, MIT Student Information Processing Board (SIPB)
           MIT Media Laboratory, Speech Research Group
           warlord@MIT.EDU       PP-ASEL        N1NWH
Newsgroups: sci.crypt,alt.security.pgp