C. Koscielny
Maple implementation of the ElGamal public key encryption scheme working in SMG(p^m)

It has been shown that in ElGamal public key encryption scheme working over SMG(p^m), the need of finding primitive elements of GF(p^m), necessary if the system works traditionally but unfeasible in the case of huge fields, is eliminated. Thus, the discussed system is user-friendly, giving the possibility of very strong encryption with the key of order 10.000 bits and more. The construction of such cryptosystem is of great practical importance, therefore, the paper informs the reader in detail how to resolve this problem using Maple.