 A workaround to this is to use a simple permutation function instead of a table stored in program memory.However, using a too simple function, such as codice_1, partly defeats the usability as a hash function as anagrams will result in the same hash value; using a too complex function, on the other hand, will affect speed negatively.Using a function rather than a table also allows extending the block size.