Permutations;
From: mklooptbd (mklooptbd_at_yahoo.com)
Date: 04/26/03
- Next message: Roger Schlafly: "Re: RIP proof secret splitting"
- Previous message: Mok-Kong Shen: "Re: Cohen's paper on byte order"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 25 Apr 2003 16:45:48 -0700
Hi, I know it's not the Puzzles ng; I've been trying to analyze an
encoder which works by both permuting and substituting, the
substitution isn't a problem and neither is the permutation since I
found out a way to get the permutation table, however I can't seem to
find a formula to define it (I'm not sure there is one but it seems
logical that there should be). Following is a small table of
permutations (ordered by length of a string):
DEF: (1 3 2) -> 1 goes to 1; 2 goes to 3; 3 goes to 2;
1
2 1
2 3 1
1 3 2 4
2 4 3 1 5
6 5 3 4 1 2
5 2 4 1 7 3 6
8 4 7 5 6 1 3 2
Can anyone see a pattern? thanks a bunch;
- Next message: Roger Schlafly: "Re: RIP proof secret splitting"
- Previous message: Mok-Kong Shen: "Re: Cohen's paper on byte order"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]