At address 0x4012CF there is a call to _BigMod used as follows: At 0x4012EC a call to _BigPowMod which is used as: 0x408820 = Y^M mod X, At 0x401309 another call to _BigPowMod: 0x408824 = Z^R mod X, A third call to _BigPowMod at 0x401326 : 0x408828 = R^S mod, At 0x401343 a call to _BigMulMod : 0x40882C = 0x408824 * 0x408828 mod X. I am trying to implement the El Gamal digital signature scheme, using the BigInteger class for generating large prime numbers. ElGamal digital signature scheme with the ElGamal digital signature scheme after adding a random number, then analyzed and verified its security that is improved, it turns out that the private key x and random number k are unknown to the attacker. Contact. The ElGamal signature scheme [] is one of the first digital signature scheme based on an arithmetic modulo a prime (see smash modular arithmetic).It can be viewed as an ancestor of the Digital Signature Standard and Schnorr signature scheme. ElGamal Example [] ElGamal is a public key method that is used in both encryption and digital signingIt is used in many applications and uses discrete logarithms. https://www.dropbox.com/s/4zj1goynpf791sr/CryptoChallenge2.rar?dl=0, https://www.dropbox.com/s/qpsz5247ad3m9jn/ELGAMALSiGNiT.rar?dl=0, http://www.softpedia.com/get/Programming/Packers-Crypters-Protectors/PEiD-updated.shtml, https://tuts4you.com/download.php?view.3407, https://tuts4you.com/download.php?view.54, https://www.dropbox.com/s/qb5x8l1gwgdh8qn/dlptool.rar?dl=0, https://resources.infosecinstitute.com/breaking-software-protection-rsa/, http://en.wikipedia.org/wiki/ElGamal_signature_scheme. The only two problems that you’ll encounter are: to identify the cryptographic library used by the software or not (depending on the programming languages), and the key size problem which must not be big (512bits, 1024bits). Click ‘Find discrete logarithm’ and wait. Generate two random numbers, generator G and Private key X, with (G