HDTenEightyP/NetNews huggingface dataset:
From: jwh@cs.bham.ac.uk (James Hawtin)
Newsgroups: sci.crypt
Subject: RSA (patent? can I have a copy)
Keywords: RSA groan not again.....
Date: 22 Jan 93 11:30:10 GMT
Reply-To: jwh@cs.bham.ac.uk
Organization: School of Computer Science, The University of Birmingham, UK

Is RSA patented in the US or copyrighted? The reason I ask is a lecturer here who does
a course on patents is interested it having a look at the patent. I don't what to
talk about the legal problems etc etc etc,I just would like to get a copy of the docs,
can someone send me a copy? I will pay if need be.


			James.
Newsgroups: sci.crypt
From: jebright@magnus.acs.ohio-state.edu (James R Ebright)
Subject: Re: Spycatcher 
Organization: The Ohio State University
Date: Sat, 23 Jan 1993 18:15:20 GMT

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 ?
>
>cheers,
>	paul

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...

For a full discussion of the legal aspects see...
The SPY CATCHER TRIAL the Scandal behind the #1 Best Seller
by Malcolm Turnbull
Salem House Publishers
462 Boston Street
Topsfield, MA  01983  USA
(c) 1988 Malcolm Turnbull
ISBN 0-88162-422-5
Lib of Congress Cat Card # 88-37126

Both books are great reads!  (Ever wonder why regular typewriters are
not used to type crypto messages...Read SPYCATCHER for that and much more.)

Wright was a senior officer who told nothing he thought was really secret...
but MI5 disagreed.

Check it out!
-- 
		Jim Ebright (james.ebright@osu.edu) 
		   Heisenberg may have been here.
    Fax # 614-785-0292.  Tel # 614-785-0282.  Beeper # 614-646-1093
     >>>    All kids can be educated -- even yours and mine.    <<<
Newsgroups: sci.crypt,sci.math
From: gtoal@pizzabox.demon.co.uk (Graham Toal)
Subject: Re: RSA cracked? I don't think so..., HUGE primes?
Organization: Cuddlehogs Anonymous
Distribution: na
Date: Thu, 21 Jan 1993 11:35:39 GMT

In article <1993Jan21.070521.9787@netcom.com> rcain@netcom.com (Robert Cain) writes:
:I'll be corrected if not :-)  The probibalistic test can be iterated
:for an arbitrarilarily high theoretical probability that one is prime.
:Well, I know that one is prime, you understand what I mean. :-)

"Oh no it isn't!" :-)

G
Newsgroups: sci.crypt
From: patlak@med.uvm.edu (Joe Patlak)
Subject: re: Public Key Depository
Organization: University of Vermont -- Division of EMBA Computer Facility
X-Newsreader: Tin 1.1 PL5
Date: Sat, 23 Jan 1993 03:06:16 GMT


Vasselin Bontchev recently asked if DNS mechanisms could be used to
distribute public keys.

Would it not be equally acceptable to put your public key in a .plan
file so that it would be listed by the finger program.  If you need a
public key from an individual who's machine you know, finger 
individual@machine would deliver it to you.

This seems to work locally (my own tests).  For example try
finger patlak@salus.med.uvm.edu  [not much security in this example since
this particular key is signed only by myself, but still...] 

 --
Joe Patlak			    patlak@salus.med.uvm.edu
Department of Physiology
University of Vermont		    (802) 656-8912
Burlington, VT 05405
Newsgroups: sci.crypt
From: johnt@ee.ubc.ca (John Jay G. Tanlimco)
Subject: Cipher Breaking Code (was: Cracking Software)
Organization: University of BC, Electrical Engineering
Date: Wed, 27 Jan 1993 17:53:29 GMT


In article <1993Jan20.191452.1337@ee.ubc.ca> johnt@ee.ubc.ca (John Jay G. Tanlimco) writes:
>
>    Is there an ftp site for source codes of cracking software?
>I read the FAQ (from some site) and didn't see any mention of it.
>The document I have is dated Nov. 91 (too old) and is a preliminary
>FAQ.  Does anyone have a more recent version?

I posted the above message last week and got no response.  I think I may
have worded my request erroneously.  What I want are source codes to 
break ciphertext.  I think my use of the word "cracking" may have people 
thinking of breaking a computer systems password file, which is not what 
I want.

If you know of any FTP site, or if you have some source code that 
demonstrate techniques used in code breaking, please email.   Thanks.


