HDTenEightyP/NetNews huggingface dataset:
From: shallit@graceland.uwaterloo.ca (Jeffrey Shallit)
Subject: Re: RSA keys
Organization: University of Waterloo
Date: Fri, 31 Jul 1992 09:08:14 GMT

In article <1992Jul30.213709.26515@sfc.sony.com> weaver@sfc.sony.com (Eric Weaver) writes:

[In RSA scheme, with N = PQ, and DE = 1 (mod (P-1)(Q-1))]

>
>Question for cognoscenti: How hard is it REALLY to guess or search D
>from PQ?
>-- 
>Eric Weaver  Sony AVTC  677 River Oaks Pkwy, MS 35  SJ CA 95134  408 944-4904
>& Eng. Asst., KFJC 89.7 -  Foothill College, Los Altos Hills, CA 94022

DE-1 is a multiple of (P-1)(Q-1) = phi(N).  Gary Miller showed
in his thesis how to factor general N in random polynomial time,
given an oracle that returns an arbitrary small multiple of
phi(N).  The reduction is quite efficient.  Therefore, any general
method for finding D (given E and N) would give a fast integer
factoring algorithm, which some would say is unlikely.

Jeff Shallit

Newsgroups: sci.crypt,comp.security.misc
From: hallam@zeus02.desy.de (Phillip M. Hallam-Baker)
Subject: Re: Keeping track of a lot of passwords
Reply-To: hallam@zeus02.desy.de
Organization: DESY ZEUS Central Data Acquisition
Date: Thu, 23 Jul 1992 01:51:55 GMT

In article <62453@cup.portal.com>, ts@cup.portal.com (Tim W Smith) writes:

|>> I have accounts on half a dozen BBSes and unix boxes.  I use different
|>> passwords on each of them.  BBSes are particularly insecure, since they
|>> seem to invariably store passwords in plaintext.  I think all are
|>> pretty decent - not amazing, but hard to guess - passwords.  They
|>> required a bit of thought and memorization.  I don't have them written
|>> down anywhere.  (For a while I had them in my home terminal emulator,
|>> but decided to delete them, and yes I did make sure the bits were off
|>> the disk.)
|>
|>Does anyone have a good way to deal with this?  Not only might one have
|>accounts on two or three machines for work, and accounts on various BBS
|>and commercial services, but with the increasing availability of
|>packages to encrypt files, one might have dozens of encrypted files on
|>each machine.

Easy you just write a line into your login.com to reconfigure the VT220
so that the function keys have each of your hosts and passwords loaded
into them. To log in all you need do is press a key, easy!

Believe it or not we caught someone who did that. They didn't even clear
the keys when they logged out "Oh you mean they stay loaded?"


Nice thing about VMS, if somone does something really stupid security
wise you can turn the password generator on to teach 'em a lesson. An
expiry time of two weeks concentrates the mind wonderfuly.

Because VMS is a real(TM) system you can set these things for individual users.


Phill Hallam-Baker
From: skt@dcs.glasgow.ac.uk (Simon K. Train)
Newsgroups: sci.crypt
Subject: Pascal CRYPTO sources?
Keywords: pascal crypt
Date: 31 Jul 92 13:50:11 GMT
Organization: Glasgow University Computing Science Dept.


 Can someone tell me where to find crypto sources/algorithms for PASCAL?

 Thanks

Simon T.
Newsgroups: sci.crypt
From: tom@stallion.oz.au (Thomas Essebier)
Subject: Cypher algorithm question.
Organization: Stallion Technologies
Date: Wed, 29 Jul 1992 08:11:45 GMT
Summary: Is this algorithm secure?
Keywords: question, algorithm, encrypt, crypt, decrypt

By far not being an expert on cryptology, I would appreciate some 
comments on the crypto scheme below. 

Where does it stand in terms of security when compared to transposition 
cyphers, DES etc.

My initial thoughts were that other then using a brute force approach,
e.g. trying all 2^31 seeds (or so), there is no easy way to deal 
with it - but I am probably wrong :-)

I presume that due to its simplicity this sort of crypto approach must
be quite well known, its just that in my rather limited explorations of 
the field I have not come accros any.

Algorithm:
- Create a sequence of random numbers that starts at 'seed' and is known 
  to be deterministic and to have a large period. e.g. linear congruential:
  X[i+1] = (a*X[i] + c) mod m, choose coefficients as follows 
  a = 16807, m = 2,147,483,647 (2^31 - 1), c = 0
  #define RANDOM ((unsigned char) (seed = (16807 * seed) % 2147483647))
  supposedly has a period of 2^31.

- use the 'key' to choose the first seed, e.g. add up all the bytes or
  some such, so that a key >= 4 byte could cover 0-2^31, roughly at least.

- take the the data stream and for each byte 'xor' the LSB of the 'seed'.
  A stronger method might be to use 4 byte chunks (assuming seed is 4 bytes)?
  The advantage of using xor is that there is that the algorithm is self
  reversing. Perhaps it entails some pitfall(s) however?

If anybody could point me to some literature that explains why the above
is (un?)reasonably (in?)secure I would be most grateful. Please note that
I make no claim to have carefully studied and researched this topic. 
I was hoping to avoid all that :-)

--
Thomas J. Essebier              Stallion Technologies Pty. Ltd.
Aarnet: tom@stallion.oz.au      56 Sylvan Rd., Toowong 4066, Australia
...!uunet!stallion.oz.au!tom    Fx: +61 7 371 8881, Ph: +61 7 870 4999
Xref: sparky sci.crypt:2711 comp.security.misc:753
From: cme@ellisun.sw.stratus.com (Carl Ellison)
Newsgroups: sci.crypt,comp.security.misc
Subject: Re: Keeping track of a lot of passwords
Date: 21 Jul 92 18:52:33 GMT
Followup-To: sci.crypt
Organization: Stratus Computer, Software Engineering

In article <62453@cup.portal.com> ts@cup.portal.com (Tim W Smith) writes:
>My current scheme is to have a file that lists the various passwords
>I am using.  This file will be encrypted with a password that is *NEVER*
>*EVER* used for anything else, and *NEVER* *EVER* written down anywhere.
>Perhaps this file will even be kept off-line.  How does this seem?


This sounds like an opportunity for some calculator company (probably
Japanese).

I can see having a password file in the continuous memory of a hand-held
computer which I carry with me at all times.
Newsgroups: sci.crypt
From: rolfe@ldp.com (Rolfe Tessem)
Subject: Need copy of "Hut Six Story"
Reply-To: rolfe@ldp.com
Organization: Lucky Duck Productions
Date: Fri, 24 Jul 1992 15:00:59 GMT

I need a copy of Gordon Welchman's "Hut Six Story."  Any leads on obtaining  
one would be appreciated.
-- 
Rolfe Tessem				Lucky Duck Productions
rolfe@ldp.com				New York City
(212) 463-0029				(212) 463-7049 fax
Newsgroups: sci.crypt,comp.security.misc
From: erick@fraser.sfu.ca (Erick Bryce Wong)
Subject: Re: choosing passwords (was: Re: Crypt should be based on MD5)
Organization: Simon Fraser University, Burnaby, B.C., Canada
Date: Sun, 26 Jul 1992 20:21:54 GMT

freitag@elrond.toppoint.de (Claus Schoenleber) writes:
>The last digit c of an ISBN is a (weighted) checksum MOD 11:
>
>[a  is digit a at position i, i=10 is leftmost]
>  i
>
>     [         / 10         \          ]
>     |        /  __          \         |
>c =  | 11 -  (   \   a  * i   ) mod 11 | mod 11
>     |        \  /_   i      /         |
>     [         \ i=2        /          ]

You can put this in slightly simpler terms if you define i=1 to be the leftmost
position, then the formula becomes (I think):

       / #digits    \  
      /  __          \ 
c =  (   \   a  * i   ) mod 11
      \  /_   i      / 
       \ i=1        /  

-- 
 -- Erick, the perfect square  :-)
Newsgroups: sci.crypt
From: erc@unislc.uucp (Ed Carp)
Subject: Lucifer revisited
X-Newsreader: Tin 1.1 PL4
Reply-To: erc@apple.com
Organization: Unisys Corporation SLC
Date: Tue, 28 Jul 1992 21:37:45 GMT

In March of 1991, Jonathan Smith posted source for lucifer.  Does anyone know
how secure this algorithm is?  Any modifications, etc. to the original?
-- 
Ed Carp, N7EKG		erc@apple.com	<-- preferred email address!

801/      "This is the final task I will ever give you, and  it  goes
269-      on  forever.   Act  happy,  feel happy, be happy, without a
Newsgroups: sci.crypt
From: Webbge@che17.ncsu.EDU (Greg Earl Webb)
Subject: Padded Data
Keywords: pascal crypt
Reply-To: Webbge@che17.ncsu.EDU (Greg Earl Webb)
Organization: North Carolina State University
Date: Fri, 31 Jul 1992 15:37:19 GMT


I've seen some interesting posts here recently, but I have yet to
see the topic of padding data with garbage.  It seems to me that
if you had an algorithm that would not only encrypt the data, but would
also insert random data into the original data (without following
a regular pattern) that it would be almost impossible for someone
to tell what was real information and what was just junk.  Although
the size of the document would increase, the difficulty in decrypting
the message would also increase considerably.

The only problem I can see with this method is how do you insert data
in a non-regular pattern and still have the ability to remove it later.
Please comment on this type of procedure.  I'm sure people have thought
on these lines before and would be interested in seeing what they have
to say......

			Greg Webb
From: mapmef@gdr.bath.ac.uk (M E Fletcher)
Newsgroups: sci.crypt
Subject: Re: PIN codes (partial summary)
Date: 25 Jul 92 15:23:57 GMT
Organization: School of Mathematics, University of Bath, UK

In article <1992Jul21.131915.7708@vax.oxford.ac.uk> roes@vax.oxford.ac.uk writes:
>On July 9 1992 I wrote:
>
>> I recently saw an article in a Dutch newspaper (Vrij
>> Nederland,13/06/92), stating that PIN codes on cash machine
>> cards are not as safe as most people think or the banks would
>> like us to believe. The article described a number of cases
>> were money was taken from cash machines with stolen cards. In
>> each case the owners of the cards were insisting that the PIN
>> code was never written down and nobody else new it. In one
>> case the owner did not even new the code herself. In spite of
>> this, it turned out that the PIN code was typed correctly the
>> first time and sometimes shortly after the card was stolen
>> (after about 20 minutes).
>
>> I do not know how reliable this information is, but is there
>> anybody who can tell me if *in principle* it is possible to
>> retrieve the four digit PIN code from a stolen cash machine
>> card?
>

You didnt't mention an even easier way:

Watch someone keying in their pin from behind them in the queue. Most
people type in numbers on keyboards very slowly, so this is easy
enough. Now wait and hope that they don't bother picking up their
receipt. You now have their account number (helpfully printed on
the receipt) and their PIN. Now you need a little machine to encode
the magnetic strips on plastic cards, plus a few blank cards. These
are widely available for a few hundred quid. Encode the appropriate
number and you can now withdraw money from their account. 

Moral: Don't let anyone see you type in your PIN, and always keep
your receipts.



Matt
Xref: sparky sci.crypt:2744 comp.security.misc:816
From: freitag@elrond.toppoint.de (Claus Schoenleber)
Newsgroups: sci.crypt,comp.security.misc
Subject: Re: choosing passwords (was: Re: Crypt should be based on MD5)
Date: Sun, 26 Jul 92 13:41:33 MEST
Distribution: world
Organization: Claus Schoenleber, Kiel, Germany (3-926986)

Here's the correct version (sorry for mistakes; I hope this will end the
error thread. Thanks to those who looked sharper than I did.):

The last digit c of an ISBN is a (weighted) checksum MOD 11:

[a  is digit a at position i, i=10 is leftmost]
  i



     [         / 10         \          ]
     |        /  __          \         |
c =  | 11 -  (   \   a  * i   ) mod 11 | mod 11
     |        \  /_   i      /         |
     [         \ i=2        /          ]


If c = 10, then take letter 'X' instead.

E.g. ISBN 3-7609-4012-? is
          |   |   |
          |   |   |
          |   |   +-----> titel number of book in publisher's list
          |   +---------> (national) publisher's number
          +-------------> group number, linguistic area
                          (0 = English, 3 = German,...)

11 - (3 * 10 + 7 * 9 + 6 * 8 + 0 * 7 + 9 * 6 + 4 * 5 + 0 * 4 + 1 * 3 + 2 * 2)
     mod 11) mod 11

= (11 - (222 mod 11)) mod 11 = (11 - 2) mod 11 = 9  ==> 3-7609-4012-9

Claus.

-- --------------------------------------------------------------
Claus Schoenleber             I  UUCP  freitag@elrond.toppoint.de
=================================================================
The Galaxy shall miss you! I "What's the matter?" - "Never mind!"
Isaac Asimov died 06Apr92. I  ;-)  "What's mind?" - "No matter!"
=================================================================
Newsgroups: sci.crypt
From: erick@fraser.sfu.ca (Erick Bryce Wong)
Subject: Re: choosing passwords (was: Re: Crypt should be based on MD5)
Organization: Simon Fraser University, Burnaby, B.C., Canada
Date: Thu, 30 Jul 1992 21:40:32 GMT

hagadorn@amsaa-cleo.brl.mil (Thomas Hagadorn) writes:
>erick@fraser.sfu.ca (Erick Bryce Wong) writes:
>|freitag@elrond.toppoint.de (Claus Schoenleber) writes:
>|>[a  is digit a at position i, i=10 is leftmost]
                                 ^^^^
>|>     [         / 10         \          ]
>|>     |        /  __          \         |
>|>c =  | 11 -  (   \   a  * i   ) mod 11 | mod 11
>|>     |        \  /_   i      /         |
>|>     [         \ i=2        /          ]
>|
>|You can put this in slightly simpler terms if you define i=1 to be the leftmo
                                                           ^^^
>|       / #digits    \  
>|      /  __          \ 
>|c =  (   \   a  * i   ) mod 11
>|      \  /_   i      / 
>|       \ i=1        /  
>|
>   Almost, make that:
>
>            / #digits    \  
>           /  __          \ 
>11 - c =  (   \   a  * i   ) mod 11
>           \  /_   i      / 
>            \ i=1        /  

You apparently didn't read both articles carefully.  If the original formula
is correct, then (using pseudo-TeX notation to cut the size down a bit):
(I'll use the same meanings for a_i and i as the original article.)

11 - \sum_2^10{a_i * i} == - \sum_2^10{a_i * i}
                        == \sum_2^10{a_i * {-i}}
                        == \sum_2^10{a_i * {11-i}}
                        == \sum_1^9{a_{11-i} * i} (mod 11).

Which is exactly what my formula corresponds to, as I define the leftmost
position to be 1 with the rest ascending, not 10 with the rest descending.

-- 
 -- Erick, the perfect square  :-)
From: skt@dcs.glasgow.ac.uk (Simon K. Train)
Newsgroups: sci.crypt
Subject: Crypto sources (Pascal)?
Date: 28 Jul 92 16:20:55 GMT
Organization: Glasgow University Computing Science Dept.

Help me,
 
 Can anyone tell me where to find some PASCAL source code for crypto programs.
I'm using Think Pascal 4.0 (Mac SE/30). 
 Thanks in advance.

Simon T.
From: hagadorn@amsaa-cleo.brl.mil (Thomas Hagadorn)
Newsgroups: sci.crypt
Subject: Re: can people really have trouble memorizi
Date: 27 Jul 92 20:03:06 GMT
Organization: Army Materiel Systems Analysis Activity

In article <1992Jul23.155325.17825@sbil.co.uk> pbond@spitws100.sbil.co.uk writes:
>	Finally, Creighton Carvello memorised the order of a single shuffled 
>pack of 52 cards in around 1 minute 50 seconds in early 1992 in front 
>of a live audience.

  Hmmm, I once met a card mechanic who said he could do up to 3 or 4 decks, 
and let me shuffle a single deck which he inspected about 15-20 seconds 
before proceeding to do some additional riffles and then name the cards
as he turned them over.  As interesting as these tidbits are though, I
think it's time for this thread to end (at least in sci.crypt that is).
Xref: sparky sci.crypt:2717 alt.security:3985
From: bhall@ccwf.cc.utexas.edu (Bowman Hall)
Newsgroups: sci.crypt,alt.security
Subject: Unemployed cryptologists?
Date: 22 Jul 92 08:01:16 GMT
Reply-To: bhall@ccwf.cc.utexas.edu (Bowman Hall)
Followup-To: sci.crypt
Organization: The University of Texas at Austin, Austin TX
Originator: bhall@happy.cc.utexas.edu

Besides working for governments and researching at universities,
what employment is there for cryptologists?

Bell Labs?


-- 
-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Bowman Hall
Department of Mathematics
University of Texas at Austin
bhall@dopey.cc.utexas.edu
From: so@fortran.cs.psu.edu (Nicol C. So)
Newsgroups: sci.crypt
Subject: Re: Padded Data
Keywords: pascal crypt
Date: 31 Jul 92 17:00:29 GMT
Organization: Penn State Computer Science

In article <1992Jul31.153719.28374@ncsu.edu> Webbge@che17.ncsu.EDU (Greg Earl Webb) writes:
>
>I've seen some interesting posts here recently, but I have yet to
>see the topic of padding data with garbage.  It seems to me that
>if you had an algorithm that would not only encrypt the data, but would
>also insert random data into the original data (without following
>a regular pattern) that it would be almost impossible for someone
>to tell what was real information and what was just junk.  Although
>the size of the document would increase, the difficulty in decrypting
>the message would also increase considerably.
>
>The only problem I can see with this method is how do you insert data
>in a non-regular pattern and still have the ability to remove it later.
>Please comment on this type of procedure.  I'm sure people have thought
>on these lines before and would be interested in seeing what they have
>to say......
>
>			Greg Webb
>

I have thought about this scheme at one point in time.  It is not
difficult to implement but it is not superior to random padding.
Actually it is less efficient.  One way to realize the scheme is to
have a pseudorandom binary string which is derived from the encryption
key, say:

	100111010100101010001110101010001...

If the i-th bit of this string is 1, the i-th symbol in the ciphertext
is taken from the plaintext.  Otherwise, the i-th symbol is randomly
chosen.
From: pcl@oxford.ac.uk (Paul Leyland)
Newsgroups: sci.crypt
Subject: Re: RSA Public Key Generations.
Date: 29 Jul 92 14:22:59 GMT
Organization: Oxford University Computing Service, 13 Banbury Rd, Oxford, OX2
	6NN
In-reply-to: avalon@coombs.anu.edu.au's message of 29 Jul 92 08:46:06 GMT

In article <avalon.712399566@coombs> avalon@coombs.anu.edu.au (Darren Reed) writes:

   Hi, I've been looking at implementing RSA encrpytion and have found that
   generating the initial keys is a somewhat tricky.  The only algorithm
   I have found for generation the public key is:

   N = x*y
   p*s mod (x-1)(y-1) = 1

   and solve for p. :(

   Is there an easy way to solve this problem ?

   If anyone can give me some clues on how to do this, it would be great
   (or even where to look for some clues :).


D.E. Knuth, _The Art of Computer Programming, Vol.2 Seminumerical
Algorithms_, 1980.

Hans Riesel, _Prime Numbers and Computer Methods of Factorization_,
1985.  (Or something like that -- my copy is at home so I may have got
the title slightly wrong.)

Both of these have good introductions to RSA and RSA-like encryption
methods.  Both should be available in a good university library; Knuth
at least is still in print and I'd argue strongly that every
programmer should own a copy of all three of his volumes.


Paul
--
Paul Leyland <pcl@oxford.ac.uk>          | Hanging on in quiet desperation is
Oxford University Computing Service      |     the English way.
13 Banbury Road, Oxford, OX2 6NN, UK     | The time is come, the song is over.
Tel: +44-865-273200  Fax: +44-865-273275 | Thought I'd something more to say.
From: marcusj@apricot.co.uk (Marcus Jenkins)
Newsgroups: sci.crypt
Subject: *CRYPT proceedings '90 - '91 agenda wanted
Date: 21 Jul 92 16:08:07 GMT
Organization: Apricot Computers Limited

Could somebody please give me some idea what papers were presented
in:

	CRYPTO '90
	CRYPTO '91
	AUSCRYPT '90
	EUROCRYPT '90
	EUROCRYPT '91

Thanks in advance.

 _ _ _
' ) ) )                         Internet: marcusj@apricot.co.uk
 / / / __.  __  _. . . _        UUCP: marcusj@apricot.uucp
/ ' (_(_/|_/ (_(__(_/_/_)_      If all else fails from US, try:  
Marcus Jenkins                  apricot!marcusj@relay.EU.net
Tel: +44 21 472 3002  Fax: +44 21 471 2935
Disclaimer:  Anything I wrote above is, of course, my own view and
             does not in any way represent my employer.
From: cme@ellisun.sw.stratus.com (Carl Ellison)
Newsgroups: sci.crypt
Subject: Re: Padded Data
Keywords: pascal crypt
Date: 31 Jul 92 19:13:53 GMT
Organization: Stratus Computer, Software Engineering

In article <1992Jul31.153719.28374@ncsu.edu> Webbge@che17.ncsu.EDU (Greg Earl Webb) writes:
>The only problem I can see with this method is how do you insert data
>in a non-regular pattern and still have the ability to remove it later.


I've used one method and have planned at least two others.  I now prefer
#2 for its simplicity.

1.	in one system of mine, I encrypt a vector of length 20 by
	multiplying by a 20x20 matrix.  (Hill's algorithm) Each element of
	the vector is composed of two ASCII characters plus one random bit.

		c0 + 129*(c1 + 129*b)

	(I use 129 so that I can have character 128 which means "end of
	code line") I sometimes end a code line short and just pad the
	remainder with random characters [0..128].

2.	in another system, I prefix compressed data with a fixed number of
	random bytes -- then pass the combination through a transposition
	whose key depends in part on the sum of the bytes of the first
	block of data (code posted here a month or two ago -- c/o
	setzer@math.ncsu.edu (William Setzer).

3.	in another system, I drive a state machine with 3 states (below is
	the stripping machine):

		for ( n = (getc(stdin)) % 17 ;	/* # of bytes of padding */
		      n > 0 ;
		      n-- )
		  getc( stdin ) ;	/* toss the padding */
		for ( n = getc( stdin ); n > 0 ; n-- )
		  use( getc( stdin ) ) ;	/* use good characters */
From: rop@hacktic.nl (Rop Gonggrijp)
Newsgroups: sci.crypt
Subject: FAQ request
Date: 22 Jul 92 23:47:32 GMT
Organization: Hack-Tic Magazine

Is there an archive site for this group? FAQ?

Thanks,



--------------------------------------------------------------
Rop Gonggrijp (rop@hacktic.nl)                 I AM SPOOK-FOOD
fax: +31 20 6900968                              ^^
Newsgroups: sci.crypt
From: hougland@enuxha.eas.asu.edu (Kriss A. Hougland)
Subject: Encryption in LOTUS... Any quick ideas
Keywords:  LOTUS passwords spreadsheets
Organization: Arizona State University, Tempe, AZ
Date: Tue, 28 Jul 1992 01:13:40 GMT


Thanks in advance for any information.\


I have received/inherit some password locked spreadsheets in LOTUS.
Does anyone have any idea on how they encrypt them?  I don't want to
spend alot of time encrypting a sample and figuring out the diffrences.

I would hope that they do not have serious encryption since I do not
see any NOT FOR EXPORT on the manuals.

TTFN
--
askah@acvax.inre.asu.edu      "Only Nixon could make it to China"
hougland@enuxha.eas.asu.edu         -- old Vulcan probverb
Throw the Scrabble game if anyone starts with "Bezique".
Here are 4 four letter words people don't use "hope, give, kind, and help" --me
Xref: sparky sci.crypt:2725 comp.security.misc:793