A new encryption problem?

Article View: sci.crypt

Article #1174

#1174

From: Eric Silber
Date: Fri, 06 Nov 1992 02:38

18 lines
1027 bytes

 PROBLEM:
    create a secure encryption algorithm which has the following
    characteristics:

    Let 'p' be the plain text.
    Let 'E' be the encryption transformation.
	Let 'c' be the cipher text.

    Require: (for-all p)( (c=E(p)) is a text which appears to be
                                   a plaintext)

    That is, the ciphertext does not appear to be a cipher text.

    Also, there are no auxillary indices or auxillary data of any kind.

    (not being a cryptologist, i'm sure this is not a new problem,
     i just haven't heard of such a tool as the 'E' i'm speculating 
    about here)

Technical Details

Message-ID: <lfjmkiINNa74@exodus.Eng.Sun.COM>

Path:

arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!decwrl!sun-barr!news2me.EBay.Sun.COM!exodus.Eng.Sun.COM!orfeo.Eng.Sun.COM!silber

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!decwrl!sun-barr!news2me.EBay.Sun.COM!exodus.Eng.Sun.COM!orfeo.Eng.Sun.COM!silber
From: silber@orfeo.Eng.Sun.COM (Eric Silber)
Newsgroups: sci.crypt
Subject: A new encryption problem?
Date: 6 Nov 1992 02:38:10 GMT
Organization: Sun Microsystems, Mt. View, Ca.
Lines: 19
Message-ID: <lfjmkiINNa74@exodus.Eng.Sun.COM>
NNTP-Posting-Host: orfeo