-- 
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
John Jay Tanlimco | University of British Columbia  | #$%!#^H&*(()_4|&^$M#}!@
johnt@ee.ubc.ca   | Dept. of Electrical Engineering | @{$%8&*()!M#$%^&*()_=!S
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Newsgroups: sci.crypt
Subject: Toggle rot-13 decode..
From: ribarbe@eis.calstate.edu (Richard Eldon Barber)
Date: Wed, 27 Jan 1993 01:31:02 GMT
Organization: Calif State Univ/Electronic Information Services

This system has an option:
        %, ^X   Toggle rot-13 decoding for this article
when viewing a piece of news.  Is this encryption?  Are there programs
available for macintosh or pc's to encode?
email ribarbe@eis.calstate.edu
---rick
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
	<WARLORD.93Jan24213831@snorkelwacker.mit.edu>
	<1k0d74$92c@smurf.sub.org> <C1Fqq9.1wG@ux1.cso.uiuc.edu>
Date: Tue, 26 Jan 1993 20:05:31 GMT

In article <C1Fqq9.1wG@ux1.cso.uiuc.edu> meyer@ux1.cso.uiuc.edu (Don Meyer) writes:

   To add my own two problems:
   1) The OS/2 port refuses to accept input from stdin, for stuff like "Y/N" 
   prompts this would be nice for those of us developing shells.  (I have my
   suspicions why direct keyboard input is required to create the random 
   seed(s), but for ordinary input this shouldn't be necessary.)

this is true on UNIX, too.  That is because the Y/N code opens the tty
to read the values.  I agree that there should be some way to override this.
Which particular cases are you trying to shell around?

   2) Output to a pipe does not work - PGP tries to rename the "file"
   it finds, it cannot, it prompts for a new filename.  (Simply allowing 
   an overwrite option should work wonderfully... preferably as a
   default or a command line parameter.)

What do you mean?  I've never had much problem with this.

-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
From: BUSCHMAN@NDSUVM1.BITNET
Newsgroups: sci.crypt
Subject: News service on CNBC
Date: 28 Jan 93 06:51:10 GMT
Organization: North Dakota Higher Education Computer Network

My Uncle receives news feeds via CNBC over his local cable system.  He plugs hi
s cable line into a special box he purchasedfrom CNBC/FNN and from there it ent
ers his computer via the serial port.  He must run software which was supplied
to view the news arriving.   Now if he looks at the data coming through the por
t with a communications program, the data appears to be encrypted.   He would l
ike to be able to write his own software to select certain news files coming ac
ross and save them to disk.  But the encryption poses a problem.  Is anyone fam
ilar with this system?   If anyone is interested in seeing this raw data, I wil
l surely  mail you a bit.      Thanks   Greg  Buschman@vm1.nodak.edu
Newsgroups: sci.crypt
From: mjohnson@netcom.com (Mark Johnson)
Subject: Actual cost of breaker machine for DES
Organization: Netcom, where you can get Usenet for 19 dollars a month
Date: Wed, 27 Jan 1993 16:57:17 GMT

In article <1jmumhINNe3d@roche.csl.sri.com> boucher@csl.sri.com (Peter K. Boucher) writes:

   > In 1976, given economies of scale, each [custom built DES] Integrated
   > Circuit would cost ~$10 ([therefore] $10M/machine).  Allow a factor of
   > two, for other hardware and you pay $20M/machine.  Amortize costs over
   > 5 years, and you pay $10K/day.
   > [ ... ]
   > These are 1976 figures.  Even if we are optimistic by an order
   > of magnitude, the cost of computation falls in 5 years by a factor 
   > of 10; in 15 years (by now) by 1,000.


But you're talking about chip design, not computation.


Have a look at a hardware budget for your chip, which holds
one copy of DES circuitry.  A swag at such an accounting is
shown below.  It is wrong (optimistic) because it assumes
the cost of the permutations and shufflings is zero, whereas
on silicon, gates are cheap and wires are expensive.

  a.  56 bit register for key bits                        336 gates
  b.  64 bit input register                               384 gates
  c   16 ranks of   32b  register pairs                  6144 gates
  d.  16 ranks of   (32  2-bit-XOR)                      1024 gates
  e.  16 copies of  (32b scramblers using S boxes)        480 gates
  f.  64 bit output register                              384 gates
                                                     -----------------
               TOTAL                                     8752 gates


Your $10-per-chip-in-1976 figure, divided by your "computation
cost reduction factor" of 1000, gives today's cost per chip of
$0.01.  Balderdash! Not in this universe in the year of our lord 1993.

