A n2 + n MQV key agreement protocol

A n2 + n MQV key agreement protocol

In this paper a novel scheme to generate (n2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International arab journal of information technology 2013, Vol.10 (2)
Hauptverfasser: Hwang, Li-Chin, Lee, Cheng-Chi, Hwang, Min-Shiang
Format: Artikel
Sprache:eng
Schlagworte:
Coding theory
Data encryption (Computer science)
Wireless communication systems
البيانات
التشفير
برمجيات الحاسوب
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 2
container_start_page
container_title International arab journal of information technology
container_volume 10
creator Hwang, Li-Chin
Lee, Cheng-Chi
Hwang, Min-Shiang
description In this paper a novel scheme to generate (n2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle attacks, replay attacks or forgery attacks. The security and efficiency of our proposed scheme are presented. Compare with other schemes, the proposed scheme can generate more session keys in one session. Therefore, the propose scheme is more efficient than the others.
format Article
fullrecord <record><control><sourceid>emarefa</sourceid><recordid>TN_cdi_emarefa_primary_311931</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>311931</sourcerecordid><originalsourceid>FETCH-emarefa_primary_3119313</originalsourceid><addsrcrecordid>eNpjYuA0NLMw1jU2tLRgQWJzMPAWF2cZAIGxpZGZuTkng7KjQp6RgrZCnoJvYJhCdmqlQmJ6UWpqbmpeiUJBUX5JfnJ-Dg8Da1piTnEqL5TmZpB1cw1x9tBNzU0sSk1LjC8oygSyKuONDQ0tjQ2NCckDAOBbKrw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A n2 + n MQV key agreement protocol</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Hwang, Li-Chin ; Lee, Cheng-Chi ; Hwang, Min-Shiang</creator><creatorcontrib>Hwang, Li-Chin ; Lee, Cheng-Chi ; Hwang, Min-Shiang</creatorcontrib><description>In this paper a novel scheme to generate (n2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle attacks, replay attacks or forgery attacks. The security and efficiency of our proposed scheme are presented. Compare with other schemes, the proposed scheme can generate more session keys in one session. Therefore, the propose scheme is more efficient than the others.</description><identifier>ISSN: 1683-3198</identifier><identifier>EISSN: 1683-3198</identifier><language>eng</language><publisher>Zarqa, Jordan: Zarqa University</publisher><subject>Coding theory ; Data encryption (Computer science) ; Wireless communication systems ; البيانات ; التشفير ; برمجيات الحاسوب</subject><ispartof>International arab journal of information technology, 2013, Vol.10 (2)</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780</link.rule.ids></links><search><creatorcontrib>Hwang, Li-Chin</creatorcontrib><creatorcontrib>Lee, Cheng-Chi</creatorcontrib><creatorcontrib>Hwang, Min-Shiang</creatorcontrib><title>A n2 + n MQV key agreement protocol</title><title>International arab journal of information technology</title><description>In this paper a novel scheme to generate (n2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle attacks, replay attacks or forgery attacks. The security and efficiency of our proposed scheme are presented. Compare with other schemes, the proposed scheme can generate more session keys in one session. Therefore, the propose scheme is more efficient than the others.</description><subject>Coding theory</subject><subject>Data encryption (Computer science)</subject><subject>Wireless communication systems</subject><subject>البيانات</subject><subject>التشفير</subject><subject>برمجيات الحاسوب</subject><issn>1683-3198</issn><issn>1683-3198</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNpjYuA0NLMw1jU2tLRgQWJzMPAWF2cZAIGxpZGZuTkng7KjQp6RgrZCnoJvYJhCdmqlQmJ6UWpqbmpeiUJBUX5JfnJ-Dg8Da1piTnEqL5TmZpB1cw1x9tBNzU0sSk1LjC8oygSyKuONDQ0tjQ2NCckDAOBbKrw</recordid><startdate>2013</startdate><enddate>2013</enddate><creator>Hwang, Li-Chin</creator><creator>Lee, Cheng-Chi</creator><creator>Hwang, Min-Shiang</creator><general>Zarqa University</general><scope>ADJCN</scope><scope>AGZBS</scope><scope>AHFXO</scope></search><sort><creationdate>2013</creationdate><title>A n2 + n MQV key agreement protocol</title><author>Hwang, Li-Chin ; Lee, Cheng-Chi ; Hwang, Min-Shiang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-emarefa_primary_3119313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Coding theory</topic><topic>Data encryption (Computer science)</topic><topic>Wireless communication systems</topic><topic>البيانات</topic><topic>التشفير</topic><topic>برمجيات الحاسوب</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hwang, Li-Chin</creatorcontrib><creatorcontrib>Lee, Cheng-Chi</creatorcontrib><creatorcontrib>Hwang, Min-Shiang</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>قاعدة العلوم الاجتماعية - e-Marefa Social Sciences</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><jtitle>International arab journal of information technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hwang, Li-Chin</au><au>Lee, Cheng-Chi</au><au>Hwang, Min-Shiang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A n2 + n MQV key agreement protocol</atitle><jtitle>International arab journal of information technology</jtitle><date>2013</date><risdate>2013</risdate><volume>10</volume><issue>2</issue><issn>1683-3198</issn><eissn>1683-3198</eissn><abstract>In this paper a novel scheme to generate (n2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle attacks, replay attacks or forgery attacks. The security and efficiency of our proposed scheme are presented. Compare with other schemes, the proposed scheme can generate more session keys in one session. Therefore, the propose scheme is more efficient than the others.</abstract><cop>Zarqa, Jordan</cop><pub>Zarqa University</pub><tpages>6</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1683-3198
ispartof International arab journal of information technology, 2013, Vol.10 (2)
issn 1683-3198
1683-3198
language eng
recordid cdi_emarefa_primary_311931
source Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Coding theory
Data encryption (Computer science)
Wireless communication systems
البيانات
التشفير
برمجيات الحاسوب
title A n2 + n MQV key agreement protocol
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T13%3A14%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-emarefa&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20n2%20+%20n%20MQV%20key%20agreement%20protocol&rft.jtitle=International%20arab%20journal%20of%20information%20technology&rft.au=Hwang,%20Li-Chin&rft.date=2013&rft.volume=10&rft.issue=2&rft.issn=1683-3198&rft.eissn=1683-3198&rft_id=info:doi/&rft_dat=%3Cemarefa%3E311931%3C/emarefa%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true