Microprocessor Implementation of Key Agreement Protocol over the Ring of Multivariate Polynomials

Katvickis, A.; Sakalauskas, E.; Listopadskis, N.
December 2011
Electronics & Electrical Engineering;2011, Issue 116, p95
Academic Journal
Efficiency analysis of key agreement protocol with matrices over multivariate polynomial ring is presented. We consider protocol implementation for highly resource-restricted areas. Total number of simple bit operations requires computing common secret key is determined for different microprocessors types and estimated expected protocol run time. Comparison to traditional key agreement protocols (Diffie-Hellman and Elliptic Curve Diffie-Hellman) shows that key agreement protocol over multivariate polynomial ring is more suitable for areas where there are no specialized co-processors installed.


Related Articles

  • AN EFFICIENT CERTIFICATELESS AUTHENTICATED KEY AGREEMENT. YUXIU-YING; HEDA-KE; ZHANG-WENFANG // Journal of Theoretical & Applied Information Technology;2/20/2013, Vol. 48 Issue 2, p1160 

    Key agreement is very important in information and data security. To overcome the key escrow property of identity-based cryptography AND combines the advantages of the traditional PKI and the identity-based cryptography, certificateless public key cryptography is proposed. This paper proposed a...

  • An efficient identity-based tripartite authenticated key agreement protocol. Tan, Zuowen // Electronic Commerce Research;Nov2012, Vol. 12 Issue 4, p505 

    The tripartite authenticated key agreement protocol enables three entities to authenticate each other and agree on a session key over an insecure public network. In this paper, we propose an identity-based tripartite authenticated key agreement protocol. Compared with the previous identity-based...

  • Key Exchange based on Dickson Polynomials over Finite Field with 2m. Pengcheng Wei; Xiaofeng Liao; Kwok-Wo Wong // Journal of Computers;Dec2011, Vol. 6 Issue 12, p2546 

    Give a survey of the important properties of Dickson polynomial Dxn (x, 1) , and prove that Dickson polynomial Dxn (x, 1) over finite field with 2 is a permutation polynomial if and only if n is odd. Use this fact to construct a new key agreement protocol which is secure, feasible and extensible.

  • Optimized Key Agreement Protocol Based on Chaotic Maps. Ping Zhen; Geng Zhao; Lequan Min; Xiaodong Li // Journal of Communications;May2014, Vol. 9 Issue 5, p398 

    Many key agreement protocols based on chaotic maps have been proposed to guarantee secure communications in the network. Recently, Wang et al. proposed a new key agreement protocol based on chaotic maps. But some issues exist in this protocol, such as anonymity, key distribution and management,...

  • A new key agreement protocol based on Chebyshev chaotic maps. Wang, Xingyuan; Wang, Siwei; Wang, Zhanjie; Zhang, Mengcan // Security & Communication Networks;Dec2016, Vol. 9 Issue 18, p5028 

    Recently, an enhanced key agreement protocol based on chaotic maps was proposed and it can generate secure session key and resist known key attacks. In this paper, we analyze it and point out some problems existing in this protocol. For example, this protocol cannot ensure perfect forward...

  • Two Non-interactive Key Agreement Protocols under Certificateless Scenarios. Yongxuan Sang; Lili Zhang; Lin You; Zhongwen Li // International Journal of Advancements in Computing Technology;Apr2012, Vol. 4 Issue 6, p331 

    Key agreement protocol is one of the fundamental primitives of cryptography. It allows two or more parties to establish secret keys securely in the presence of an eavesdropping adversary. In this paper, two certificateless non-interactive key agreement protocols were proposed under...

  • Security Vulnerability and Robust Security Requirements using Key Management in Sensor Network. Patel, Jaykumar Shantilal; Chavda, Vijaykumar M. // International Journal of Grid & Distributed Computing;2014, Vol. 7 Issue 3, p23 

    Encrypt message with strongly secure key which is known only by sending and recipient end is a significant aspect to acquire robust security in sensor network. The secure exchange of key between sender and receiver is too much difficult task in resource constraint sensor network. To achieve...

  • 'Security-Aware and Data Intensive Low-Cost Mobile Systems' Editorial. KoƂodziej, Joanna; Jaatun, Martin; Khan, Samee; Koeppen, Mario // Mobile Networks & Applications;Oct2013, Vol. 18 Issue 5, p591 

    An introduction is presented in which the editors discuss various reports within the issue on topics including non-interactive authenticated key agreement (NI-AKA) protocols, agent-code mobility in wireless sensor networks (WSNs), and sink-oriented layered clustering to balance energy consumption.

  • MLIP: A Concurrent Approach for Clipping Indexing. Ravinder, Majoju; Vijay Prakash, R. // International Journal on Computer Science & Engineering;2011, Vol. 3 Issue 12, p3707 

    Multidimensional databases are beginning to be used in a wide range of applications. To meet this fast-growing demand, the R-tree family is being applied to support fast access to multidimensional data, for which the R+-tree exhibits outstanding search performance. In order to support efficient...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics