Hi All, I'm currently programming a set of crypto challenges in order to get a deeper understanding of python and crypto. The problem is to break a repeating key xor data (in a file). In order to do that I need a function to calculate the hamming distance between two strings. To find that one needs to find the differing number of *bits* in a string. Any ideas on how to manipulate the string at bit level? This is my first time in writing a question to the mailing list so please let me know anything that I need to keep in mind while asking questions. Thanks in advance. Gracias Nemo -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://mail.python.org/pipermail/python-dev/attachments/20151017/40c70f7b/attachment.html>
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4