But in today's practice we'd of course use high levels of integration,
putting (say) 32 DES hardware widgets on a single chip.  The
resultant VLSI device would have 280,000 logic gates (about the
complexity of the Intel 486 microprocessor).  Your cost figure
for this device would be $0.32.  Not in this universe in 1993.

Hire some genius to optimize the holy snot out of the hardware,
assume Allah is on your side and the gate count drops by 4X.
Now you can get 128 DES widgets on an i486 sized chip and
you pay the silicon fab $1.28 for this IC.  Good luck Mr. Phelps.


   --- Mark Johnson
Newsgroups: sci.crypt,alt.security.pgp
From: alexb@minerva1.bull.it (Alessandro Bottonelli)
Subject: Re: Deaf and dumb PGP daemons.
Organization: Bull Italia SpA
Date: Sat, 23 Jan 1993 21:34:25 GMT

pcl@ox.ac.uk (Paul C Leyland) writes:


>The following request might sound sacrilegious to some, but please
>bear with me.

>I wish to use PGP as a filter on the input and/or output of daemons.
>I assume that the daemons are running on physically secure machines
>running trusted software and with only trusted users logged into them.
>However, I *cannot* assume that the network joining the machines is in
>any way secure.  What I can do is to include timestamps within the
>plaintext (to hinder playback attacks); encrypt it (to foil snoopers);
>checksum it (to prevent in-flight modification) and sign it (to stop
>spoofers).  PGP allows me to do the hard bits of this without me
>writing any fresh code.

>I like PGP as an encryption service, but what I can't abide is its
>incessant chattiness.   .....

At least the encryption part of it is quite possible with the vanilla
version of PGP2.1 as compiled fresh after an FTP from one of those sites
that carry it. I had the requirement of encrypting COPS reports sent
via e-mail to me from various machines (just because COPS reports may
contain info useful to a would-be attacker) and in the cops script
I did something like this:

       cat $REPORT | pgp -eaf $USER_PUBKEY | mailx -s"cops report" $USER

Too simple or am i missing something ?

Hope this helps unless I have completely misunderstood your requirements.


-- 
== Alex Bottonelli / Bull Italia BSP  | FAX  : +39-(0)2-6779/8463           ==
== I.S./W.S./Network Security Officer | PHONE: +39-(0)2-6779/8324           ==
== E-MAIL: A.Bottonelli@it12.bull.it  | (BullCom users dial 260+extension)  ==
== BULLTX: /BULLX/IT12X/BOTTONELLI A. | PGP Public Key available on request ==
Newsgroups: sci.crypt,alt.security.pgp
From: smb@research.att.com (Steven Bellovin)
Subject: Re: PGP messages readable by more than one person
Date: Mon, 25 Jan 1993 16:23:51 GMT
Organization: AT&T Bell Laboratories

In article <1993Jan24.213350.17257@news.cs.indiana.edu>, Marc VanHeyningen <mvanheyn@whale.cs.indiana.edu> writes:
> An interesting generalization of the above is how to cryptographically
> create a situation whereby any m people in a group of n (of course,
> the problem is only hard when n > m > 1) must cooperate to read a
> message.  I seem to recall having heard that it's possible, but I
> don't remember the details.

I suspect you're thinking of

@article{sharesecret,
   author = {Adi Shamir},
   journal = {Communications of the ACM},
   number = {11},
   pages = {612-613},
   title = {How to Share a Secret},
   volume = {22},
   year = {1979}
}

This relies on polynomial interpolation.  If you're missing even one
piece of the shared key, all possible values become equally likely.

A totally different way to solve the same problem is given in

@article{sealing,
   author = {David K. Gifford},
   journal = {Communications of the ACM},
   number = {4},
   pages = {274--286},
   title = {Cryptographic Sealing for Information Secrecy and Authentication},
   volume = {25},
   year = {1982}
}

Gifford shows how to use a combination of symmetric and asymmetric
cryptography to implement things like Key-And, Key-Or, the problem
described above, etc.
Newsgroups: sci.crypt
From: smb@research.att.com (Steven Bellovin)
Subject: Re: RSA (patent? can I have a copy)
Date: Fri, 22 Jan 1993 14:18:23 GMT
Organization: AT&T Bell Laboratories
Keywords: RSA groan not again.....

