HDTenEightyP/NetNews huggingface dataset:
From: annan@vax.oxford.ac.uk
Newsgroups: sci.crypt
Subject: Re: Quantum cryptography: a flawed premise?
Date: 13 Oct 92 10:24:44 GMT
Organization: Oxford University VAX 6620

In article <BvzrDD.D63@access.digex.com>, jthomas@access.digex.com (Joe Thomas) writes:
> In article <141@lorien.OCF.LLNL.GOV> pearson6@llnl.gov writes:
>>One thing bothers me, though, and I wonder if it bothers anybody else.
>>Explanations of the technique's strength rely heavily on the
>>fact that measurements made on a single photon cannot possibly give
>>a complete knowledge of its original state of polarization.
>>While this basic fact is true, the articles seem not to consider the
>>possibility of "amplifying" the photon into a large number of identically
>>polarized photons, and then making many independent measurements on those
>>duplicate photons, from which the original state of polarization can
>>indeed be deduced with the necessary precision.
> 
> You quite correcly state that photons can be "amplified" or "cloned" 
> in the process of stimulated emission.

Quoting from a paper by Ekert and some others:

"According to quantum theory ..[making a copy of the carrier of information]...
cannot in general be completed. Quantum cloning will give a positive result
leaving the state of the original intact only if the adversary knows in advance
that the carrier of information is in a quantum state picked from a particular
set of orthonormal states."

This would seem to rule out the possibility of eavesdropping by cloning.

I'm no expert on this: perhaps someone out there who is could give the last
word?

-- 
James Annan.
                [--------------------------------------]
                [  "The only good Tory is a lavatory"  ]
                [--------------------------------------]
Newsgroups: sci.crypt
From: books@fsunuc.physics.fsu.edu (Roger Books)
Subject: An apology to people who have emailed me about keys
Organization: FSU nuclear physics
Date: Wed, 7 Oct 92 20:10:14 GMT

My hard drive crashed (actually, the stoned virus and Stacker ate it.) So
I have not returned any messages about keys, or anything else actually.  I
will have to download PGP again and generate a new key.  I'm sorry if I 
annoyed anyone with this but there was not much I could do about it.

This is what I get for FTP'ing stuff for people on my PC.

Roger
books@fsunuc.physics.fsu.edu, no key currently.
Xref: sparky sci.crypt:3830 alt.security:4587
From: robjohn@ocdis01.UUCP (Contractor Bob Johnson)
Newsgroups: sci.crypt,alt.security
Subject: Re: Letter Frequency
Date: 16 Oct 92 14:16:58 GMT
Followup-To: sci.crypt
Organization: Tinker Air Force Base, Oklahoma

In article <1992Oct15.145339.2020@fid.morgan.com> sethb@fid.morgan.com (Seth Breidbart) writes:
>>  grep -i e /usr/dict/words | wc
>Exercise for the reader: Identify two errors in the methodology.

1. A dictionary is not representative of actual usage.
2. Method gives a count of words which contain each letter, not letter freq.
3. The list isn't sorted.
4. Most dictionaries only contain root words - prefixes and suffixes are
   added "on the fly" by spelling check programs.

I cat'd together a bunch of "literary text" files - mostly FAQs and newbie
user intro-type files, then processed them to get the following frequency
distribution (note--I left in some of the more interesting punctuation, as
data points).  The test file was approx 1.6 Mbytes long.  Notice that it is
close, but not exactly like the ETOAINSHRDLU textbook example.  Does anyone
know what text was processed to obtain "ETOA.."?  I've heard it was the King
James Bible...

135371 e
104724 t
 89790 o
 86114 s
 85248 i
 85108 a
 82427 n
 77557 r
 46744 l
 45641 c
 42668 d
 39717 h
 39670 u
 35381 m
 26481 p
 24558 f
 23687 .
 20622 y
 20506 b
 19928 g
 15028 w
 13939 v
 12975 ,
 10180 -
  7349 k
  3971 x
  3230 "
  3170 )
  3135 :
  2964 (
  2746 q
  1879 '
  1695 j
  1039 z
   854 ?
   539 !
Newsgroups: sci.crypt
From: lewis@aera8700.mitre.org (Keith Lewis)
Subject: Re: FAQ, anyone?
Organization: The MITRE Corporation
    <1992Oct9.080112.26429@unislc.uucp>
Date: Fri, 9 Oct 1992 13:32:43 GMT

In article <1992Oct9.080112.26429@unislc.uucp>, erc@unislc.uucp (Ed Carp) writes:
>Instead of posting questions asking "where is PGP 2.0?" why don't you use
>archie and look it up?

Where is archie?

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.
From: unruh@unixg.ubc.ca (Bill Unruh)
Newsgroups: sci.crypt
Subject: Re: DES generates A_(2^64)?
Date: 16 Oct 1992 05:34:38 GMT
Organization: The University of British Columbia
Distribution: world
NNTP-Posting-Host: unixg.ubc.ca

phr@telebit.com (Paul Rubin) writes:

>I heard that someone in Eastern Germany recently proved a stronger
>result, that DES generates the alternating group on 2^64 letters.

What is the "alternating group"? Does this mean that for any two 64 bit
words, x and y, there exists some sequence of DES transformations that
take x into y?, or that for any 1-1 onto mapping from the set of all {x}
to itself, there exists a sequence of DES which generates that mapping
(ie, that the DES group contains 2^(2^64) elements)?



Xref: sparky sci.crypt:3814 alt.security:4578
From: kornele@a.cs.okstate.edu (KORNELE BRYAN WAYN)
Newsgroups: sci.crypt,alt.security
Subject: Re: Letter Frequency
Date: 15 Oct 92 18:15:30 GMT
Organization: Oklahoma State University

> I'm in dire need of a letter frequency chart for the English language.  I
> remember as a kid reading books on basic cryptanalysis and seeing these
> charts of the most frequently used letter (like "E" is most often used,
> then "S" or "R" or something, etc).  I don't remember the order, but now
> I need it.  Anyone got a copy of a table of something like this online?
> 
> If not, got a source where I can go look it up quick?
> 
I am pretty sure that James A. Storer's book "Data Compression:
Methods and Theory" (1988) has it in the Appendixs.  


Bryan Kornele
Xref: sparky sci.crypt:3739 comp.unix.dos-under-unix:113 comp.unix.msdos:1053 comp.lang.c:14872
From: dalessan@clam.rutgers.edu (he who kicks puppies)
Newsgroups: sci.crypt,comp.unix.dos-under-unix,comp.unix.msdos,comp.lang.c
Subject: Crypt to C?
Date: 13 Oct 92 05:25:02 GMT
Followup-To: sci.crypt
Organization: Rutgers Univ., New Brunswick, N.J.

Is there a version of unix crypt available for dos(ansi C)?
Could someone explain the algorithm used?

Any and all info appreciated.


GD
Newsgroups: sci.crypt
From: melody@grad00.math.ncsu.edu (Patrick Melody)
Subject: Re: Quantum cryptography: a flawed premise?
Organization: NCSU Mathematics Dept.
Date: Wed, 14 Oct 1992 19:59:19 GMT

In article <1992Oct13.142639.1@zodiac.rutgers.edu> leichter@zodiac.rutgers.edu writes:
>In article <1992Oct13.061724.25758@netcom.com>, rcain@netcom.com (Robert Cain)
>writes:
>| 
>Why?  How do you think Alice sends the photons to Bob in the first place?
>Do you think they can only be propagated in a vacuum, with no mirrors,
>lenses, or other objects in the way?  If so, this is hardly a very useful
>system.
>
>You should be able to transmit these photons through a fiber (which
>contains them by total internal reflection) without losing the important
>information.  The fiber can be wrapped into a ring; you need an optical
>switch to get it into the ring at the start, and out at the end, but
>such things exist.
>
Fiber transmission is out, (at least currently), because fiber transmission
involves the photon reflecting off the insides of the fiber many times   
during its trip, and each time it does this it could change its polarization.
The Discover article mentioned this.

.sigs .sigs, we don't need no stinking .sigs!

Newsgroups: sci.crypt
From: lcmyu@crypto2.uwaterloo.ca (Luis Ola Toshio Chi-Ming)
Subject: Re: How secure is this encryption scheme?
Organization: University of Waterloo
Date: Wed, 14 Oct 1992 21:14:21 GMT

In article <Bw1614.2tM@vcd.hp.com> egurney@vcd.hp.com (Ed J. Gurney) writes:
>[...]
>My question is this:  Assuming you know for a fact that a certain eight
>bytes of encrypted data decrypt to a known set of eight plaintext bytes,
>can you find the original key and decrypt the rest of the data?  The only
>information you have is the decryption routine written in C, the eight
>encrypted bytes, and the eight plaintext bytes.  The decryption routine
>is _not_ the same routine used for encryption.  (i.e., feeding the plaintext
>and a key to the decrypter does not generate the encrypted data.)
[..]
>If it matters, the decryption algorithm consists of the routine to generate
>a 32 byte "subkey" from the original 8 byte key and another routine with an 
>8-cycle loop that exclusive ors, rotates left and adds byte-sized
>operands.

>Any thoughts, comments, or ideas would be greatly appreciated.


Your encryption idea sounds like an iterative block cipher of length
64 bits. It iterates/mixes cryptographically weak functions to form a 
(hopefully) strong function.  As for your question, with only one 
sample plaintext/ciphertext pair you'll have most people beat with
a very simple algorithm.  However, the generally accepted test for
such ciphers allow more freedom to the cryptanalyst.  The cryptanalyst
would likely have more blocks of plaintext/cipher text pairs to
work with; in addition access to the encryption routine as well.

You should check that your cipher is strong against differential 
cryptanalysis since any useful block ciphers these days are.

You should refer to papers by Bilham and Shamir[Crypto90] for details.  
The basic idea is to examine how differences in input propogate
through your function.  The notion of difference in your case may
be the xor.  If under fixed input differences, your output difference
is not uniformly distributed then your function may be prone to
this form of attack.

Luis

%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%
| Luis Toshio Yu                  | "Now, if only I have something clever to  |
% lcmyu@crypto2@uwaterloo.ca      % say about that..." :-)                    %
% Electrical Engineering          % Opinions expressed here are mine, so      %
| University of Waterloo, Ontario | credit me for your happiness.             |
%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%=%







Newsgroups: sci.crypt
From: schneier@chinet.chi.il.us (Bruce Schneier)
Subject: Re: Need a journals address
Organization: Chinet - Public Access UNIX
Date: Mon, 12 Oct 1992 05:29:00 GMT

The Journal of Cryptology is published by Springer-Verlag.  Their address
is:  175 Fifth Ave, NY, NY, 10010.  Subscriptions are $95/year.  Send
subscription money to:  Springer-Verlag New York Inc., Service Center
Secaucus, 44 Hartz Way, Secaucus, NJ, 07094.

Bruce
Newsgroups: sci.crypt,comp.os.os2.apps
From: bosman@fwi.uva.nl (Cor Bosman)
Subject: Re: PGP 2.0 for OS/2
Organization: FWI, University of Amsterdam
Date: Thu, 15 Oct 1992 01:05:00 GMT

fritz@ra.csc.ti.com (Fritz Whittington) writes:

>In article <1992Oct12.211939.27724@Informatik.TU-Muenchen.DE> rommel@Informatik.TU-Muenchen.DE (Kai-Uwe Rommel) writes:
>>[For the readers of the crossposting to comp.os.os2.apps: PGP 2.0 is a
>>popular RSA (public key) encryption software.]
>>
>>After talking about that I intended to make the OS/2 support in PGP 2.0
>>functioning again, I got several requests for executables. They are now
>>available for ftp:
>>
>>Machine:	ftp.uni-erlangen.de	(german site)
>>Directory:	pub/pc/os2/fauern/crypt
>>File:		pgp20os2.zip

>Only one little problem:

>150 Opening data connection for /bin/ls (192.94.94.1,3014) (0 bytes)
>total 1360
>-rw-rw--w-   1 Space     318426 Oct 12 21:25 pgp20os2.zip
>-rw-rw--w-   1 Space     376470 Oct 12 22:29 pgp20src.zip

no, add a detached signature of the original binary.
That way yer 'sure' they're ok. (unless someone has his private key :*)

Cor Bosman

-- 
|bosman@fwi.uva.nl_   //     | Honest Officer , had I known my health      |
|-----------------\\ //AMIGA | stood in jeopardy I would never had lit one.|
|  PE no.1         \\/       |             -MAXIM (of the Hells Angels)-   |
|__________ Quickly Scotty,beam me up.There is no ox..y..ge..._____________|
Newsgroups: sci.crypt
Newsgroups: sci.crypt
Subject: RSA outside the US
From: jsteiner@anwsun.phya.utoledo.edu (jason 'Think!' steiner)
Date: 9 Oct 92 23:31:25 EST
X-Newsreader: Tin 1.1 PL4

please correct me if i'm wrong, but in reading the FAQ my mind started
to boggle & i need to clarify this:

   1. RSA is pretty much a standard in Europe.
   2. it is illegal to export RSA stuff from the US.

now i've always thought the US government was a bit bass ackwards,
but this is just silly.

am i reading this right? if it's true why is export of encryption
schemes so much of a problem? apparently they're already out there.

jason "maybe i should move to the CIS..." steiner

--
 "Y'all ain't from around here are ya?" - The best complement I ever got, 
                                          from a local in Defiance, Ohio
`,`,`,`,`,`,`,`,`,`,`,`,`,`,`,`,`,` jsteiner@anwsun.phya.utoledo.edu ,`,`,`
From: nikb@cix.compulink.co.uk (Nick Barron)
Newsgroups: sci.crypt
Subject: == No Subject ==
Date: 11 Oct 92 22:05:54 GMT
Reply-To: nikb@cix.compulink.co.uk

In Message-ID: <1992Oct1.142348.14622@osf.org>, karger@osf.org writes:

>The British would likely not have broken Enigma during WWII, if the Germans
>had used the system in its theoretically best ways.  Most of the breaks
>came from bad procedures and lazy crypto operators.

This reminds me of the case of the German crypto operator who only ever
used two synchronising sequences - HITLER or his girlfriend's name (which
I forget!).  Apparently he was taken prisoner by the 8th Army, and when the
crypto guys found out, the 8th had to go to *amazing* lengths to let him
escape!!!!

Also, in <BvGDp3.AGt@ux1.cso.uiuc.edu>, kellmeye@ux1.cso.uiuc.edu writes:

>The Naval codes were only infrequently broken, and there was at least one 
>branch of the service (the SS?) whose Enigma codes were NEVER broken during
>the course of the war.

Well, the U-boats (and some of the other naval ops) used a machine with an
extra disc.  And as far as some codes that wer *never* broken, don't be too
sure, as we don't have an FOIA over here (UK).  My father knew one of the 
Bletchley park people and only found out 3 years ago that he was involved!
Newsgroups: sci.crypt
From: karger@osf.org (Paul A. Karger)
Subject: Re: RSA outside the US
Organization: Open Software Foundation
Date: Mon, 12 Oct 1992 17:44:36 GMT

In article <1992Oct9.233126.10429@uoft02.utoledo.edu>, jsteiner@anwsun.phya.utoledo.edu (jason 'Think!' steiner) writes:
|> please correct me if i'm wrong, but in reading the FAQ my mind started
|> to boggle & i need to clarify this:
|> 
|>    1. RSA is pretty much a standard in Europe.
|>    2. it is illegal to export RSA stuff from the US.
|> 

This is not strictly correct.  It is illegal to export cryptographic stuff (including RSA) without first getting an export permit from the State Department. While this is a time-consuming process, it is by no means impossible to get such an export license.  It all depends on who the designated recipient is.

If you were to apply for an export license to sell RSA to Lloyds Bank in the UK, then it would probably be granted (after some months of bureaucracy).  If you wanted to sell it to the Iraqi government, you probably wouldn't get it approved!
(and if you wanted to sell it to BCCI a couple of years ago, you probably would have gotten the license approved, since they were a bank!  No one said the policy was logical.)

I'm not trying to defend the export restriction program, as it is a real pain for any company trying to sell security in the international marketplace.  Most of the rules also seem to be locking the barn door long after the horse was stolen.

However, it is possible to export cryptographic equipment from the US.   It is only illegal to do so without an export license, and it is possible to get those licenses approved for the right customers.
From: Hal_-_Finney@cup.portal.com
Newsgroups: sci.crypt
Subject: Re: Quantum cryptography: a flawed premise?
Date: Sat, 10 Oct 92 12:41:43 PDT
Organization: The Portal System (TM)

You can't clone photons.  If you could, faster-than-light communication
would be possible through the Bell's theorem experiment.
Newsgroups: sci.crypt
From: etllnfr@eddie.ericsson.se (Lyndon Fletcher)
Subject: Re: .. and these days ??
Organization: Ericsson Cellular Division
Date: Thu, 15 Oct 1992 13:35:48 GMT

In article <1992Oct14.140213.23704@ugle.unit.no> kennethr@idt.unit.no (Kenneth Roar Iversen) writes:
>>
>>The GSM system that is already in small commercial use in Europe uses
>>digital encryption. GSM is a digital cellular system that will cover
>>the whole Europe in a few years. GSM systems from Nokia Telecommunications
>are in commercial use at least in England and Finland.
>>
>>Eero
>
>As far as I know the encryption is applied on the radio-jump (is that what
>it is called in English?). The data is thus in clear on the physical cable
>from the receiver-station and in the switches.
>
GSM pan European Celluar networks will operate over the whole of Europe
eventually. There are small pilot schemes running in most EC countries,
with Germany leading the way with two companies operating fledgling
commercial networks. The GSM standard calls for digital encryption of the
voice channels. Note that this is not new for Europe, the existing analogue
system in Germany is also encrypted. I believe that when implemented the
GSM encryption will exist from the customers handset to the mobile switch.
Beyond the switch is the normal telecom network. PCM traffic on this network
is not (usually) encrypted though the amount of access and expensive equipment
needed to intercept communication on these links will be outside the capabilities of all but governments.

Fletch
From: holland@matt.ksu.ksu.edu (Rich Holland)
Newsgroups: sci.crypt,alt.security
Subject: Letter Frequency
Date: 14 Oct 1992 20:03:54 -0500
Organization: Kansas State University
NNTP-Posting-Host: matt.ksu.ksu.edu

I'm in dire need of a letter frequency chart for the English language.  I
remember as a kid reading books on basic cryptanalysis and seeing these
charts of the most frequently used letter (like "E" is most often used,
then "S" or "R" or something, etc).  I don't remember the order, but now
I need it.  Anyone got a copy of a table of something like this online?

If not, got a source where I can go look it up quick?

Thanks!

-- 
Rich Holland              | INTERNET: holland@matt.ksu.ksu.edu
100 Jardine Terr, Apt A7  | BITNET  : holland@ksuvm
Manhattan, KS  66502-3357 | UUCP    : ...!rutgers!matt.ksu.ksu.edu!holland
char*p="char*p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);}
From: keith.willis@almac.co.uk
Newsgroups: sci.crypt
Subject: mc100.zip (mcrypt)
Date: 13 Oct 92 21:20:25 GMT
Distribution: sci
Organization: ALMAC BBS Ltd



        I have come across an implementation of RSA distributed by a
        company in Wales, UK, which claims to perform RSA encryption
        on the entire file, rather than just on a session key for a
        conventional algorithm.  The program may be common knowledge,
        but it is the first time I have come across it.  It is called
        MCRYPT, and is distributed by a company called Digital
        Crypto as shareware.

        What puzzles me is that encryption is very fast - less than 2
        minutes for a 40k text file using a 250 digit key - but
        decryption is _glacial_ - over 3 hours for the same file on
        the same PC.

        If anyone is interested in looking at this, you may find it
        on a BBS near you - if not drop me a note and I'll email it
        to you.  I believe I can email it to addresses in the States,
        but once there, it may not be exported again...


---
 ~ PQ 2.15 194 ~ Email: keith.willis@almac.co.uk
--
ALMAC BBS Ltd. 0324-665371
Dos based USENET access,  call for details!
Newsgroups: sci.crypt
From: rcain@netcom.com (Robert Cain)
Subject: Re: RSA claims 33 and 37 of U.S. patent 4,405,829
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Date: Wed, 7 Oct 1992 05:46:00 GMT

casper@fwi.uva.nl (Casper H.S. Dik) writes:
: rcain@netcom.com (Robert Cain) writes:
: 
: >It has been pointed out to me that Julius Ceasar used the polynomial
: 
: >	C = M+1(mod n)
: 
: >where M are the alphabet message chunks and n is the size of the
: >alphabet.  For english n=26 which is the composite of the two primes
: >2 and 13 so I believe that prior art (very prior) has been established.
: >Any comments?
: 
: You cannot take a patent apart claim by claim. The patent
: is the combination of the claims, not a mere collection.
: 
: If I combine several well known things for the first time
: and the things have never been used in that combination before,
: I can patent it.
: 

The rule is that you infringe a patent if your object includes anything
fully covered by any one of its claims.  My object infringes only the two
polynomial claims.  If those claims cannot stand I will not infringe the
patent.  Thus my interest in finding prior art that can defeat them.

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

"There are some strings.  They're just not attached."
                                                    Victoria Roberts


                 PGP 1.0 public key available on request.
Newsgroups: sci.crypt
From: magnus@thep.lu.se (Magnus Olsson)
Subject: Re: Every Spy Should Carry a Bible
Organization: Theoretical Physics, Lund University, Sweden
Date: Wed, 7 Oct 1992 09:46:12 GMT

In article <1992Oct7.024837.4565@unlv.edu> flagg@blind-lemon.cs.unlv.edu (Scott Cunningham) writes:
>In article <BvpEx7.7Iq@fulcrum.bt.co.uk> igb@fulcrum.bt.co.uk (Ian G Batten)  
>writes:
> "Suppose I strip off the bottom bit
> "of each sample in a piece of music on CD and replace it with my ideal
> "random bits, and press the CDs.
>
>Why go to all the trouble.  If you really want to make it complex encrypt a  
>short message into decimal characters and use the resulting number as a measure  
>for a piece of non-heat expansive material.  Put this material into a common  
>item and ship.  The receiver removes the material and measures it with an  
>electron microscope, figures out the measure and decodes the message.  

Hah, that's a laugh (unless you only want to encode *really* short
messages, of course)! You seem to have an exaggerated belief in the
accuracy of machining methods. Or have I missed a smiley somewhere? 

Magnus Olsson                   | \e+      /_
Dept. of Theoretical Physics    |  \  Z   / q
University of Lund, Sweden      |   >----<           
Internet: magnus@thep.lu.se     |  /      \===== g
Bitnet: THEPMO@SELDC52          | /e-      \q
Newsgroups: sci.crypt
From: rcain@netcom.com (Robert Cain)
Subject: Re: Quantum cryptography: a flawed premise?
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Date: Tue, 13 Oct 1992 06:17:24 GMT

leichter@zodiac.rutgers.edu writes:
: 
: The attack against the *cryptosystem*, as opposed to the attack against QM,
: goes like this:  The eavesdropper clones the photons and SAVES them - he

How does he do this?  I know of no way to "save" a photon.  Somehow mirrors
would be involved and I think interaction with a mirror would alter the
polarization state.

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

"There are some strings.  They're just not attached."
                                                    Victoria Roberts


               PGP 1.0 or 2.0 public key available on request.
Newsgroups: sci.crypt