Cryptography, Blockchain, Ethereum, ICO, Bitcoin.
with P = gᵏ. Difficulty and key size We won’t dive into the different attacks possible today but the brute force (naive) approach for RSA/ElGamal on any hard group requires √p steps, p being size of the prime used in the system. As such, we could think of using a 160/240 bits long p prime.