From c80b0613140be8478a55dfa170848583b9c2272b Mon Sep 17 00:00:00 2001 From: WitherOrNot Date: Wed, 20 Sep 2023 00:12:52 -0400 Subject: [PATCH] Update BINK.md --- BINK.md | 9 --------- 1 file changed, 9 deletions(-) diff --git a/BINK.md b/BINK.md index 7da1e18..cbf35e7 100644 --- a/BINK.md +++ b/BINK.md @@ -23,15 +23,6 @@ In the ideal scenario, the keygen would ask you for a BINK-resource extracted fr Knowing these segments, the keygen would bruteforce the geneator order `genOrder` using Schoof's algorithm followed by the private key `privateKey`, leveraging the calculated `genOrder` to use the most optimal Pollard's Rho algorithm. There's no doubt we can crack any private key in a matter of 20 minutes using modern computational power, provided we have the working algorithm. -Once the keygen finishes bruteforcing the correct private key, the task boils down to actually generating a key, **which this keygen does**. -To give you a better perspective, I can provide you with the flow of the ideal keygen. Crossed out is what my keygen implements: -* ~~BINK resource extraction~~ -* Bruteforce Elliptic Curve discrete logarithm solution (`genOrder`, `privateKey`) -* ~~Product Key processing mechanism~~ -* ~~Windows XP key generation~~ -* ~~Windows XP key validation~~ -* ~~Windows Server 2003 key generation~~ - # Principle of operation We need to use a random Raw Product Key as a base to generate a Product ID in a form of `AAAAA-BBB-CCCCCCS-DDEEE`.