In article <C196MB.Gtp@cs.bham.ac.uk>, jwh@cs.bham.ac.uk (James Hawtin) writes:
> Is RSA patented in the US or copyrighted? The reason I ask is a lecturer here who does
> a course on patents is interested it having a look at the patent. I don't what to
> talk about the legal problems etc etc etc,I just would like to get a copy of the docs,
> can someone send me a copy? I will pay if need be.

RSA is patented in the U.S.  It's patent number 4,405,829.  Within the
U.S., at least, one can get a copy of any patent for $3 by writing to
the patent office.  I have no idea how one would get one from abroad.
You might want to check with the U.S. Consulate.

Btw, patents are not copyrighted; they may be reproduced freely.
Newsgroups: sci.crypt,alt.radio.scanner
From: mleech@bnr.ca (Marcus Leech)
Subject: Re: What is spread spectrum (Was Re: AT&T news release)
Organization: Bell-Northern Research, Information Techology Division
Distribution: usa
Date: Fri, 22 Jan 1993 14:58:05 GMT

In article <1993Jan20.233931.268@gems.vcu.edu>, hleaves@gems.vcu.edu writes:
|> I know what frequency hopping is, but what is "spread spectrum"? Are they the
|> same thing?
|> 
Frequency hopping is a form of spread spectrum that hops the carrier among
  several discrete frequencies based on some pseudo-noise (PN) sequence.

The more modern technique, especially for data, is to use "direct-sequence"
  spread spectrum in which the carrier is spread in frequency directly by the
  data.  The typical implementation is to use a high-speed clock that is some
  large (10-100X) multiple of the data rate, and use this clock to read out a PN
  sequence, XOR this PN sequence with your data, and use that
  signal to phase-shift your carrier. The occupied bandwidth of such a signal
  (how much it's spread) is a function of the rate at which the carrier is
  phase shifted.

Once you've synchronized at the receiving end [this is where spread-spectrum
  gets "interesting"], you "despread" the carrier using the same phase-shifting
  technique you used to spread it.

Good books on the Topic are "Spead Spectrum Systems", by Dixon. And the
  ARRL spread-spectrum sourcebook.

-- 
Marcus Leech, 4Y11             Bell-Northern Research  |opinions expressed
mleech@bnr.ca                  P.O. Box 3511, Stn. C   |are my own, and not
ml@ve3mdl.ampr.org             Ottawa, ON, CAN K1Y 4H7 |necessarily BNRs
Xref: sparky sci.crypt:7083 sci.math:18634
From: norm@netcom.com (Norman Hardy)
Newsgroups: sci.crypt,sci.math
Subject: Re: Oh yeah?  Factor this...
Date: 22 Jan 93 07:27:13 GMT
Distribution: na
Organization: Netcom Online Communications Services (408-241-9760 login: guest)

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]?  If so, you may be
>elligible to win a prize for extreme cleverness.  What sorts of methods

Suppose that I wanted to discredit RSA by spreading the false rumor that
someone was able to factor 200 digit numbers. I would select a prime of 92
digits and another of 108 digits, compute their product, z, and publish a
challenge to factor z. Under another name I would publish the factors.

If someone can factor such numbers and wants it to be known that she can, then
the skill can be demonstrated by factoring some large number that she has not
selected by virtue of already knowing its factors. I propose z = 10^200+3.
z is composite yet not divisible by numbers less than 10000.
The challenge is to factor z.  (10^200+1 is divisible by 17.)
z may have several factors just beyond 10000 which would decrease the glory
of a complete factoring. Another challenge would be in order in that
unlikely case.
Newsgroups: sci.crypt,alt.security.pgp
From: gtf1000@cus.cam.ac.uk (G.T. Falk)
Subject: PGP messages readable by more than one person
Organization: U of Cambridge, England
Date: Sat, 23 Jan 1993 19:22:39 GMT

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

Dear cryptographers and PGP enthusiasts,

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? E.g. if you had a mailing
list and wanted anybody on the list to be able to read the message, they
could, without having to send out individually encrypted messages to
everybody.

I was thinking about this a little more and I figured out how it could
be done. The next version of PGP could easily be made to support this
feature.

Here's how PGP works when Alice is encrypting a message to Bob, in
brief. IDEA is the conventional single-key encryption system used by
PGP. Alice generates a random IDEA key (the "session key") and encrypts it
using RSA and Bob's public key. This is then sent along with
the conventionally-encrypted message so that Bob can obtain the
session key with RSA and then decrypt the message.

