.

ElGamal Public-Key Cryptosystem Using Reducible Polynomials Over a Finite Field

LAUR Repository

ElGamal Public-Key Cryptosystem Using Reducible Polynomials Over a Finite Field

El-Kassar, A. N.; Haraty, Ramzi A.
URI: http://hdl.handle.net/10725/7262
URL: http://dblp.org/db/conf/iasse/iasse2004
Date: 2018-03-23
Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Citation:

El-Kassar, A. N., & Haraty, R. A. (2004, July). ElGamal Public-Key Cryptosystem Using Reducible Polynomials Over a Finite Field. In 13th International Conference on Intelligent and Adaptive Systems and Software Engineering. (pp. 189-194).

Access Status:

N/A

Show full item record

Files in this item

Icon
Name: El Gamal.pdf
Size: 72.13Kb
Format: PDF

This item appears in the following Collection(s)

Search LAUR


Advanced Search

Browse

My Account