[148801] in cryptography@c2.net mail archive
Re: [Cryptography] deniable symmetric ciphers?
daemon@ATHENA.MIT.EDU (andrew cooke)
Sat Dec 28 12:48:43 2013
X-Original-To: cryptography@metzdowd.com
Date: Sat, 28 Dec 2013 14:10:40 -0300
From: andrew cooke <andrew@acooke.org>
To: Paul Elliott <pelliott@blackpatchpanel.com>
In-Reply-To: <20131228041824.GA32378@BlackPatchPanel.com>
Cc: cryptography@metzdowd.com
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
you may be looking for "distinguishing attack". so, for example
https://www.google.cl/search?q=distinguishing+attack+aes shows that there is
some relevant resource for AES.
see also http://en.wikipedia.org/wiki/Distinguishing_attack
ideally, ciphers should not have such attacks, but they seem to be fairly
common (perhaps because they are often easier than anything else - you only
need to find some statistical irregularity, not exploit it; also they are
often innocuous and require large amounts of data).
you may be asking "is there any common symmetric cipher with no known
distinguishing attack?" - but i don't know the answer to that.
there are other problems implicit in your question, as others have said.
andrew
On Fri, Dec 27, 2013 at 10:18:24PM -0600, Paul Elliott wrote:
>
> Call a symmetric ciphers deniable if it is computationaly
> difficult to distinguish it's output from random data
> even if it's plaintext is highly ordered or even known.
>
> Are there any strong published deniable ciphers?
>
> Thank You.
>
>
> --
> Paul Elliott 1(512)837-1096
> pelliott@BlackPatchPanel.com PMB 181, 11900 Metric Blvd Suite J
> http://www.free.blackpatchpanel.com/pme/ Austin TX 78758-3117
> _______________________________________________
> The cryptography mailing list
> cryptography@metzdowd.com
> http://www.metzdowd.com/mailman/listinfo/cryptography
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
