HDTenEightyP/NetNews huggingface dataset:
From: fritz@ra.csc.ti.com (Fritz Whittington)
Newsgroups: sci.crypt,comp.os.os2.apps
Subject: Re: PGP 2.0 for OS/2
Date: 15 Oct 92 16:46:57 GMT
Organization: Texas Instruments

In article <1992Oct15.010500.21114@fwi.uva.nl> bosman@fwi.uva.nl (Cor Bosman) writes:
>fritz@ra.csc.ti.com (Fritz Whittington) writes:
>
[ old stuff deleted ]
>
>>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

No, nobody can be sure of anything at all, until he makes them
world-readable, because nobody can *get* them.  (Unless you happen to be
user ID 1 on that machine or a member of the Space grp.)

-- 
Fritz Whittington Texas Instruments, P.O. Box 655474, MS 446 Dallas, TX 75265
    Shipping address: 13510 North Central Expressway, MS 446 Dallas, TX 75243  
fritz@csc.ti.com             Office: +1 214 995 0397     FAX: +1 214 995 6194
Since I am not an official TI spokesperson, these opinions contain no spokes.
Newsgroups: sci.crypt
From: ferret@works.uucp (Dave Ferret)
Newsgroups: sci.crypt
Subject: DES Encryption/ Encrypting more than once.
Date: 12 Oct 92 21:45:43 GMT
Organization: The Works BBS - Informational Archives - Est. 1985

Just a sidenote to 'Hackers' words...

  There are also encryption algorithms that when used to encrypt the 
plaintext over and over and over, will yield the un-encrypted text. (Ie: 
Its a circular encryption -- Sorry, I don't know the correct term here)

Also, the reasons for tinkerig with DES could possibly be for one reason, 
it was claimed 'unreversable' (Right?) and also that its the basis for 
Unix' CRYPT(). 


Dave Ferret (Sysop)                         Inquires to: merk!works!system
The Works BBS - [617] 861/8976                 Informational Archives
From: ahaley@eoe.co.uk (Andrew Haley)
Newsgroups: sci.crypt
Subject: Re: mc100.zip (mcrypt)
Date: 14 Oct 92 17:09:48 GMT
Distribution: sci
Organization: EO Europe Limited, Cambridge, UK
X-Newsreader: TIN [version 1.1 PL6]

keith.willis@almac.co.uk wrote:
: 
: 
:         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.

That's what you would expect if they are using a small encryption
exponent (such as 3 or 65537.)  This is common practice.  Decryption
and authentication require a full length modular exponentiation.

Andrew.
Newsgroups: sci.crypt
From: craig@jido.b11.ingr.com (Craig Presson)
Subject: Re: RSA outside the US
Reply-To: craig@jido.b11.ingr.com
Organization: Intergraph Corporation, Huntsville, Alabama
Date: Mon, 12 Oct 1992 19:01:25 GMT

In article <Vo0isB15w165w@mantis.co.uk> mathew <mathew@mantis.co.uk> writes:
   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.

   Absolutely correct, unless you get official permission for the export.

The rules were recently loosened just a little so that "mass-market"
software packages using RSA's RC2 and RC4 algorithms can be exported
freely, and the review process streamlined for others. They didn't
budge on DES, though. Source: Software Publisher's Association,
Washington DC.
[...]
   However, they do mean that no US company that might compete with Mantis can
   use DES or RSA in products it ships to Europe.  Neat, huh?
You've been warned! Duck!

   mathew
   -- 
   You can communicate with me securely using PGP 2.0.  For more information
   send mail to pgp@mantis.co.uk.

Ditto. Send info to pressonc@ingr.com (I'm moving this week and my
subdomain will change).

-- Craig Presson
New opinions are always suspected, and usually opposed, without any other
reason but because they are not already common. 
                -- John Locke

Newsgroups: sci.crypt
From: rschnapp@metaflow.com (Russ Schnapp)
Subject: Re: Quantum cryptography: a flawed premise?
Organization: Metaflow Technologies Inc.
Date: Tue, 13 Oct 1992 16:03:29 GMT

In article <1992Oct13.061724.25758@netcom.com>, rcain@netcom.com (Robert Cain) writes:
|> 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

Strictly speaking, a stong gravitational field would probably do the trick.
Of course, we're fresh out of quantum black holes at the moment...
-- 

...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!
Newsgroups: sci.crypt
From: bart@netcom.com (Harry Bartholomew)
Subject: Re: FAQ almost an answer 
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
X-Newsreader: Tin 1.1 PL5
Date: Sun, 11 Oct 1992 11:07:29 GMT

Unless I chose a bad time (I tried at 1, 2, and 3:15am) the net line to
vac-bc.wimsey.bc.ca is very slow. crypt.txt.Z took 12 minutes to get.
I have it in /u4/bart as crypttxt.Z with world readable protection set
(I think ). Help yourself.

						Bart
-- 
"Partly it may be due to a phenomenon known since the very dawn of spaceflight
in connection with certain pharmaceutical drugs. They induced adverse
psychological effects, including radical changes of mood and personality.
However the fact that they were prescribed by a physician militated
against the patient's chance of deducing that they were the proximate cause
of his suffering; indeed, he would be more inclined to ask for further drugs
to counteract the first, and since the whole process was extremely profitable
for all concerned save the ultimate consumer, they would be provided.
				John Brunner in "A Maze of Stars"
From: 2429oconnorw@vms.csd.mu.edu
Newsgroups: sci.crypt
Subject: Re: FAQ, anyone?
Date: 8 Oct 1992 17:49:39 GMT
Organization: Marquette University - Computer Services
Reply-To: 2429oconnorw@vms.csd.mu.edu
NNTP-Posting-Host: vmsa.csd.mu.edu

In article <1992Oct7.134411.9321@vax.oxford.ac.uk>, halpin@vax.oxford.ac.uk writes:
>Can anyone point me, a complete amateur as far as cryptography is
>concerned, to a FAQ or other electronically available
>primer/glossary on the subject?
>
>Also, where are the PGP 2.0 files available for ftp?
>
>Thanks
>
>Brendan

Same here.  Thanks


Bill O'Connor               | In the course of human events, there is
Marquette University        | always one person who will screw things
Milwaukee, WI               | up.
2429OCONNORW@VMS.CSD.MU.EDU |
From: schneier@chinet.chi.il.us (Bruce Schneier)
Newsgroups: sci.crypt
Subject: Re: Using genetic engineering for exhaustive DES key search
Keywords: exhaustive, DES, genetic engineering
Date: 16 Oct 92 04:06:41 GMT
Organization: Chinet - Public Access UNIX

In article <gH2JsB7w165w@works.uucp> hacker@works.uucp (DamDum) writes:
>lou@Cadence.COM (Louis K. Scheffer) writes:
>
>> 
>> While pondering the well known problem of DES cracking via exhaustive
>> key search, I started wondering if you could apply genetic engineering to

Oddly enough, this idea hasn't only been thought of before, but it actually
made it into a professional journal:

	Jean-Jacques Quisquater and Yvo G. Desmedt, "Chinese Lotto as an
	Exhaustive Code-Breaking Machine," COMPUTER, Nov 91, pp. 14-22.

It's amazig how thing they're slicing the stuff these days.

Bruce
Newsgroups: sci.crypt
From: rja14@cl.cam.ac.uk (Ross Anderson)
Subject: Re: DES generates A_(2^64)?
Reply-To: rja14@cl.cam.ac.uk (Ross Anderson)
Organization: U of Cambridge, England
Date: Fri, 16 Oct 1992 09:42:17 GMT

In <PHR.92Oct15174530@napa.telebit.com>,  phr@telebit.com (Paul Rubin) writes:

    Michael Wiener and I submitted a paper to Crypto '92 entitled "DES is not
    a Group". The principal argument is as follows.

    Consider the closure of DES encryptions under composition.  Our claim is
    that this group must include permutations which are not equivalent to DES
    encryption with any key.  Each of the n_i collected above must divide
    the order of the group.  Compute n = lcm( n_i, i=1..k ).  If n > 2^56 then
    the group must be larger than the set of DES encryptions.

    ...

    I heard that someone in Eastern Germany recently proved a stronger
    result, that DES generates the alternating group on 2^64 letters.
    This had been conjectured a while ago, though I don't know what the
    evidence for it was.  Anyone know more about this?

Here is an abstract of the relevant paper:

 {\bf \noindent R Wernsdorf,}{\em ~Eurocrypt 92\\}
 {\bf `The One-round Functions of DES Generate the Alternating Group'}

 Each round of DES consists of $2^{48}$ permutations. The group which they
 generate is shown to be 3-transitive, and if this were not equal to
 $A_{2^{64}}$, then it would have a unique minimal normal subgroup which is
 Abelian or simple. The former is excluded by displaying a permutation with
 too many fixed points, and the latter by the classification theory of
 simple groups.

With luck we'll have the first issue of `Computer and Communications Security
Abstracts' out shortly: it will contain abstracts like this of current
research papers.

Ross Anderson

Newsgroups: sci.crypt
From: cbarkley@alex (The DarkMage)
Subject: Re: DES Encryption/ Encrypting more than once.
Organization: Computer Science, Trinity University
Date: Thu, 15 Oct 1992 01:29:33 GMT

Can anyone send me the PRECISE algorithm used to build a UNIX
password for the password file?  Source code for it would be
even nicer.  The reason I need it is I am trying to get a script
working that will add many users out of a list of names (we are
a university and have to add around a hundred users all at once at
the beginning of each semester).  It works fine except for setting
the initial password.  Since passwd will only work interactively,
we are forced to do "unclean" things with /dev/tty.  If I could
just build the encrypted string myself and insert it into the
line I added to the password file, my life would be a LOT easier.

Note:  A straight reply may not work; we are having trouble getting
	our From: line correct!  Sorry!


-- 
Christopher Barkley
The DarkMage
cbarkley@tusol.cs.trinity.edu
Reality is a State of Mind
Newsgroups: sci.crypt,comp.os.os2.apps
From: fritz@ra.csc.ti.com (Fritz Whittington)
Subject: Re: PGP 2.0 for OS/2
Organization: Texas Instruments
Date: Wed, 14 Oct 1992 18:25:13 GMT

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

So perhaps you should re-load them, in case they have been tampered with.
-- 
Fritz Whittington Texas Instruments, P.O. Box 655474, MS 446 Dallas, TX 75265
    Shipping address: 13510 North Central Expressway, MS 446 Dallas, TX 75243  
fritz@csc.ti.com             Office: +1 214 995 0397     FAX: +1 214 995 6194
Since I am not an official TI spokesperson, these opinions contain no spokes.
Newsgroups: sci.crypt
From: butzerd@mckinley.eng.ohio-state.edu (Dane C. Butzer)
Subject: Re: RSA claims 33 and 37 of U.S. patent 4,405,829
Organization: The Ohio State University Dept of Electrical Engineering
Distribution: na
Date: Wed, 7 Oct 1992 14:52:31 GMT

Just another (possibly naive) thought,

Isn't it true that any ploynonmial in a computer is by default:

        polynomial mod 2^n

n being the length in bits of the variable used to store the
solution?  And weren't there at least a few encrpytion programs with
polynomials in them before RSA?  Couldn't this be prior art, too?  Or
does prior art have to be intentional (ie. yes, the equations were mod
2^n, but that wasn't on purpose...)?  Comments?


Dane Butzer
_______________________________________________________________________
Standard disclaimer applies...
-----------------------------------------------------------------------
From: alain@elevia.uniforum.qc.ca (W.A.Simon)
Newsgroups: sci.crypt
Subject: Re: Pseudo-one-time pads
Date: 12 Oct 92 09:14:46 EDT

In <1992Oct5.221733.27777@netcom.com>
rlglende@netcom.com (Robert Lewis Glendenning)
writes:
> There are two issues here: 1) The academic consideration of RNGs with
> "truely" random distributions and 2) The consideration of being able to
> predict the random number series.

	For the sake of accuracy:

	(1) is it statistically random?
	(2) is it predictable?

	if (1) is not true, the chances for (2) becoming
	true increase.  This is the academic argument.

	The pragmatic argument says it is possible to
	generate a stream for which (2) is true, without
	consideration for the truth of (1).  But the fact
	is that if (2) is true, you can bet that (1) is
	likewise.  It won't be an accident.

> All of the academic consideration of RNGs I have seen focus on 1). 2) is
> necessary for using them in an encryption system. I have made my RNGs
> pretty unpredictable by running 32 different Additive Congruential Method
> RNGs, and only selecting one bit of each for each 32-bit number. I do so
> by randomly (another RNG) selecting the particular bit from each. Of course,
> this is computationally extremely expensive.

	You have 32 PRNG using different parameters (but same algorithm).
	You pick 1 bit from each, but in RANDOM order.  How random?  Is
	it another PRNG?

	You realize that if each PRNG is not cryptographically secure in
	its own right, the 32 are not any more secure, unless you have
	a "true" random source to pick your PRNG sequences.  In which
	case you don't need the 32 PRNGs.

