Re: Shifting alphabets

From: Douglas A. Gwyn (DAGwyn_at_null.net)
Date: 09/29/05 

Date: Thu, 29 Sep 2005 20:18:28 GMT

ht9j35r02@sneakemail.com wrote:
> For any given plaintext alphabet of length N, is it possible to find a
> crypt alphabet arrangement that can NOT be shifted into a position
> where it has zero collisions with the plain text alphabet.

That is an interesting question. If your idea that it is possible
exactly when N is odd is correct, perhaps a proof could be found
based on the decomposition of every permutation into the product
of 2-cycles. Good luck!