3500+ entries in 0.197s

mircea_popescu: asciilifeform btw it occurs to me that your proposed padding scheme, while not useful as a
rsa padding scheme, nevertheless may be rescued into a very serviceable hash function, which has the notable property that a) acordion and b) user settable output size. something like this : let R be a ring buffer of as many bits as the user specified the output should be, let M be the message. let there be a one bit state machine S = 0