> I believe that the OTP using itis pretty safe. However, safety can be improved
> by compressing the oriignal file and then distributing it randomly through
> a random number file.
> [ ... ]

	PRNGs can be usefull as key generators, if they are used
	to pick material from a non random source, but nevertheless
	unknown to the opposition.  Take one PRNG and use the result
	to index into a string of sufficient length (say, some book
	on CD).  As long as you don't divulge the source of your raw
	material (and change it often) you are in clover.  But: how do
	you distribute the key?  Do you phone your covert correspondant
	and tell him to go buy the CD?  Aside from the annoying security
	considerations, can you be sure the two of you will get the exact
	same text (editions vary from country to country)?

	But why bother with PRNG's of you have access to long files
	you can share with your correspondants.  The files themselves
	are good enough as a source of key material.

	Suppose you have enough raw material to make two files.  For each
	character of each file generate a parity bit.  If the two bits
	are different use the byte from the first file, else use the
	byte from the second file.  Advance to next byte of each file.
	Or you could simply use the parity bits as your OTP key.
	These are just two samples of the many ways...



--
 Alain
Newsgroups: sci.logic
From: hodgson@dial.waterloo.edu (John A. B. Hodgson)
Subject: Re: Ideals and filters
Organization: University of Waterloo, Waterloo, Ontario, Canada
Date: Wed, 7 Oct 1992 16:19:01 GMT

