ELGAMAL Encryption/Decryption Functionality
Key Size
Generate ELGAML Keys160 bit 320 bit
ELGAMAL Encryption/Decryption Encrypt Message Decrypt Message
Public Key Private Key ELGAMAL Encryption/Decryption

The ELGAML Algorithm

Elliptic curve cryptography (ECC) is a public-key cryptography system which is based
on discrete logarithms structure of elliptic curves over finite fields. ECC is known for smaller key sizes, faster encryption, better security and more efficient implementations for the same security level as compared to other public cryptography systems (like RSA). ECC can be used for encryption (e.g Elgamal), secure key exchange (ECC Diffie-Hellman) and also for authentication and verification of digital signatures

1024 bit RSA vs 160 bit elliptic curves are the same security level)

ElGamal encryption produces a 2:1 expansion in size from plaintext to ciphertext.

ClearText Message output
Ciphers
ELGAMAL
ELGAMAL/ECB/PKCS1PADDING
ELGAMAL/NONE/NOPADDING
ELGAMAL/PKCS1


Any private key value that you enter or we generate is not stored on this site, this tool is provided via an HTTPS URL to ensure that private keys cannot be stolen, for extra security run this software on your network, no cloud dependency
Reader Offer The Modern Cryptography CookBook for Just $9 Avail Discount coupon first 100 reader. No hurry read the sample chapters here first


The ElGamal cryptosystem is usually used in a hybrid cryptosystem. I.e., the message itself is encrypted using a symmetric cryptosystem and ElGamal is then used to encrypt the key used for the symmetric cryptosystem. This is because asymmetric cryptosystems like Elgamal are usually slower than symmetric ones for the same level of security, so it is faster to encrypt the symmetric key (which most of the time is quite small if compared to the size of the message) with Elgamal and the message (which can be arbitrarily large) with a symmetric cipher