Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!mcnc!gatech!rutgers!husc6!necntc!necis!encore!adamm
From: adamm@encore.UUCP (Adam S. Moskowitz)
Newsgroups: sci.crypt
Subject: Algorithms and ease of decryption
Message-ID: <1724@encore.UUCP>
Date: Thu, 2-Jul-87 09:55:30 EDT
Article-I.D.: encore.1724
Posted: Thu Jul  2 09:55:30 1987
Date-Received: Sat, 4-Jul-87 06:03:44 EDT
Organization: Encore Computer Corp., Marlboro, MA
Lines: 19

I have been working with a fairly simple-minded encryption scheme of my
own design for a year or so now.  I know that it's not too hard to crack,
but it does allow for very large keys and defies simple frequency &
distribution attacks.  I use it because there are times I don't have access
to the UN*X 'crypt' program and need to hide some data from other people on
the system (private letters, personal financial plans, &c.)  In the process,
I started wondering about encrytion in general.  Specfically, how much
harder is it to decrypt something if you don't know what algorithm was used?
I don't have a very strong mathematical background, so please keep your
answer/proof simple.  An answer like "n orders of magnitude" and some simple
reasons will do.  As always, email to me and I will summarize what I get (if
anyone's interested).

Thanx.
-- 
Adam S. Moskowitz	...!{decvax,ihnp4,linus,necntc,talcott}!encore!adamm

"I'm a long time travelling here below; I'm a long time travelling away from
 my home. I'm a long time travelling here below; to lay this old body down."