I'm writing a multi-length-output hash function, but I've hit as stumbling block: how can i break up input data in such a way that the program will not have to deal with extremely long lists or run too many loops for the given data?
a = input length in bytes, a>=0 b = output length in nibbles, b>0
minimal padding is done to the data before running the actual hash, so the input length is basically the same as the post-padded length. data is broken up into n sized pieces and expanded into a list
can anyone come up with a f(a) or f(a,b)? if you need any more information just ask