I've written this one long time ago, just found it in my archive.

Worth to give a try!

BTW NO BRUTE FORCE!

Keygenme.zip

good one, though very basic math

kg.rar

haha, good work!

My try My C++ skills suck big time.. so dont expect too much

Keygen(FunnyKGM).rar

heh, bruter.

bruter ??

Source :

 http://pastebin.com/wwASYrwf

You call this bruter

br

KKR

Edited July 26, 201114 yr by KKR_WE_RULE

What do you call this?

while (mpz_cmp(bGCD, one) != 0)

Try check qpt source and understand what is he doing. Although seems you've already examined it, but not good enough!

I did check his source but after writing my keygen.

Checking for GCD is a mandate here, as Inverting is the next operation that follows ie Modular Inverse Exists ONLY if they numbers are coprime ie GCD(num1, num2) == 1.

Sure thing the c++ implementation sucks..

And if using a while loop to check gcd is bruting, so is using .repeat .. .until blocks..

Best Regards

KKR

I didn't check the lines after the loop and didn't notice you've used inverse too, because the code is crap.

Your keygen has a delay on key generation. You did something wrong or your implement sucks, whatever I don't really care.

My try. No biglib used, implemented my own GCD proc and modular inverse based on Extended Euclidean algo.

Thanks for the challenge!

N1ghtm4r3.Funny.Keygen.zip

Edited July 27, 201114 yr by Saduff

hey Saduff

nice work there and happy birthday, mate