A new approach to the ElGamal encryption scheme

• Autorzy: Czesław Kościelny
• Języki publikacji: EN

Abstrakty

EN

The ElGamal encryption scheme can be used for both digital signatures and encryption, and its security results from the difficulty of calculating discrete logarithms in a finite field. This algorithm usually works in a multiplicative group of GF(p) and in this case the progress in the discrete logarithm problem forces the users of such a basic ElGamal public key cryptosystem to permanently increase a prime modulus p in order to ensure the desired security. But the task of finding a multiplicative group of GF(p) is unfeasible for an ordinary user. It is possible to overcome this inconvenience by forming an ElGamal encryption scheme which works in a multiplicative group of GF(p^m). Therefore, it is shown in the paper how to implement this cryptosystem for work in the multiplicative group of GF(pm), in its subgroup, and in an algebraic system named the spurious multiplicative group of GF(p^m).

Słowa kluczowe

EN

public-key encryption; ElGamal cipher; block ciphers

• Wydawca: University of Zielona Gora Press
• Czasopismo: International Journal of Applied Mathematics and Computer Science
• Rocznik: 2004
• Tom: 14
• Numer: 2
• Strony: 265-267

Daty

wydano

2004

otrzymano

2003-10-16

Twórcy

autor

Czesław Kościelny

• Academy of Management of Legnica, Faculty of Computer Science, ul. Reymonta 21, 59-220 Legnica, Poland

Bibliografia

• Kościelny C. (2003): User-friendly ElGamal public-key encrypt-letter scheme. - http://www.mapleapps.com/List.asp?CategoryID=6&Category=Cryptography
• Menezes A.J., van Oorschot P.C. and Vanstone S.A. (1998): Handbook of Applied Cryptography. - Boca Raton: CRC Press.
• Stinson D.R. (1995): Cryptography - Theory and Practice. - Boca Raton: CRC Press.
• Živković M. (1994): Table of primitive binary polynomials, Part II. - Math. Comput., Vol. 63, No. 207, pp. 301-306.