Self-compiled resharper V1.0 registration machine Journal (3)-success :)

I am writing this for learning and research purposes only. It is also my own experience. After registration, the plug-in can be used to play at home, but it is best not to develop products, not for commercial purposes, JBuilder The lesson is profound. As a company, it is better to buy a genuine copy. This money is not expensive for the company. I am not liable for any copyright issues.

Self-compiled resharper V1.0 registration machine journal account (1) -- going into battle, analysis, hitting the wall

Self-compiled resharper V1.0 registration machine sequential account (2) -- AnalysisAlgorithmPain



Iv. Success

God is here, that is, to mobilize the power of the masses and climb up in the middle of the night MSN , Mobilize the masses to help me find efficient RSA Analysis tools or algorithms, Iceshark Brother finds three or four RSA Tool, which is called Rsatool It looks quite professional. No matter what it is, use it first.

Luck is good, and the result is: I thought it would take a few days.IcesharkThe chat was completed in just a few minutes. I can't believe it.

The result is as follows,P,QAll come out :)

P: 76934561593903517890538965067

Q: 44708964245672789920122782207

E: 3439664563558343388897268028516178220150974083190422162869

BecauseBigintegerThe calculated prime number is not necessarily correct, so I am not sure that it has been successful. But always try. SetP,QRespectively into the formula

Z = (p-1) * (Q-1)

* Z = 3439664563558343388897268028394534694311397775379760415596

OK.Z,DThat's done.

Now P , Q , Z , E , D , Mi , Ci All of them know about encryption. What's more difficult? Just use the formula.

Complete this registration machine :),Vs.net 2003Written.

Try it with the calculated number, haha.

OK, Success :)

 

The following are the core algorithms of the registration machine.WinformOperation :)

In this way,CodeIt's easy:

// Generate license

// Apsara again reminds us that this code is only used for learning and research and never used for commercial purposes. Otherwise, copyright disputes will be troublesome.

Private   String Getlicense ()

{

Int Iuserhash = Userhash ();


// Basic seed, that is, find the plaintext of the endless license

Biginteger bigbaseseed =   New Biginteger (( Long ) 65535 );

Bigbaseseed <=   56 ; // In the verification code, 56 bits are moved to the right, and 56 bits are moved to the left.

Bigbaseseed + =   New Biginteger (( Long ) Iuserhash ); // To make ischecksum return true


// The public key acts as N.

Biginteger bigpublickkey =   New Biginteger (constants. public_key, 10 );


// Private Key acts as Z

Biginteger bigprivatekey =   New Biginteger (constants. private_key, 10 );


// Username calculation acts as E

Biginteger bigusername =   New Biginteger (encoding. Default. getbytes (_ username ));

Bigusername | =   1 ;


// Get the most important key d

Biginteger bigd = Bigusername. modinverse (bigprivatekey );


// Set encryption formula CI = n ^ d mod n

Biginteger biglicense = Bigbaseseed. modpow (bigd, bigpublickkey );



Return (Convert. tobase64string (biglicense. getbytes ()));

}


// Userhash, which is directly copied from the decompiled source code

// Determines whether the user name matches the license.

Private   Int Userhash ()

{

Int I =   0 ;

For ( Int J =   0 ; J < _ Username. length; j ++ )

{

I=(I< 7)+_ Username [J])%65521;

}


For ( Int K =   0 ; K < _ Company. length; k ++ )

{

I=(I< 7)+_ Company [k])%65521;

}

Return (I );

}

To prevent problems, the registration machine is no longer available for download.

If you need a brother, please be here.ArticleFind the "source of inspiration" and find the download link in the comments.

I am always sending emails, so I have no energy.

The registration machine is really not used for commercial purposes, just play it yourself.