Algorithm encryption - Page 2
Page 2 of 2 FirstFirst 12
Results 11 to 18 of 18

Thread: Algorithm encryption

  1. #11
    Member
    Join Date
    Oct 2001
    Posts
    60

    Re: why shareware

    Originally posted here by Casablanca
    There actually no reason for making it shareware other than for advertising me . Ypu r absolutely right about having more protection if I wanted to make it demo/shareware properly... but I am not poficient enough in programming for that. I would have to learn some techniques first. Now, if someone wants to teach me, please do.

    Cheers

    well first try making it not shareware because shareware is just another rls for me ;P
    Make a demo which doesnt actualy have all the features in it which makes it pretty much impossible (or ****ing annoying) to crack.

    Or, you could pack the hell out of it using some lame packer like asprotect (which claims to be unpackable, but definently is). That's what most shareware authors do.....relying on a packer/protector is normally like asking someone to crack your program for a challenge.

  2. #12
    Junior Member
    Join Date
    Mar 2002
    Posts
    10

    shareware/demo

    Well, it sounds to me like the demo is better than the shareware...

    One question... what does "rls" mean? (Real Lamer shite?... maybe?)

  3. #13
    Senior Member
    Join Date
    Sep 2001
    Posts
    138
    if you only use the key one time, yes it would be a one time pad. But using it over and over is also an option, and nearly as secure. As long as the key never falls into the hands of someone else, yeah...it will be secure, simply because there is no "cheater" way to undo an XOR unless the pattern repeats. Also one other note to remember, if you transmit more than one message using this meathod, it gets slightly less secure with each message. "Technically" you can break it using two ciphertexts and a LOT of spare time, simply because you can XOR the word over and over on the key at different offsets and get "pieces" of the plaintext, which can then be used to obtain parts of the key, and try them against the other ciphertext. But anyway...enough about that....
    http://www25.brinkster.com/cheeseball

    -- Do not dwell in the past, do not dream of the future, concentrate the mind on the present moment--

  4. #14
    Junior Member
    Join Date
    Mar 2002
    Posts
    10

    Smile Modified version

    Hi again... Ihave been revising my code and realized I could modify it to make it clear and waste less memory. Now the main key is always of type double, although the user inputs it as an int. These reduces the extra variable I defined as x. The method Iterate() is now clearer to see because it needs no scaling as I had before.

    Thank u all for your comments.

  5. #15
    PHP/PostgreSQL guy
    Join Date
    Dec 2001
    Posts
    1,164
    This has been one of the best threads I've read in a long time. Very informative!
    We the willing, led by the unknowing, have been doing the impossible for the ungrateful. We have done so much with so little for so long that we are now qualified to do just about anything with almost nothing.

  6. #16
    Junior Member
    Join Date
    Mar 2002
    Posts
    10

    Fix one little problem

    Right... this is the final version of the class TRHCryptor using the algorithm described. It fixes one little problem that occurs in the previous versions. Now, x is not allowed to be negative.

    Thanx again to everyone.

  7. #17
    Senior Member
    Join Date
    Sep 2001
    Posts
    138
    I think I remember the math problem you are using from somewhere, is it called a raki series?
    http://www25.brinkster.com/cheeseball

    -- Do not dwell in the past, do not dream of the future, concentrate the mind on the present moment--

  8. #18
    Junior Member
    Join Date
    Mar 2002
    Posts
    10
    It's good to know... I never heard of it

    thanx

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •