HDTenEightyP/NetNews huggingface dataset:
From: jac54@cas.org ()
Subject: Re: Zimmermann's responses to Sidelnikov's
Organization: Chemical Abstracts Service, Columbus, Ohio
Date: Mon, 25 Jan 1993 11:53:02 GMT

In article <1993Jan22.154035.20835@shearson.com> dmandl@shearson.com writes:
>In article 22207@colnet.cmhnet.org, res@colnet.cmhnet.org (Rob Stampfli) writes:
>
>>Actually, among the oddities I find delightful (and scary) about fortran
>>is the fact that
>>
>>      DO 10 I=1,5
>>
>>and
>>
>>      DO 10 I=1.5
>>
>>are both valid, but do entirely different things.
>
>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.
>One of the programmers used a comma instead of a period, or vice
>versa, and no one caught it.  The story was related in the C.P.S.R.
>paper that argued against the "Star Wars" boondoggle.  The paper
>even included the original line of code.
>
	I think you remember incorrectly.  This was one of the early
	Polaris tests (late 50's-early 60's).  How many stories of
	U.S. astronauts being lost in flight can you remember.  I can
	remember one, and that had to do with faulty plumbing.

	Alec Chambers
From: urlichs@smurf.sub.org (Matthias Urlichs)
Newsgroups: sci.crypt
Subject: Re: random number generation
Date: 24 Jan 1993 23:03:49 +0100
Organization: University of Karlsruhe, FRG
NNTP-Posting-Host: 127.0.0.1

In sci.crypt, article <Lw7LXB1w164w@jwt.UUCP>,
  bbs-hrick@jwt.UUCP writes:
> > > I am looking for good ideas for real random number generation.   I've heard
>  
> How would this work... take the least significant bit from each
> byte of traffic in a Usenet newsgroup?

I'd assume that English text has some redundancy in the lowest bits when
ASCIIized. Thus, not 100% random given a suitable definition of that word.

You could grab each article and create its MD5 signature. You'd probably
have to be somewhat imaginative so that knowledge of the sequence of
articles arriving at your machine won't reveal the random number.

-- 
Life's too short, but if you go fast enough, you can live
        it one-and-a-half times.
-- 
Matthias Urlichs  --  urlichs@smurf.sub.org -- urlichs@smurf.ira.uka.de   /(o\
Humboldtstrasse 7 -- 7500 Karlsruhe 1 -- Germany  --  +49-721-9612521     \o)/
Newsgroups: sci.crypt
From: rcain@netcom.com (Robert Cain)
Subject: Re: Public Key Ciphers
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Date: Thu, 21 Jan 1993 20:07:34 GMT

Is there a good description of ElGamal available by ftp from anywhere?
I am one of those unfortunates without access to a good technical
libraray.

Thanks,

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

    'The meek shall inherit the earth--the rest of us will move on..'
                                                    Sameer Parekh


               PGP 1.0 or 2.0 public key available on request.
Newsgroups: sci.crypt
From: dmandl@shearson.com (David Mandl)
Subject: Re: Zimmermann's responses to Sidelnikov's
Reply-To: dmandl@shearson.com
Organization: Lehman Brothers, Inc.
Date: Fri, 22 Jan 1993 15:40:35 GMT

In article 22207@colnet.cmhnet.org, res@colnet.cmhnet.org (Rob Stampfli) writes:

>Actually, among the oddities I find delightful (and scary) about fortran
>is the fact that
>
>	DO 10 I=1,5
>
>and
>
>	DO 10 I=1.5
>
>are both valid, but do entirely different things.

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.
One of the programmers used a comma instead of a period, or vice
versa, and no one caught it.  The story was related in the C.P.S.R.
paper that argued against the "Star Wars" boondoggle.  The paper
even included the original line of code.

   --Dave.

---
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         Dave Mandl            |    Opinions expressed here
       New York City           | are not those of my employer,
   (dmandl@shearson.com)       |          believe me.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Newsgroups: sci.crypt
From: smb@research.att.com (Steven Bellovin)
Subject: Re: Programs in BASIC please
Date: Fri, 22 Jan 1993 03:23:51 GMT
Organization: AT&T Bell Laboratories

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

Look for ``Cryptanalysis for Microcomputers'', by C.C. Foster, Hayden, 1982.
Newsgroups: sci.crypt
From: schneier@chinet.chi.il.us (Bruce Schneier)
Subject: Does anyone have Cryptologia, v. 9, n. 1, Jan 85
Organization: Chinet - Public Access UNIX
Date: Wed, 27 Jan 1993 03:08:27 GMT

I would like a copy of R. Scott's article in NewDES from Cryptologia, v. 9,
n. 1, Jan 85, pp. 75-90.  That particular issue is out of print.

Does anyone have access to it?  Would they mind mailing me a copy?

Bruce
*****************************************************************************
* Bruce Schneier            2,000,000,000,000,000,000,000,000,002,000,000,000 
* Counterpane Systems       000,000,000,000,002,000,000,002,293 
* schneier@chinet.chi.il.us The largest prime number...alphabetically!
* (708) 524-9461            Two vigintillion, two undecillion, two trillion,
* 730 Fair Oaks Ave.        two thousand, two hundred and ninety three.
* Oak Park, IL  60302
*****************************************************************************
Newsgroups: sci.crypt
From: atkinson@itd.nrl.navy.mil (Randall Atkinson)
Subject: Re: authentication tokens
Organization: Naval Research Laboratory, DC
Distribution: na
Date: Thu, 28 Jan 1993 18:02:43 GMT

In article <8345@dove.nist.gov> wack@ariel.ncsl.nist.gov (John Wack) writes:
>
>I've got a question for the net.wisdom out there....

>Another vendor offers a similar one-time password card that is
>synchronized with the host based on time.  This also has problems if
>clocks drift, and has some problems associated with it as well if this
>happens.

I dunno anything about the security stuff, but you can use the existing
Internet time infrastructure to keep all your system clocks synch'd within 
small fractions of seconds.  Newsgroup comp.protocols.time.ntp is devoted
to discussions of the Network Time Protocol.  NTP includes some confidentiality
and authentication mechanisms.  Software to implement NTP version 3 is
in the XNTP3 distribution that is freely distributable from louie.udel.edu
via anonymous ftp.  This works on most workstations today and is nicely
portable code.


Newsgroups: sci.crypt
From: ray@ole.cdac.com (Ray Berry)
Subject: filelength permutations
Organization: Cascade Design Automation, Bellevue, WA
Date: Wed, 27 Jan 1993 02:59:03 GMT


   It seems to me that permuting the order of characters [bytes] in an
encrypted file would be valuable in hiding the structure, e.g. fixed
headers, 'magic' characters, etc., which might otherwise facilitate a
"chosen plain-text" decryption attack.
   To that end, can anyone offer guidance on efficient algorithms which 
can generate file-length permutations which could be seeded by a password?

-- 
Ray Berry kb7ht ray@ole.cdac.com 73407.3152@compuserve.com /*inquire within*/
Newsgroups: sci.crypt
From: martin@math.rwth-aachen.de (  Martin Schoenert)
Newsgroups: sci.crypt,sci.math
Subject: Re: Oh yeah? Factor this...
Date: 22 Jan 93 10:04:15 GMT
Organization: Rechnerbetrieb Informatik - RWTH Aachen
Distribution: na
NNTP-Posting-Host: bert.math.rwth-aachen.de

strnlght@netcom.com (David Sternlight) writes:

    bs@gauss.mitre.org (Robert D. Silverman) writes:

        gilgalad@quip.eecs.umich.edu (Ralph Seguin) writes:

            27392450308603031423410234291674686281194364367580914627947367941608692026226993634332118404582438634929548737283992369758487974306317730580753883429460344956410077034761330476016739454649828385541500213920807

            Can you factor this number [in your lifetime]?  If so, you may be

        What is the source for this number? Is it a random integer? Is it
        an RSA number, constructed as the product of nearly equal primes?
        If the latter it is out of current computational range.

    (Correcting a previous post)
    Couldn't you take the approximate square root of the number, truncate the
    result, and then start searching up and down from there if the number is the
    product of two nearly equal primes?

Yes you could, of course.  Note however, that the number has 209 digits.
Now suppose that it has two prime factors of with 100 digits and 109
digits.  Then you would search quite a while.  Bob probably meant that it
must not be the product of two primes of nearly equal *size*.  Especially
it must not have a prime factor with less than 40 digits, otherwise it
would be possible to attact it with the elliptic curve method.

Martin.

-- .- .-. - .. -.  .-.. --- ...- . ...  .- -. -. .. -.- .-
Martin Sch"onert,   Martin.Schoenert@Math.RWTH-Aachen.DE,  +49 241 804551
Lehrstuhl D f"ur Mathematik, Templergraben 64, RWTH, D 51 Aachen, Germany
From: paul@kuhub.cc.ukans.edu
Newsgroups: sci.crypt
Subject: NSA's MSP and PSMP encryption algs?
Date: 21 Jan 93 13:43:32 CST
Organization: University of Kansas Academic Computing Services

Network World's Jan. 18th issue talks of two NSA developed public-key
encryption algorithms. One is called the Message Security Protocol (MSP)
the other (PMSP) Preliminary Message Security Protocol.

MSP is for classified data, PMSP is for "unclassified but sensitive"
data. Can anyone provide references for these encryption algorithms?

Thank you!
Newsgroups: sci.crypt,alt.security.pgp
From: meyer@ux1.cso.uiuc.edu (Don Meyer)
Subject: Re: PGP messages readable by more than one person
Organization: UIUC College of Agriculture
Date: Thu, 28 Jan 1993 01:21:16 GMT

warlord@MIT.EDU (Derek Atkins) writes:

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

I'm trying to cover as many bases as I possibly can.  Although for key
creation I'm afraid I'm going to be limited to bringing the child process to
the forground and letting the user interact on his/her own.  All others I
need to be able to feed as stdio, however.

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

Maybe this one is OS/2 implementation specific.  I'd bust out the source to
have a look, but I'm a bit constrained already as far as disk space...

Don
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Don Meyer     Network Manager, UIUC College of Ag Microcomputer Facility
internet:     dlmeyer@uiuc.edu		
member:       NRA, ISSC, IL Farm Bureau	 "Don't blame me, I voted Libertarian!"
					    Nancy Lord in '96!

"Clinton/Gore -- The American people deserve what they voted for!"
From: palmer@icat.larc.nasa.gov (Michael T. Palmer)
Newsgroups: sci.crypt
Subject: Re: Wanted: very fast random number generator
Date: 26 Jan 93 20:53:46 GMT
Organization: NASA Langley Research Center, Hampton, VA  USA
NNTP-Posting-Host: icat.larc.nasa.gov

tgl+@cs.cmu.edu (Tom Lane) writes:

>What I need is a very very fast random number generator; it does NOT need to
>be cryptographically strong.

Check out "Random Number Generators: Good Ones are Hard to Find" by Steven
K. Park and Keith W. Miller, _Communications_of_the_ACM_ Volume 31 Number 10,
October 1988.

Here they define a "minimal standard" RNG that is implemented several
different ways (in Pascal, but it ports to C in about 1.75 minutes).  Even
if you choose to use a different RNG, it may be good for you to read this
article anyway.  It's very informative.

-- 
Michael T. Palmer         |  "A man is crazy who writes a secret in any
m.t.palmer@larc.nasa.gov  |   other way than one which will conceal it
RIPEM key on server       |   from the vulgar." - Roger Bacon
Newsgroups: sci.crypt
From: levesque@rocky.ndhm.gtegsc.com (Allen Levesque)
Subject: Decoding Goppa codes
Followup-To: Inquiry re Goppa Codes
Organization: GTE Government Systems
Date: Mon, 25 Jan 1993 21:02:47 GMT

Subject: Decoding Goppa Codes
Date: January 25, 1993
From: levesque@rocky.ndhm.gtegsc.com

    This is provided in response to an inquiry from Ralf Fessner
 (rf4@irz202.inf.tu-dresden.de) regarding algorithms for decoding Goppa
codes.

   Goppa codes can be decoded in a manner very similar to the decoding of
BCH codes.  In fact the procedure makes use of a form of Berlekamp's
iterative algorithm for finding the error-location polynomial for a BCH
code.  Two good papers are:

1.   N. J. Patterson, "The Algebraic Decoding of Goppa Codes," IEEE Trans.
on Inf. Thy., IT-21, pp 203-207, March 1975.

2.   Y. Sugiyama, et. al., "A Method for Solving Key Equations for Decoding
Goppa Codes," Information and Control, Vol 27, pp 87-89, January 1975.


ALLEN LEVESQUE, GTE GOVERNMENT SYSTEMS CORP., WALTHAM, MASS. USA,
TEL: (617)466-3729, FAX: (617)466-3720, e-mail:
Levesque@rocky.ndhm.gtegsc.com
Xref: sparky sci.crypt:7127 alt.security.pgp:597
From: urlichs@smurf.sub.org (Matthias Urlichs)
Newsgroups: sci.crypt,alt.security.pgp
Subject: Re: PGP messages readable by more than one person
Date: 25 Jan 1993 10:51:32 +0100
Organization: University of Karlsruhe, FRG
NNTP-Posting-Host: 127.0.0.1

In alt.security.pgp, article <WARLORD.93Jan24213831@snorkelwacker.mit.edu>,
  warlord@MIT.EDU (Derek Atkins) writes:
> 
> PGP 2.2 *WILL* have multiple-recipient encryption!  The code is done.
> The patches are in.  All that's needed is a 2.2 release to happen!
> 
While we're on the subject of new releases..:
- Nonblocking I/O is not undone when an interrupt signal is received.
- No gratuitious appending of suffixes for command-line arguments please.
  UNIX isn't DOS.
- Make pgp -kxaf work. Ditto pgp -kaf.
- When extracting a key, I'd like to select which certifications for
  that key get exported.
- How do I get pgp -fst/-fsat to not encode the message I want to sign?
- Thoughts about better MIME integration? The MIME multipart stuff
  would be a far better idea than these BEGIN PGP lines.
  Define an "application/pgp" subtype ?

-- 
No matter how subtle the wizard, a knife in the shoulder blades will
seriously cramp his style.
-- 
-----BEGIN PGP PUBLIC KEY BLOCK-----
Version: 2.1

mQBYAitirlIAAAECWLA75SRTAZb8WsAB4kJCAmxM4h01UgErYLqOCOolntDCA502
Zr6rqV39QKwx6tton9AtTgPKrfdz6ufnAL9E45BJgO4zcJBNac3pMwAFEbQoTWF0
dGhpYXMgVXJsaWNocyA8dXJsaWNoc0BzbXVyZi5zdWIub3JnPg==
=FMCO
-----END PGP PUBLIC KEY BLOCK-----
-- 
Matthias Urlichs  --  urlichs@smurf.sub.org -- urlichs@smurf.ira.uka.de   /(o\
Humboldtstrasse 7 -- 7500 Karlsruhe 1 -- Germany  --  +49-721-9612521     \o)/
Newsgroups: sci.crypt
From: bontchev@fbihh.informatik.uni-hamburg.de (Vesselin Bontchev)
Subject: Re: Public Key Depository
Reply-To: bontchev@fbihh.informatik.uni-hamburg.de
Organization: Virus Test Center, University of Hamburg
Date: 27 Jan 93 21:24:30 GMT

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

Date: 27 Jan 93 21:24:30 GMT
patlak@med.uvm.edu (Joe Patlak) writes:

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

Nah, doesn't work... :-( Several sites (including ours) have disabled
the possibility to be fingered from the net, for security reasons...

Another idea is to design a new protocol, similar to that of finger,
but simpler, which does only one thing - returns the public key of a
particular user. Any volunteers to write the appropriate RFC?

Regards,
Vesselin

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

iQCVAgUBK2b+xjZWl8Yy3ZjZAQFxxwP+PK4dZn7TkADP1pZfR8/MKwFgxaYwUwH6
7GJU9yOSlnqFNdVYeIbUxxoovmaWMkojyyUphEVntz8KwMDcl3AhcQJCy7zTANt2
9xDm0n0RjQFiXJqAy/8CbkhBly8lBKVINO9rbqZ65YuwUwF5PynGCtvC1qI1Ed9r
kN9EnjVIpqU=
=ficY
-----END PGP SIGNATURE-----
-- 
Vesselin Vladimirov Bontchev          Virus Test Center, University of Hamburg
Tel.:+49-40-54715-224, Fax: +49-40-54715-226      Fachbereich Informatik - AGN
< PGP 2.1 public key available on request. > Vogt-Koelln-Strasse 30, rm. 107 C
e-mail: bontchev@fbihh.informatik.uni-hamburg.de    D-2000 Hamburg 54, Germany
Xref: sparky sci.crypt:7110 alt.security.pgp:591 alt.security.ripem:138 misc.legal.computing:2517
From: djb@silverton.berkeley.edu (D. J. Bernstein)
Newsgroups: sci.crypt,alt.security.pgp,alt.security.ripem,misc.legal.computing
Subject: Not illegal to import PGP into U.S.!
Date: 23 Jan 93 05:28:27 GMT
Followup-To: misc.legal.computing
Organization: IR
X-Mail-Warning: Do not reply by mail---silverton not configured yet.

In article <1993Jan23.030558.4357@netcom.com>,
in a silly attempt to show that ITAR prevents the import of PGP into the U.S.,
strnlght@netcom.com (David Sternlight) writes:
> 123.2 Imports.
> No defense article may be imported into the United States unless (a)
> it was previously exported temporarily under a license issued by the
> Office of Munitions Control; or (b) it constitutes a temporary
> import/intransit shipment licensed under Section 123.3; or (c) its
> import is authorized by the Department of the Treasury (see 27 CFR
> parts 47, 178, and 179).

Yes, Sternlight. Why don't you read the law you're quoting?

ITAR covers *permanent* exports, *temporary* exports, and *temporary*
imports. *Permanent* imports are under Treasury control.

The regulations above talk about (a) *temporary* exports, under DTC,
(b) *temporary* imports, under DTC, (c) *permanent* imports, under the
Department of the Treasury.

For PGP we're talking about *permanent* imports. ITAR doesn't apply.
Treasury Department regulations do.

---Dan
From: djb@silverton.berkeley.edu (D. J. Bernstein)
Newsgroups: sci.crypt
Subject: Re: Is there a single person here who agrees with David Sternlight?
Date: 25 Jan 93 20:47:26 GMT
Organization: IR
X-Mail-Warning: Do not reply by mail---silverton not configured yet.

In article <TYTSO.93Jan13212750@SOS.mit.edu> tytso@athena.mit.edu (Theodore Y. Ts'o) writes:
> The only problem about RIPEM is that it doesn't use certificates.  As
> far as I'm concerned, if it doesn't use certificates, it's not useful.
> Relying on a certificate server is tantamount to "authentication by IP
> address", which is only one step above "authentication by assertion".

Relying on the structure defined in the PEM ``standard'' is tantamount
to ``authentication by Bidzos assertion,'' which is one step below.

---Dan
Newsgroups: sci.crypt
From: frank@hsr.no (Frank A Stevenson)
Subject: Re: Toggle rot-13 decode..
Organization: Rogaland University Centre
Date: Wed, 27 Jan 1993 09:44:56 GMT

In article <C1Ho7r.J1M@eis.calstate.edu>, ribarbe@eis.calstate.edu (Richard Eldon Barber) writes:
> 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

	ROT-13 encryption, is encryption, but it is designed to be secure against
people not wanting to read the encrypted message. (i.e. NOT secure)

Here is a small c-source that reads from standard input and writes the encrypted
text to standard out. Note the cipher is symmetrical and the same routine will
thus encipher and decipher a text

examples of usagege (UNIX)

%rot <infile >outfile
%

The source should be easy to modify, so it will work under other modes of
operation.

----------------------------------------------------
#include<stdio.h>

main()
{
char ch;
int i;

while(1) {
   ch=getchar();
   if (ch==EOF) return(0);
   if (islower(ch)) {
      i=(int)ch;
      i=i+13;
      if (i>122) i=i-26;
      ch=(char)i;
      }
   if (isupper(ch)) {
      ch=ch+13;
      if (ch>'Z') ch=ch-26;
      }
   putchar(ch);
   }
}
---------------------------------------------------

><>
Newsgroups: sci.crypt
From: jac54@cas.org ()
Subject: Re: Spycatcher
Organization: Chemical Abstracts Service, Columbus, Ohio
Date: Mon, 25 Jan 1993 15:40:16 GMT

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.
>
	Alec Chambers
Newsgroups: sci.crypt
From: bontchev@fbihh.informatik.uni-hamburg.de (Vesselin Bontchev)
Subject: Re: PGP messages readable by more than one person
Reply-To: bontchev@fbihh.informatik.uni-hamburg.de
Organization: Virus Test Center, University of Hamburg
Date: 25 Jan 93 19:35:49 GMT

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

gtf1000@cus.cam.ac.uk (G.T. Falk) writes:

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

This has been discussed in alt.security.pgp. Yes, it can be easily
implemented and indeed in the way proposed by you. Version 2.2 of PGP
will have this feature. The only problem will be that such "multiple
encrypted" messages will not be readable by older versions of PGP
(just like a clearsig message is not verifiable with PGP 2.0).

Regards,
Vesselin

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

iQCVAgUBK2RBnTZWl8Yy3ZjZAQG4sAQAx2S6zmecm//Y+jvS5HKd1QlQoTTQiCMC
7wsBR/wETDAO1+7S4DgGkPAvEjHK/M5ldEtoWJOPoKCpV4enfUEOjve96gohQbJB
Cb2BsH84xQ5+i3P7zxu9Dwd3zxRF01O27W91Bhobax3bIA+2B7/ZxzEIpJ0DogO0
uPCzr171Y9E=
=a3Zs
-----END PGP SIGNATURE-----
-- 
Vesselin Vladimirov Bontchev          Virus Test Center, University of Hamburg
Tel.:+49-40-54715-224, Fax: +49-40-54715-226      Fachbereich Informatik - AGN
< PGP 2.1 public key available on request. > Vogt-Koelln-Strasse 30, rm. 107 C
e-mail: bontchev@fbihh.informatik.uni-hamburg.de    D-2000 Hamburg 54, Germany
Newsgroups: sci.crypt
From: hanche@ams.sunysb.edu (Harald Hanche-Olsen)
Subject: Re: Toggle rot-13 decode..
Organization: University at Stony Brook, NY
Date: Wed, 27 Jan 1993 18:42:17 GMT

>>>>> In article <1993Jan27.094456.10542@hsr.no>, frank@hsr.no (Frank
>>>>> A Stevenson) writes:

Frank> Here is a small c-source that reads from standard input and
Frank> writes the encrypted text to standard out. Note the cipher is
Frank> symmetrical and the same routine will thus encipher and
Frank> decipher a text

Frank> examples of usagege (UNIX)

Frank> %rot <infile >outfile

[ twentyish-line C program deleted ]

Hrmf.  The rot program is already there, on any Unix box.  It is
called tr:

$ rot () { tr 'a-zA-Z' 'n-za-mN-ZA-M' }
# for csh users: alias rot tr 'a-zA-Z' 'n-za-mN-ZA-M'
$ echo 'Render unto Caesar...' | rot
Eraqre hagb Pnrfne...
$ echo 'Render unto Caesar...' | rot | rot
Render unto Caesar...

[ I hope I am not violating the ITAR by posting this ... :-) ]

- Harald