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...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: ElKassar, AbdulNasser (author)
مؤلفون آخرون: Haraty, Ramzi (author), Fanous, Suzan (author)
التنسيق: article
منشور في: 2014
الوصول للمادة أونلاين: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
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513462158229504
author ElKassar, AbdulNasser
author2 Haraty, Ramzi
Fanous, Suzan
author2_role author
author
author_facet ElKassar, AbdulNasser
Haraty, Ramzi
Fanous, Suzan
author_role author
dc.creator.none.fl_str_mv ElKassar, AbdulNasser
Haraty, Ramzi
Fanous, Suzan
dc.date.none.fl_str_mv 2014
2016-05-12T07:41:43Z
2016-05-12T07:41:43Z
2016-05-12
dc.identifier.none.fl_str_mv 1683-3198
http://hdl.handle.net/10725/3761
Haraty, R. A., El-Kassar, A. N., & Fanous, S. (2014). Hardening the elgamal cryptosystem in the setting of the second group of units. Int. Arab J. Inf. Technol., 11(5), 514-520.
http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php
http://www.ccis2k.org/iajit/PDF/vol.11,no.5/5320.pdf
dc.language.none.fl_str_mv en
dc.relation.none.fl_str_mv The International Arab Journal of Information Technology
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.title.none.fl_str_mv Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
dc.type.none.fl_str_mv Article
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description 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 cryptosystem was modified to deal with Gaussian integers, and extended to work with group of units of Zp[x]/<x2>. In this paper, we consider yet another extension to the Elgamal cryptosystem employing the second group of units of Zn and the second group of units of Z2[x]/<h(x)>, where h(x) is an irreducible polynomial. We describe the arithmetic needed in the new setting, and present examples, proofs and algorithms to illustrate the applicability of the proposed scheme. We implement our algorithms and conduct testing to evaluate the accuracy, efficiency and security of the modified cryptographic scheme.
eu_rights_str_mv openAccess
format article
id LAURepo_f405cc441e8accfdb24a4781bbf0d858
identifier_str_mv 1683-3198
Haraty, R. A., El-Kassar, A. N., & Fanous, S. (2014). Hardening the elgamal cryptosystem in the setting of the second group of units. Int. Arab J. Inf. Technol., 11(5), 514-520.
language_invalid_str_mv en
network_acronym_str LAURepo
network_name_str Lebanese American University repository
oai_identifier_str oai:laur.lau.edu.lb:10725/3761
publishDate 2014
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Hardening the ElGamal Cryptosystem in the Setting of the Second Group of UnitsElKassar, AbdulNasserHaraty, RamziFanous, SuzanThe 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 cryptosystem was modified to deal with Gaussian integers, and extended to work with group of units of Zp[x]/<x2>. In this paper, we consider yet another extension to the Elgamal cryptosystem employing the second group of units of Zn and the second group of units of Z2[x]/<h(x)>, where h(x) is an irreducible polynomial. We describe the arithmetic needed in the new setting, and present examples, proofs and algorithms to illustrate the applicability of the proposed scheme. We implement our algorithms and conduct testing to evaluate the accuracy, efficiency and security of the modified cryptographic scheme.PublishedN/A2016-05-12T07:41:43Z2016-05-12T07:41:43Z20142016-05-12Articleinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article1683-3198http://hdl.handle.net/10725/3761Haraty, R. A., El-Kassar, A. N., & Fanous, S. (2014). Hardening the elgamal cryptosystem in the setting of the second group of units. Int. Arab J. Inf. Technol., 11(5), 514-520.http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttp://www.ccis2k.org/iajit/PDF/vol.11,no.5/5320.pdfenThe International Arab Journal of Information Technologyinfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/37612021-03-19T09:10:06Z
spellingShingle Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
ElKassar, AbdulNasser
status_str publishedVersion
title Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
title_full Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
title_fullStr Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
title_full_unstemmed Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
title_short Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
title_sort Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
url 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