Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
The Elgamal encryption scheme is best described in the setting of any finite cyclic group. Its classic case is typically presented in the multiplicative group *Z p of the ring of integers modulo a prime p and the multiplicative groups * 2 F m of finite fields of characteristic two. The Elgamal crypt...
Saved in:
| Main Author: | ElKassar, AbdulNasser (author) |
|---|---|
| Other Authors: | Haraty, Ramzi (author), Fanous, Suzan (author) |
| Format: | article |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10725/3761 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.ccis2k.org/iajit/PDF/vol.11,no.5/5320.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Comparative Study of Elgamal Based Cryptographic Algorithms
by: Haraty, Ramzi A.
Published: (2004)
by: Haraty, Ramzi A.
Published: (2004)
Similar Items
-
Hardening the ElGamal cryptosystem in the setting of the second group of units. (c2011)
by: Fanous, Suzan Mohamad
Published: (2011) -
ElGamal Public-Key cryptosystem in multiplicative groups of quotient rings of polynomials over finite fields
by: El-Kassar, A. N.
Published: (2005) -
ElGamal Public-Key Cryptosystem Using Reducible Polynomials Over a Finite Field
by: El-Kassar, A. N.
Published: (2004) -
Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm
by: El-Kassar, A. N.
Published: (2005) -
A comparative study of ElGamal based digital signature algorithms
by: Haraty, Ramzi A.
Published: (2006)