A New Lightweight Two-Party Key Agreement Protocol Defined on Underdetermined Systems of Polynomial Equations for Probable Security

Abstract

This paper introduces a new lightweight key exchange (KE) protocol which can be suitably implemented on resource-constrained smart devices to protect the privacy of communications. The most attractive features of this new KE protocol are provable security and lightweight. The security of this new KE protocol is based on the known impossibility of finding the unique solution of an underdetermined system of equations in which the number of free variables are more than the number of equations. This new lightweight KE protocol can be suitably implemented on the resource-constrained devices by imposing low computational load and low memory consumption. The lightweight KE scheme provides the desired security features of Key Confirmation (KC), Session Key (SK) security, and Know-Key (KK) security.