Re: Decryption Program

Article View: sci.crypt

Article #3190

#3190

From: Lennart Augustsson
Date: Wed, 15 Oct 1986 19:53

8 lines
870 bytes

Monoalphabetic substitution can be handled by an algorithm described in
"Breaking Substitution Ciphers Using a Relaxation Algorithm" by Peleg and
Rosenfeld, published in CACM Vol 22 pp. 598-605 (Nov 1979).
-- 

	Lennart Augustsson
UUCP:		{seismo,philabs,decvax}!mcvax!enea!chalmers!augustss
ARPA,CSNET:	augustss@chalmers.csnet

Technical Details

Message-ID: <828@chalmers.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!mcvax!enea!chalmers!augustss

References: <2121@mtuxo.UUCP>

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!mcvax!enea!chalmers!augustss
From: augustss@chalmers.UUCP (Lennart Augustsson)
Newsgroups: sci.crypt
Subject: Re: Decryption Program
Message-ID: <828@chalmers.UUCP>
Date: Wed, 15-Oct-86 15:53:33 EDT
Article-I.D.: chalmers.828
Posted: Wed Oct 15 15:53:33 1986
Date-Received: Thu, 16-Oct-86 23:18:45 EDT
References: <2121@mtuxo.UUCP>
Reply-To: augustss@chalmers.UUCP (Lennart Augustsson)
Organization: Dept. of CS, Chalmers, Sweden
Lines: 8

Reply to Parent Message