>>3
Let's put it this way. Any text can be a tripcode. To demonstrate, I have written the following in my ``Name:'' field: Anonymous#Any text can be a tripcode
Name:
Anonymous2012-03-04 17:19
>>4
I know what a tripcode is, genius. So you ``discover'' the result of a one-way function? There's got to be a better term for it.
"Testing" them, then. Just do this for a lot of strings (example Ruby code):
salt = ("%sH." % string)[1..3]; string.crypt(salt)[3..12] =~ regexp
Then optimize it (rewrite it in C, use a fast crypt function etc.) Brute-force is really the only thing you can do. (I found this tripcode using that code in a loop)
Name:
Anonymous2012-03-04 17:39
>>6
I already know that, you faggot. Stop telling me obvious stuff, you autist.
>>10
I already DOUBLE know that, you… ``double faggot''!
Name:
Anonymous2012-03-04 17:46
Take at most 8 bytes of input.
Use only 7 bits from each of the bytes in input up to a maximum of 56 bits as a key.
Append the string "H.." to the input, use six bits each from the second and third character as a 12 bit salt.
Now run this key through 25 rounds of DES salted with our 12 bit salt and that is your tripcode.
The program you posted a reference to uses a SIMD version of this algorithm, popularly called bitslicing, to create a lot of tripcodes and then checks the output for the given search string/regex.
The algorithm the imageboards use modifies its input before creating the tripcode, they translate the input from UTF-8 to SHIFT-JIS, if any of the characters '>', '<', '"' or '&' are found they are substituted for their respective HTML entities.
>>10
The fact remains that you're communicating very poorly and screaming when people don't understand what you want. Projecting your personal issues on everyone you talk to can't possibly help much either.
Do you expect us to read minds, Mr. Bond?
Name:
Anonymous2012-03-04 17:54
>>13
You're the one with the communication and projection issues, buddy.