 Such functions naturally have to be bijective, like their table variants.The algorithm can be described by the following pseudocode, which computes the hash of message "C" using the permutation table "T"