Algorithm to generate permutations



In reading the literature on computational group theory there are many
algorithms that assume you have one or more permutations that you can
use as a generator for some computation. The problem with these
algorithms is that they do not scale very well if you have to enumerate
all the mappings of a single permutation. It would be nice to
have an algorithm to generate all the mapping of a particular
permutation.
Well ..., there are a class of algorithms that can generate a
permutation,
these are the algorithms for block ciphers. The question is can you
design a
permutation generator algorithm, aka a block cipher, that can generate
permutations with certain group properties. You might or might not
retain your key and s-boxes, but in this case they are parameters that
can be modified to get the desired computation properties.

Given the symmetric group of 2^k and a chain of subgroups of that are
sylow subgroups of the powers of 2 times all the remaining odd powers,
design an algorithm that can produce one or more generators for each
subgroup.

I would appreciate any comments.

George

.



Relevant Pages

  • Re: Multinormial Expansion in programming
    ... Do you know any permutation algorithms for this problem? ... the last two, keeping their sum the same, till you find the case (3 4 ... Partition numbers are a lot smaller than Bell numbers. ... Note, algorithm 5.12 in "Combinatorial Algorithms" by Reingold, Nievergelt, ...
    (sci.math)
  • Re: Q: Indexing a special kind of permutations
    ... There are good algorithms for doing the conversions. ... Here is C code to compute a permutation from an index and the number of each unique element, ... int main { ... int nelems, telems; ...
    (comp.programming)
  • Re: Sorting Array of Structures
    ... efficient algorithms, but they are harder to understand and you should ... But the simplest way to sort something in C is to use the predefined ... One of my favorite "pessimal" sorting algorithms is Permutation ...
    (comp.lang.c)
  • Re: What is this Matrix Algorithm Doing?
    ... algorithms on the matrix. ... inefficient and I plan to replace it. ... L is unit lower triangular, U is upper triangular and P is a permutation. ...
    (sci.math)
  • Re: Random permutation of 2 bit system. Checking on what trandom permutation means?
    ... The creation of the pointers into the table shall boil down to something ... does is to create a permutation, with the permutation of the cleartext ... random permutation by someone who does not know the key, ... sequence from a pseudo-random number generator. ...
    (sci.crypt)