The submission shows how to implement the user-friendly, but mathematically sophisticated strong e-mail encryption scheme using the ElGamal algorithm working in the multiplicative group of GF(p^m) (http://www.maplesoft.com/applications/view.aspx?SID=4403, J. L. G. Pardo - Introduction to Cryptography with Maple). On unpacking the file `elgmail.zip` the user will see three public key files: `ElGpub_Eve_Flower.m`, `ElGpub_Jack_Herod.m`, `ElGpub_Michele_Lazy.m` and three application worksheets: `ElGedm_Flower.mw`, `ElGedm_Herod.mw`, `ElGedm_Lazy.mw` in which the proper private keys are embedded. Each of the three users can encrypt an e-mail letter and can send the encrypted message to the required addressee, knowing its public key. Evidently, any user can also decrypt the proper encrypted message, addressed to him. The way of generating the public and private keys demonstrates the worksheet ElGkg.mw. The data contained in the names of the computed keys using the worksheet ElGkg.mw is evident. In the presented example the e-mail message should contain no more than 782 printable characters with byte values less than 127. The scheme can be accepted for any e-mail system: the public keys and encrypted messages are Maple `*.m` format files containing characters with 91 byte values from the set {10, 33 .. 122}. The user can also observe the time needed for encryption, decryption and the computation of keys, and the encryption scheme redundancy. An example test message and its cryptogram is also presented and the user can check for which the encrypted test message ought to be sent.