Developed Protocol for Key Exchange Based on Irreducible Polynomial


The Aim of this paper is to design a protocol for key exchanging to work on the availablecomputers for different data security application. This paper proposed idea to modify the Diffie-Hellman keyexchange by using truncated polynomial instead of discrete logarithm problem to overcome the problem oflarge prime numbers and non-full coverage of the finite set. The proposed method depends on the arithmeticpolynomials. The Irreducible truncated polynomial mathematics is highly efficient and compatible withpersonal computers.