The MOR cryptosystem and finite $p$-groups
نویسنده
چکیده
The ElGamal cryptosystem is the most widely used public key cryptosystem. It uses the discrete logarithm problem as the cryptographic primitive. The MOR cryptosystem is a similar cryptosystem. It uses the discrete logarithm problem in the automorphism group as the cryptographic primitive. In this paper, we study the MOR cryptosystem for finite p-groups. The study is complete for p-automorphisms. For p-automorphisms there are some interesting open problems.
منابع مشابه
A note on using finite non-abelian p-groups in the MOR cryptosystem
The MOR cryptosystem [9] is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a p-group, a cryptosystem was built in [4]. It seems resoanable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using p-groups? In this paper we show that the answer is no.
متن کاملA Simple Generalization of the Elgamal Cryptosystem to Non-abelian Groups
In this article we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the ElGamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equ...
متن کاملA simple generalization of El-Gamal cryptosystem to non-abelian groups
In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equi...
متن کاملMOR Cryptosystem and classical Chevalley groups in odd characteristic
In this paper we study the MOR cryptosystem with finite Chevalley groups. There are four infinite families of finite classical Chevalley groups. These are: special linear groups SL(d, q), orthogonal groups O(d, q) and symplectic groups Sp(d, q). The family O(d, q) splits to two different families of Chevalley groups depending on the parity of d. The MOR cryptosystem over SL(d, q) was studied by...
متن کاملThe MOR Cryptosystem and Unitary group in odd characteristic
This paper is a continuation of the work done to understand the security of a MOR cryptosystem over matrix groups defined over a finite field. In this paper we show that in the case of unitary group U(d, q) the security of the MOR cryptosystem is similar to the hardness of the discrete logarithm problem in Fq2d . In our way of developing the MOR cryptosystem, we developed row-column operations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1309.1859 شماره
صفحات -
تاریخ انتشار 2013