CELLULAR AUTOMATA BASED KEY AGREEMENT Clause Samples

CELLULAR AUTOMATA BASED KEY AGREEMENT. In Proceedings of the Second International Conference on e-Business and Telecommunication Networks, pages 262-267 DOI: 10.5220/0001412402620267 Copyright Ⓧc SciTePress are required to be altered frequently(▇▇▇▇ and Math- uria, 2003). The complemented CA rules and the one way function provide a way to vary the key frequently which is presented in the paper. The proposed proto- col has been shown to be secured in the face of known attacks. The removal of the exponentiation opera- tion leads to huge computational savings. Keys can be guaranteed to be random even if one of the inputs become known - a property lacking in D-H based pro- tocols(▇▇▇▇ and ▇▇▇▇▇▇▇▇, 2003). The outline of the paper is as follows: Section 2 de- velops the CA based primitives for the key agreement protocol. Section 3 proposes the key agreement proto- col using the CA based primitives. Section 4 discusses the security of the scheme and the work is concluded in section 5.