On Sat, 7 May 2005 13:51:40 +0200, rumours say that "Anthra Norell" <[EMAIL PROTECTED]> might have written:
>Here's the challenge. Prove this breakable > >'\x10\x88d\x1d\xba\xa1\xdcK\x05w\x02/s\xa7Q0\xeb8\xb6Gx\xef\xcb\x1e=\xf5\x7f >\x9bI\xcb(\x87>\xa5\x04\xc1soF\xfd\xc6\xc6\xd9|\x971\xdb\xcdT\tw#\x86a\xdc\x >b8P\xfb=n\xda\x80\x9f\x84m\x12\x98\x98\xca=o\x0b\x8e\x08O\xb7\x0b\x04SC\x96\ >xc7\xab*\x0b\x996\x06\x86\x83(\x8dQ\x9eG\x8f$\xb2x)\xa9fv\x0c1B\x9b\r\xde\xf >fc\x08' and given that >I rolled my own for relatively short sequences, like passwords. The key is >an integer. To decrypt use the negative encryption key. I consider the >encryption unbreakable, as it is indistinguishable from a random sequence. can we suppose that the encrypted text above are the details of your credit card (number, name as written on it, expiry date, billing address and your first dog's name)? Do you trust the 'unbreakability' of your algorithm that much? -- TZOTZIOY, I speak England very best. "Be strict when sending and tolerant when receiving." (from RFC1958) I really should keep that in mind when talking with people, actually... -- http://mail.python.org/mailman/listinfo/python-list
