quelsolaar

50 ms·

1. 541.▲
   by quelsolaar 13y ago

   The answer should be no. But I don't know.
2. 542.▲
   by quelsolaar 13y ago

   No algorithm can ever be harder to crack then trying all permutations of the key: in other words brute force. The purpose of any encryption algorithm is to make it as close to impossible to crack it in any less time consuming way. One could
3. 543.▲
   by quelsolaar 13y ago

   In very bad at publicizing the things I do.... This year I have been working on a bunch of new things: I have written a SDL/GLUT replacement: http://www.youtube.com/watch?v=oMJP6vlsmbE And a new library to create widg
4. 544.▲
   by quelsolaar 13y ago

   This looks fishy to me. Follow my thought: If you are looking at the very first value coming out of the stream, that value should have zero bias from the algorithm. Why? because it is an xor of two different values in the key. If both value
5. 545.▲
   by quelsolaar 13y ago

   I note in the comments that the random number generator is not secure in any way. Its just a handy thing for testing, not something you would use in real life.
6. 546.▲
   by quelsolaar 13y ago

   I'm not really sure how you can get similar results with completely different keys. I'm looking in to this. I tried generating a meg encrypted zeroes in 8bit mode and the most used 8 bit value was only 1% more common then the leas
7. 547.▲
   by quelsolaar 13y ago

   Maybe, if no one can find a glaring problem with it. I think using in in a game would be a good place to test it since the world doesn't fall over if it is broken.
8. 548.▲
   by quelsolaar 13y ago

   My hope is that this one would be fun for others to break, rather then me having grand illusions of knowing better then everyone else. I know a fair bit about security from an engineering standpoint, but wouldn't call myself a master.
9. 549.▲
   by quelsolaar 13y ago

   How would you go about this? Obviously the key is smaller then the message (otherwise we would use one time pad and be done with it) The key needs to be large enough that A, it cant be guessed, and B so that the branches of possible positio
10. 550.▲
    by quelsolaar 13y ago

    Thanks! Its been driving me crazy to try to crack it. It cant be this easy right.....? I thought a lot about the possible starting point for the algorithm, but i found having it just be "unknown" like this was all that was needed.
11. 551.▲
    by quelsolaar 13y ago

    Here is a C implementation I just banged together. http://www.quelsolaar.com/crypto_test.c (yet another possible source of embarrassment) Ill try to put together a "test" for the algorithm.
12. 552.▲
    by quelsolaar 13y ago

    Well your key doesn't have much entropy to begin with.... On a more serious note, the code you written uses a 8bit key. you need to change the line: (key[pos_c] << 31) | (key[pos_c] >> 1); to: (key[pos_c] << 7) | (ke
13. 553.▲
    by quelsolaar 13y ago

    I did, but I couldn't find anything. its very evenly distributed even if the plain text just zeroes. Again, I'm not sure some one else cant find any bias just because I couldn't.
14. 554.▲
    Can you break my home rolled encryption?(news.quelsolaar.com)

    103 points by quelsolaar 13y ago|64 comments