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 available computers for different data security application. This paper proposed idea to modify the Diffie-Hellman key exchange by using truncated polynomial instead of discrete logarithm problem to overcome the problem of large prime numbers and non-full coverage of the finite set. The proposed method depends on the arithmetic polynomials. The Irreducible truncated polynomial mathematics is highly efficient and compatible with personal computers.