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

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

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

Published
2011-12-06
Section
SYSTEM ENGINEERING, COMPUTER TECHNOLOGY