Near-Ring

D. Ezhilmaran; V. Muthukumaran

Article Details

Near-Ring

Authors:

D. Ezhilmaran | V. Muthukumaran

Publisher:

Gazi University

Journal:

Gazi University Journal of Science 2016 Vol.29 Issue 1, pp.123-127

Document Type:

Article

Publication Date:

3/2016

Document Language:

Turkish

Document ID (Org No.):

2000428747

eISSN:

2147-1762

Abstract:

 

There are several public key cryptosystem around that use computational hardness of either conjugacy search problem or the word problem for non-abelian groups. In this paper we use decomposition problem in near-ring to construct a public key cryptosystem and improved the security of key establishment protocol based on the decomposition problem.

Article Details

Near-Ring

Authors: D. Ezhilmaran | V. Muthukumaran

Publisher: Gazi University

Journal: Gazi University Journal of Science 2016 Vol.29 Issue 1, pp.123-127

Document Type: Article

Publication Date: 3/2016

Document Language: Turkish

Document ID (Org No.): 2000428747

eISSN: 2147-1762

Issues

Authors:

D. Ezhilmaran | V. Muthukumaran

Publisher:

Gazi University

Journal:

Gazi University Journal of Science 2016 Vol.29 Issue 1, pp.123-127

Document Type:

Article

Publication Date:

3/2016

Document Language:

Turkish

Document ID (Org No.):

2000428747

eISSN:

2147-1762