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

Authors

  • A. Katvickis Kaunas University of Technology
  • E. Sakalauskas Kaunas University of Technology
  • N. Listopadskis Kaunas University of Technology

DOI:

https://doi.org/10.5755/j01.eee.116.10.893

Abstract

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. Bibl. 12, tabl. 2 (in English; abstracts in English and Lithuanian).

http://dx.doi.org/10.5755/j01.eee.116.10.893

Downloads

Published

2011-12-06

How to Cite

Katvickis, A., Sakalauskas, E., & Listopadskis, N. (2011). Microprocessor Implementation of Key Agreement Protocol Over the Ring of Multivariate Polynomials. Elektronika Ir Elektrotechnika, 116(10), 95-98. https://doi.org/10.5755/j01.eee.116.10.893

Issue

Vol. 116 No. 10 (2011)

Section

SYSTEM ENGINEERING, COMPUTER TECHNOLOGY

License

The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.

By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.