ard> Could someone explain to me what the following are:

ard> ideal, prime ideal, filter and ultrafilter;

ard> in the context of model theory, I think.  (I asked this about two
ard> weeks ago but then I had to go away and all email addressed to me had
ard> accidentally been deleted.)  Replies by7 email preferred.

ard> Antoni Diller
ard> A.R.Diller@cs.bham.ac.uk

On a similar vein, what books expose logic using Boolean algebras and
ideals/filters in the same way as does "Algebraic Logic" by P. Halmos?
--
Yours very sincerely,	| Department of Systems Design Engineering
			| University of Waterloo
John Hodgson,		| Waterloo, Ontario
Graduate Student.	| Canada  N2L 4H2
From: danco@titan.ucc.umass.edu (DANIEL F COHEN)
Newsgroups: sci.logic
Subject: Re: A only if B
Date: 16 Oct 92 16:56:48 GMT
Organization: University of Massachusetts, Amherst

In article <1992Oct15.224329.20578@agt.uucp> Brian F G Bidulock <bbidulo1%agt@cs.ualberta.ca> writes:
>In article <rkaivola.718902434@mits> Risto Kaivola,
>rkaivola@mits.mdata.fi writes:
>>"Tom will visit us only if we invite him.",
>>is the correct formalization
>>
>>A = "Tom will visit us."
>>
>>B = "We invite him."
>>
>>A  -->  B
>
>How about:
>~A --> ~B
>or
>"If we don't invite Tom, he will not visit us."  == "Tom will visit us
>only if we invite him."

Half right.  What you symbolized by ~A -> ~B would be translated as,
"If Tom does not visit us, we did not invite him."  This would be false
only if ( I just love this construction!) Tom didn't visit us, and we did
invite him, and true otherwise.  This means that the case in which Tom
visits us even though we did NOT invite him is true for ~A -> ~B, but is
the sole false assignment of truth values for A -> B.  In other words, 
they aren't logically equivalent propositions.

Your English translation of ~A -> ~B is incorrect as a translation, 
but it IS logically equivalent to the original statement.  It's actually 
of the form ~B -> ~A (which is very likely what you meant to write in the
first place), and has exactly the same truth conditions as A -> B.

--Dan
Newsgroups: sci.logic
From: rags@triples.math.mcgill.ca (Robert A. G. Seely)
Subject: "A only if B"  vs  "A if and only if B"
Organization: Dept Of Mathematics and Statistics
Date: Tue, 13 Oct 92 22:45:41 GMT


