Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography

In this paper, we propose a new algorithm to improve the security of the Elliptic Curve Cryptography algorithm, ECC, using the Rosenberg-Strong pairing function. In the proposed algorithm, the Rosenberg-Strong pairing function is applied to the EEC to convert the two ciphertexts (two points on the e...

Full description

Saved in:
Bibliographic Details
Published in:BIO web of conferences 2024-01, Vol.97, p.168
Main Authors: Namous, Sarah.H., Habib, Hamza B., Khalaf, Rifaat Z.
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c2258-83f5899349dc67652fb200043bb115c69fe2aa3c57758406ee6ef46e9d4d09d43
container_end_page
container_issue
container_start_page 168
container_title BIO web of conferences
container_volume 97
creator Namous, Sarah.H.
Habib, Hamza B.
Khalaf, Rifaat Z.
description In this paper, we propose a new algorithm to improve the security of the Elliptic Curve Cryptography algorithm, ECC, using the Rosenberg-Strong pairing function. In the proposed algorithm, the Rosenberg-Strong pairing function is applied to the EEC to convert the two ciphertexts (two points on the elliptic curve) to only one ciphertext (one point on the elliptic curve). That is, only one ciphertext is transmitted in the proposed algorithm leading to less transmitting time compared with the classical EEC. The analysis of security illustrates that the proposed algorithm is secure against the attacks of the most common attacking algorithms. Therefore, using the proposed algorithm reduces the transmitting time and provides a high-security level. Thus, the proposed algorithm is secure and efficient, and it provides less transmitting time compared with the classical ECC.
doi_str_mv 10.1051/bioconf/20249700168
format article
fullrecord <record><control><sourceid>doaj_cross</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_0fd5c9d9173745c3869791bf2308b21d</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_0fd5c9d9173745c3869791bf2308b21d</doaj_id><sourcerecordid>oai_doaj_org_article_0fd5c9d9173745c3869791bf2308b21d</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2258-83f5899349dc67652fb200043bb115c69fe2aa3c57758406ee6ef46e9d4d09d43</originalsourceid><addsrcrecordid>eNpNkdtqwzAMhs3YYKXrE-wmL5DVxzi-LKHdCoWNHa6D49hpShoH2x1kTz9nLaNCSEISHxI_AI8IPiHI0LJqrbK9WWKIqeAQoiy_ATOMEE8pZfntVX0PFt4fYDSBCORsBn4K2_vgTiq0fZPIpHDjEKwffdDHZNU11rVhf0yqMVkNQzdOS2Gvk3frdV9p16QfwdnYfJOtm4abUx9Rtk-iT4vrrmuH0KqkOLlvfcE3Tg778QHcGdl5vbjkOfjarD-Ll3T3-rwtVrtUYczyNCeG5UIQKmqV8YxhU-H4ACVVhRBTmTAaS0kU45zlFGZaZ9rQTIua1jAGMgfbM7e28lAOrj1KN5ZWtuVfw7qmlC6e2OkSmpopUQvECadMkTwTXKDKYALzCqM6ssiZpZz13mnzz0OwnNQoL2qUV2qQX2fKgFQ</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography</title><source>Publicly Available Content (ProQuest)</source><creator>Namous, Sarah.H. ; Habib, Hamza B. ; Khalaf, Rifaat Z.</creator><contributor>Aldahan, N. ; Ramadhan, A.J.</contributor><creatorcontrib>Namous, Sarah.H. ; Habib, Hamza B. ; Khalaf, Rifaat Z. ; Aldahan, N. ; Ramadhan, A.J.</creatorcontrib><description>In this paper, we propose a new algorithm to improve the security of the Elliptic Curve Cryptography algorithm, ECC, using the Rosenberg-Strong pairing function. In the proposed algorithm, the Rosenberg-Strong pairing function is applied to the EEC to convert the two ciphertexts (two points on the elliptic curve) to only one ciphertext (one point on the elliptic curve). That is, only one ciphertext is transmitted in the proposed algorithm leading to less transmitting time compared with the classical EEC. The analysis of security illustrates that the proposed algorithm is secure against the attacks of the most common attacking algorithms. Therefore, using the proposed algorithm reduces the transmitting time and provides a high-security level. Thus, the proposed algorithm is secure and efficient, and it provides less transmitting time compared with the classical ECC.</description><identifier>ISSN: 2117-4458</identifier><identifier>EISSN: 2117-4458</identifier><identifier>DOI: 10.1051/bioconf/20249700168</identifier><language>eng</language><publisher>EDP Sciences</publisher><ispartof>BIO web of conferences, 2024-01, Vol.97, p.168</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2258-83f5899349dc67652fb200043bb115c69fe2aa3c57758406ee6ef46e9d4d09d43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><contributor>Aldahan, N.</contributor><contributor>Ramadhan, A.J.</contributor><creatorcontrib>Namous, Sarah.H.</creatorcontrib><creatorcontrib>Habib, Hamza B.</creatorcontrib><creatorcontrib>Khalaf, Rifaat Z.</creatorcontrib><title>Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography</title><title>BIO web of conferences</title><description>In this paper, we propose a new algorithm to improve the security of the Elliptic Curve Cryptography algorithm, ECC, using the Rosenberg-Strong pairing function. In the proposed algorithm, the Rosenberg-Strong pairing function is applied to the EEC to convert the two ciphertexts (two points on the elliptic curve) to only one ciphertext (one point on the elliptic curve). That is, only one ciphertext is transmitted in the proposed algorithm leading to less transmitting time compared with the classical EEC. The analysis of security illustrates that the proposed algorithm is secure against the attacks of the most common attacking algorithms. Therefore, using the proposed algorithm reduces the transmitting time and provides a high-security level. Thus, the proposed algorithm is secure and efficient, and it provides less transmitting time compared with the classical ECC.</description><issn>2117-4458</issn><issn>2117-4458</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>DOA</sourceid><recordid>eNpNkdtqwzAMhs3YYKXrE-wmL5DVxzi-LKHdCoWNHa6D49hpShoH2x1kTz9nLaNCSEISHxI_AI8IPiHI0LJqrbK9WWKIqeAQoiy_ATOMEE8pZfntVX0PFt4fYDSBCORsBn4K2_vgTiq0fZPIpHDjEKwffdDHZNU11rVhf0yqMVkNQzdOS2Gvk3frdV9p16QfwdnYfJOtm4abUx9Rtk-iT4vrrmuH0KqkOLlvfcE3Tg778QHcGdl5vbjkOfjarD-Ll3T3-rwtVrtUYczyNCeG5UIQKmqV8YxhU-H4ACVVhRBTmTAaS0kU45zlFGZaZ9rQTIua1jAGMgfbM7e28lAOrj1KN5ZWtuVfw7qmlC6e2OkSmpopUQvECadMkTwTXKDKYALzCqM6ssiZpZz13mnzz0OwnNQoL2qUV2qQX2fKgFQ</recordid><startdate>20240101</startdate><enddate>20240101</enddate><creator>Namous, Sarah.H.</creator><creator>Habib, Hamza B.</creator><creator>Khalaf, Rifaat Z.</creator><general>EDP Sciences</general><scope>AAYXX</scope><scope>CITATION</scope><scope>DOA</scope></search><sort><creationdate>20240101</creationdate><title>Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography</title><author>Namous, Sarah.H. ; Habib, Hamza B. ; Khalaf, Rifaat Z.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2258-83f5899349dc67652fb200043bb115c69fe2aa3c57758406ee6ef46e9d4d09d43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Namous, Sarah.H.</creatorcontrib><creatorcontrib>Habib, Hamza B.</creatorcontrib><creatorcontrib>Khalaf, Rifaat Z.</creatorcontrib><collection>CrossRef</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>BIO web of conferences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Namous, Sarah.H.</au><au>Habib, Hamza B.</au><au>Khalaf, Rifaat Z.</au><au>Aldahan, N.</au><au>Ramadhan, A.J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography</atitle><jtitle>BIO web of conferences</jtitle><date>2024-01-01</date><risdate>2024</risdate><volume>97</volume><spage>168</spage><pages>168-</pages><issn>2117-4458</issn><eissn>2117-4458</eissn><abstract>In this paper, we propose a new algorithm to improve the security of the Elliptic Curve Cryptography algorithm, ECC, using the Rosenberg-Strong pairing function. In the proposed algorithm, the Rosenberg-Strong pairing function is applied to the EEC to convert the two ciphertexts (two points on the elliptic curve) to only one ciphertext (one point on the elliptic curve). That is, only one ciphertext is transmitted in the proposed algorithm leading to less transmitting time compared with the classical EEC. The analysis of security illustrates that the proposed algorithm is secure against the attacks of the most common attacking algorithms. Therefore, using the proposed algorithm reduces the transmitting time and provides a high-security level. Thus, the proposed algorithm is secure and efficient, and it provides less transmitting time compared with the classical ECC.</abstract><pub>EDP Sciences</pub><doi>10.1051/bioconf/20249700168</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2117-4458
ispartof BIO web of conferences, 2024-01, Vol.97, p.168
issn 2117-4458
2117-4458
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_0fd5c9d9173745c3869791bf2308b21d
source Publicly Available Content (ProQuest)
title Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T00%3A50%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-doaj_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Constructing%20a%20Cryptosystem%20Algorithm%20by%20Applying%20the%20Rosenberg-Strong%20Pairing%20Function%20on%20the%20Elliptic%20Curve%20Cryptography&rft.jtitle=BIO%20web%20of%20conferences&rft.au=Namous,%20Sarah.H.&rft.date=2024-01-01&rft.volume=97&rft.spage=168&rft.pages=168-&rft.issn=2117-4458&rft.eissn=2117-4458&rft_id=info:doi/10.1051/bioconf/20249700168&rft_dat=%3Cdoaj_cross%3Eoai_doaj_org_article_0fd5c9d9173745c3869791bf2308b21d%3C/doaj_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2258-83f5899349dc67652fb200043bb115c69fe2aa3c57758406ee6ef46e9d4d09d43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true