Thanks, I guess that means I have to rewrite a good chunk of the code since the xor function works exlusively with hex.

You don't convert from b64 -> hex, you need to do b64 -> binary

You don't convert from b64 -&gt; hex, you need to do b64 -&gt; binary

For those who don't know, [Cryptopals](https://cryptopals.com) is a set of cryptography challenges. Anyway, I am a bit lost on [challenge 6](https://cryptopals.com/sets/1/challenges/6).

The thing is, I have a good idea on what I have to do, but you know what they say: the devil is in the details. What I do is convert B64 to hex, calculate the hamming distance and find canditate keysize n. I then use the algorithm from [exercise 3](https://cryptopals.com/sets/1/challenges/3) to a string made from every nth character. I have tried this method with over 50 canditate keysizes and none is producing any valid ascii input, any help?

Vigenère cipher python implementation help.