encryption

i created a html file which does CBC encryption in javascript and converts the result to hex. What does anon think about encryption? For me it's like safe sex (interesting, but too much of a nuisance to actually practice it).

http://www.2shared.com/file/3163087/1a14b3fa/stream.html


DA5CAE33789E8D00A8E1D2DACDC44A44C58F91369999FE4678769A3F9450
6F16C98212F7270E8201D856C8262417535452FBFC52CDEC977607702853
847CF5040BDA9EAF98C4CE0E54136C5CFC6BBE72541B5003C8F4DFB5BEE6
BB89EB076DA678551B50C1A53F1F6FEA2F7D2298D806F050F738DB281248
7BA2F476EA8169528FAA589C076CB0CF4349CC0FE9DD5EF771FB6A0E5413
CEF67F370D4E3404191BAB68641F2C106FD277BB5CF29CAF66259F16271B
F6A2E3C6846D0F60038D7E01E8EB529D

in b4 sGTFO

shit, according to wikipedia:

>Unlike Blum Blum Shub, the algorithm in its native form is not suitable for cryptography. Observing a sufficient number of iterates (624 in the case of MT19937) allows one to predict all future iterates. Combining the Mersenne twister's outputs with a hash function solves this problem, but slows down generation.

and

>BBS takes the form:
x_n+1 = (x_n)² mod M

>where M=pq is the product of two large primes p and q. At each step of the algorithm, some output is derived from x_n; the output is commonly either the bit parity of xn or one or more of the least significant bits of x_n.

what would be easier, using BBS or Hashing the mersenne twister?

>The Mersenne Twister algorithm has received some criticism in the computer science field, notably by George Marsaglia. These critics claim that while it is good at generating random numbers, it is not very elegant and is overly complex to implement. Marsaglia has provided several examples of random number generators that are less complex yet provide significantly larger periods. For example, a simple complimentary-multiply-with-carry generator can have a 10^33000 longer period, be significantly faster, and maintain better or equal randomness.

does anybody know how to write a simple complimentary-multiply-with-carry generator in javascript?