ElGamal Public-Key Cryptosystem Using Reducible Polynomials Over a Finite Field
N/A
Saved in:
| Main Author: | El-Kassar, A. N. (author) |
|---|---|
| Other Authors: | Haraty, Ramzi A. (author) |
| Format: | conferenceObject |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/10725/7262 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://dblp.org/db/conf/iasse/iasse2004 |
| 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
-
ElGamal Public-Key cryptosystem in multiplicative groups of quotient rings of polynomials over finite fields
by: El-Kassar, A. N.
Published: (2005) -
Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
by: ElKassar, AbdulNasser
Published: (2014) -
Rabin Public-Key Cryptosystem in Rings of Polynomials Over Fininte Fields
by: El-Kassar, A. N.
Published: (2004) -
Hardening the ElGamal cryptosystem in the setting of the second group of units. (c2011)
by: Fanous, Suzan Mohamad
Published: (2011) -
Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm
by: El-Kassar, A. N.
Published: (2005)