| 2012-02-05 23:25:13 |
al1ce |
description |
The OTP encryption module is currently using addition and then modulo division to preform encryption but XOR encryption would be much better since it works at the bit level and it would probably be faster.
XOR can be preformed by PyCrypto (which is probably fast, at least if the faster math stuff is available). Otherwise, the following code probably works but could use some testing.
[chr(ord(p) ^ ord(o)) for plain[i],otp[i] in range(len(plain))]
"".join on above |
The OTP encryption module is currently using addition and then modulo division to preform encryption but XOR encryption would be much better since it works at the bit level and it would probably be faster.
XOR can be preformed by PyCrypto (which is probably fast, at least if the faster math stuff is available). Otherwise, the following code works, however is significantly slower than XOR in PyCrypto.
"".join(chr(ord(p) ^ ord(o)) for plain[i],otp[i] in range(len(plain)) |
|
