is there a good function that can tell me how many bits a given amount of data should be broken up into so that a program does not have to run through too much data at a time, or run too many times on too little data? im still trying to find a good way to make one of my programs be more efficient. the problem is that the input size is arbitrarily large (empty string to as many gb you can come up with), and the output size can be arbitrarily large (as much as your memory can hold, basically) as well.
if you know about sha1 or md5, you know that any arbitrary data is padded and then broken up into 512 bit blocks and operated on. i cant do that because i dont pad that much, so what should i do?
Visit Calccrypto for info on crypto