Originally Posted by

**restin84** I have a question(and answer) for an assignment in my Cryptography course but I am having a hard time communicating my answer in terms that are mathematically sound.

Take an n block of bits message. Split this block of bits into 8 bit sections(assume that 8 divides n). For each 8 bit block we choose a permutation of the bits. How many different codes could come out of this?

I know that each block of 8 bits has 2^8 possible combinations. I also know that since 8|n then there is a k such that n = 8k. All the possible combinations are given by adding 2^8 a number of k times.

can I say that the total number of possible codes is given by ....

summation from i = 1 to k of [2 sub i]^8 ??????

or maybe [2 sub 1]^8 + [2 sub 2]^8 + ......... + [2 sub k]^8??????