U can also randomize the alphabet as the alphabetKey. And then make decoder (alphabetKey, Key) to decode the message. This way, instead of randomly guessing the key, they also have to know the actual randomized alphabet. This gives a lot of different permutations. As for every possible randomized alphabet permutation, you multiply that by the different keys you can use (in this case, it's 1-25 as anything else will just wrap around. Which is really easy to crack because you'd only have guess the key a maximum of 25 times before u get the right key if u used an ordered alphabet). If ur curious, randomized alphabet without repetitions makes 67,108,863 permutations. Multiplied by the 25 core keys before it starts wrapping around, that's 1,677,721,575 different combinations
U can also randomize the alphabet as the alphabetKey.
And then make decoder (alphabetKey, Key) to decode the message.
This way, instead of randomly guessing the key, they also have to know the actual randomized alphabet.
This gives a lot of different permutations. As for every possible randomized alphabet permutation, you multiply that by the different keys you can use (in this case, it's 1-25 as anything else will just wrap around. Which is really easy to crack because you'd only have guess the key a maximum of 25 times before u get the right key if u used an ordered alphabet).
If ur curious, randomized alphabet without repetitions makes 67,108,863 permutations.
Multiplied by the 25 core keys before it starts wrapping around, that's 1,677,721,575 different combinations