[cryptography] non-decryptable encryption
givonne at 37.com
Wed Jun 20 12:25:04 EDT 2012
yes. and i covered this. esp. when the issue applies to the stenagraphic component. using phi as a model of the method. but, phi is well known & predictable. however, other sequences not.
--- jthorn at astro.indiana.edu wrote:
From: Jonathan Thornburg <jthorn at astro.indiana.edu>
To: jamesd at echeque.com, cryptography at randombit.net
Subject: Re: [cryptography] non-decryptable encryption
Date: Tue, 19 Jun 2012 08:30:59 -0400 (EDT)
The digit sequence
(or its equivalent in binary, hex, or your other favorite base)
never repeats, but provides no security whatsoever. One-time pads
need nonrepeating sequences *which the adversary can't predict*.
-- "Jonathan Thornburg [remove -animal to reply]" <jthorn at astro.indiana-zebra.edu>
Dept of Astronomy & IUCSS, Indiana University, Bloomington, Indiana, USA
"Washing one's hands of the conflict between the powerful and the
powerless means to side with the powerful, not to be neutral."
-- quote by Freire / poster by Oxfam
cryptography mailing list
cryptography at randombit.net
You @ 37.com - The world's easiest free Email address !
More information about the cryptography