For a mailing list, it would work similarly. There would be only ONE
session key generated by Alice, and it would be encrypted ONCE FOR EACH
RECIPIENT (Bob, Clarence, David &c.) of the message, using each person's
public key. Then all of these encrypted versions of the session key are
sent along with the conventionally-encrypted message, in one file. As each
encrypted key is relatively small this would be much more efficient than
sending a different version of the message to Bob, Clarence, David.

When receiving the message, Clarence (say) would find the appropriate
encrypted version of the session key, decrypt it and recover the message.
Edward, who was not an intended recipient, cannot read any of the three
encrypted session keys, and hence cannot read the message.

This feature would be valuable enough to warrant its inclusion in any
future versions of PGP. (I have many criticisms and suggestions to improve
PGP but this message is not the place for such suggestions).


Geoffrey T. Falk <gtf1000@cus.cam.ac.uk>

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

iQBVAgUBK2GaeTQRcjh0adt3AQG+fQH+I91CgxOFNSc2cbcdegNFLgEh1vu9rIQ8
hYUxjZit2o2aRQ8khd3/yqDcYBPAaodUHjLGc+GE+eRhQU+k6ru9wA==
=W4u9
-----END PGP SIGNATURE-----
Newsgroups: sci.crypt
From: herman@nosc.mil (John W. Herman)
Subject: Re: DES (Was: Re: 800MHz
Organization: Naval Ocean Systems Center, San Diego, CA
Date: Fri, 22 Jan 1993 01:10:56 GMT

boucher@csl.sri.com (Peter K. Boucher) writes:

>cbbrowne@csi.uottawa.ca (Christopher Browne) writes:

*** Stuff deleted ***

>So, 512-bit RSA keys aren't looking so great anymore.  1024-bit
>keys seem barely adequate in this light.  2K- to 3K-bit RSA keys
>seem prudent to protect any data that you are seriously 
>concerned might be attacked by a big-budget ($25G) enemy.

Despite what Peter said above, $25G programs are not easy to start
or stop, witness the AIDS research effort.  That effort is still
ramping up and, despite the great political pressure, already has
more money appropriated than can be wisely spent.  That situation
is much like the defense buildup in the early 80's.  More dollars
than sense.  A group with $25G to spend would have the same problem,
years and years before a solution would be available.  With that
level of funding, mathematicians would have to be trained and
algorithms developed.  There would also need to be a period for
ramping down of the effort and the money to pay for it.  The
result of the effort would likely eliminate RSA (or DES or whatever)
as an encruption technique. In all of its years of existance, it is
unlikely that NSA has spent more than $50G or $60G on this problem,
though that is only a guess on my part.  They have got lots of other
irons in the fire, and so do the French, and so does the medical
community.
Also, regarding the French Intelligence Service, my understanding from
newspapers is that if they come across something in the pursuit of their
mission that would be useful to their industrial service, they will
share the information with them.  Industrial intelligence is not a
primary mission.
From: unruh@physics.ubc.ca (William Unruh)
Newsgroups: sci.crypt
Subject: Re: Zimmermann's responses to Sidelnikov's
Date: 23 Jan 1993 00:40:06 GMT
Organization: The University of British Columbia
Distribution: world
NNTP-Posting-Host: physics.ubc.ca

dmandl@shearson.com (David Mandl) writes:

>If I remember correctly, it was an error exactly like this that
>blew up a U.S. rocket (complete with astronauts) back in the '70s.

But this never happened- the only astronauts killed were in a launchpad
fire in the capsule. (before the shuttle that is) Another Urban
Ledgend?
From: fraserdt@unixg.ubc.ca (David T.S. Fraser)
Newsgroups: sci.crypt
Subject: Re: Spycatcher
Date: 25 Jan 93 16:22:58 GMT
Organization: The University of British Columbia
NNTP-Posting-Host: unixg.ubc.ca

In <1993Jan25.154016.10434@cas.org> jac54@cas.org () writes:

>In article <1993Jan23.181520.18783@magnus.acs.ohio-state.edu> jebright@magnus.acs.ohio-state.edu (James R Ebright) writes:
>>
>>Both books are great reads!  (Ever wonder why regular typewriters are
>>not used to type crypto messages...Read SPYCATCHER for that and much more.)

>	That's regular ELECTRIC typewriters, regular manual typewriters
>	are very popular with the security-conscious.

Same goes for PCs, too.
>>
>	Alec Chambers
-- 
-------------------------------------------------------------------------------
                       David Fraser | fraserdt@unixg.ubc.ca
     University of British Columbia | Vancouver, BC, Canada.
-------------------------------------------------------------------------------
Newsgroups: sci.crypt