Microprocessor Implementation of Key Agreement Protocol Over the Ring of Multivariate Polynomials
AbstractEfficiency 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).
Authors retain copyright and grant the journal the right of the first publication with the paper simultaneously licensed under the Creative Commons Attribution 4.0 (CC BY 4.0) licence.
Authors are allowed to enter into separate, additional contractual arrangements for the non-exclusive distribution of the paper published in the journal with an acknowledgement of the initial publication in the journal.
Copyright terms are indicated in the Republic of Lithuania Law on Copyright and Related Rights, Articles 4-37.