How it works

The Huffman Code itself is actually not intended for encryption but for compressive encoding of information without loss.

The outcome of the algorithm, developed 1952 by David A. Huffman, is classified as a variable-length code which means the extent of the „0-1..“ sequence per information piece differs, based on its occurance in the main data.

Or to make a long story short – the character „a“ in the word „abrakadabra“ would get encoded with a shorter code than „k“.