The importance of secure communication over an insecure channel has increased day by day in almost all applications such as commercial purposes, money transactions, military and sanitary services. Nowadays, both secret and public key encryption schemes over various types of algebraic structures have become importance since they are based on computationally hard underlying mathematical problems such as integer factorization, discrete logarithm, conjugacy search problem in group theory, finding the inverse of a given unit in group rings. Moreover, to generate a shared secret key by exchanging secret keys between two or more parties, it is utilized from key exchange protocols. In this paper, we first briefly mention about the basics of group rings, the fundamental properties of units, Diffie-Hellman protocol then we generalize this to a multi-party type key exchange protocol using units in a given group ring and finally we propose a symmetric key encryption scheme over a non-commutative group ring which is different from the encryption scheme in \cite{turgutomer} by illustrating a concrete example.
Primary Language | English |
---|---|
Journal Section | Research Article |
Authors | |
Publication Date | March 1, 2019 |
Published in Issue | Year 2019 Volume: 8 Issue: 1 |