[EDIT] I have completely rephrased the question to try to be more concise and clear
I am looking for a 1-1 function, encode, such that
encode( 32_bytes_of_data ) => {w_1, w_2, ..., w_n}, where:
Ideally: - n should not be the same for all input values, but it is not a super important requirement.
The goal - to make public keys more human readable and recognisable.
If you're not worried about manual inspection and only seek to protect against obvious regexes, there's a couple of alternatives, with increasing annoyance-factor:
ROT13 has been used on usenet countless times for this kind of thing. It would defeat base-64 detection
Use the 256 bits as an integer, and use its base-10 representation in ASCII. It'll look like this: 115792089237316195423570985008687907853269984665640564039457584007913129639936
you can encode previous number into a look-and-say sequence and spell it: two one, one five, one seven...
Encode the 256 bits into a base-26, and use the encoded 26 letters of the alphabet as the first character of each word on a phrase. You'd need about 55 words. If you're feeling creative, you may use the first two characters of each word, and reduce that to 27, but you may have to use very strange words indeed. If you don't care about appearance, just post the 55 characters: ennjuuzflkeenzhszxamvlrnusvcpknavbgzllukzllrkvatszirbkq
If you want to use unicode, there's 110,000 different characters. Assuming only half of those are printable, it's a bit more than 15 bits of entropy per character, so you'll need 17 characters to encode 256 bits
If you and your recipient can pre-share any amount of data (you must at least share knowledge about the "steganographic" method), you could assign a numeric value to each word in a dictionary. There's about 1,000,000 words in the English language, so each one has about 20 bits of entropy. You'll need 256/20=13 words. Bonus points for generating a key which encodes to correct syntax and grammar and rewriting Jabberwocky