I am surprised at the amount of comment this has caused - but (at the risk
of making a blooper myself - it's always possible and frequently probable)
here is my attempt to kill the thread:

There are at least three different phrases one must distinguish:
  A if B
  A only if B
  A if and only if B

Further, keep in mind that 
  A --> B  =  -B --> -A
 (and that B <-- A is often used as an alternate notation for A --> B
  - it is not as rare as one person suggested, at least in the crowds I
  frequent, and in certain non-commutative logics it is necessary to have
  two such implications - where of course <-- and --> would be different,
  and only equivalent if the model is commutative.
  It has the convenience that B <-- A then reads "B if A" - though that is
  one of the points of this note I guess, the other being that A --> B is
  read "A only if B" or "A implies B".)

Clearly "A if B" is just B --> A.  The thing to remember is that "A only if B"
is the converse (remember all the proofs in your undergraduate maths classes
of theorems of the form "A iff B" where half way through the prof. said "Now,
conversely ..."?) - So "A only if B" is A --> B

So we get the table:

  A if B             =  B --> A  =   -A --> -B
  A only if B        =  A --> B  =   -B --> -A
  A if and only if B =  B --> A and A --> B  =  -A --> -B and A --> B

(Use the backwards arrow if you like to get more equivalences...)

So when Mom says "You must have a cookie only if you wash your hands", she
means that she wants the universe so ordered that if she sees you eating a
cookie, she must be able to conclude that you have washed your hands.  
(ie if you don't wash your hands, don't go for the cookie tin...)  But if
you aren't eating a cookie, she won't know if you've washed or not...
(She - as a good logician - will be sceptical, and will probably check!)  
On the other hand, if she says "you must have a cookie if you wash your 
hands" you only have to avoid eating a cookie in order to keep your
hands dirty.  (But just because your hands are dirty, she cannot 
conclude you're not eating the cookie.  You might be, which is
why most Moms really mean to put the "only" in the sentence, and if they
forget, you can raid the cookie tin in good conscience!)

If you wish to point out that "common English" often confuses these three
meanings, I can only agree - but that surely wasn't the point of the
original posting. 

Hope this is clear.  As someone else said, if you read "A only if B" as 
"A {\huge ONLY} {\tiny if} B" it might seem more reasonable...

-rags
Newsgroups: sci.logic
From: sasghm@theseus.unx.sas.com (Gary Merrill)
Subject: Re: A only if B
Originator: sasghm@theseus.unx.sas.com
Date: Fri, 16 Oct 1992 12:46:32 GMT
Organization: SAS Institute Inc.


In article <1992Oct15.224329.20578@agt.uucp>, Brian F G Bidulock <bbidulo1%agt@cs.ualberta.ca> writes:
|> In article <rkaivola.718902434@mits> Risto Kaivola,
|> rkaivola@mits.mdata.fi writes:

|> How about:
|> ~A --> ~B
|> or
|> "If we don't invite Tom, he will not visit us."  == "Tom will visit us
|> only if we invite him."

In logic courses (where I tended to spend a *lot* of time on issues
of translation to and from English) I emphasized as a fundamental
principle of translation that one should attempt to have the structure
of the formal representation mirror (as closely as possible) the
structure of the English.  In particular, one should not end up with
a formal representation containing negations if there were no explicit
negations in the original English.  Cleaving to this principle avoids
a number of nasty confusions and problems.  Among other things, it
tends to remove *inference* from the translation process and keep
it where it belongs (post-translation, in the formalism).  And this
is particularly important as the complexity of the sentence to
be translated increases.

Accordingly, a good translation of

	If we don't invite Tom, he will not visit us.

is

	~A -> ~B

since the two negations are explicit in the English.  But this is
*not* a good translation of

	Tom will visit us only if we invite him.

since there are no explicit negations in the English.  These are,
of course (truth-functionally) equivalent, but it is *not* the
case that any logical equivalent to a good translation is itself
a good translation.
-- 
Gary H. Merrill  [Principal Systems Developer, C Compiler Development]
SAS Institute Inc. / SAS Campus Dr. / Cary, NC  27513 / (919) 677-8000
sasghm@theseus.unx.sas.com ... !mcnc!sas!sasghm