(Or any other such mathematical manipulation, this is just an example.) Do a bitwise-negative on any byte whose serial number in the file has a repeated digit sum which is prime.Use a weak well-known encryption algorithm on the original data, then:.It would be a seemingly meaningless string of characters.įor example, say that the home-brew algorithm is like this: ![]() ![]() How would I crack it? I wouldn't even know where to begin. It makes sense to me that a home-brew algorithm is a very bad idea, but there's one thing I'm not understanding.Īssume I'm an attacker, and I am faced with an weak-but-unknown encryption algorithm developed by 'Dave'. (Actually hashing algorithm rather than encryption, but my question applies to both.) ![]() It shows a weak home-brew algorithm developed by 'Dave', and the answers discuss why this is a bad idea.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |