相关论文: A simple generalization of El-Gamal cryptosystem t…
The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a $p$-group, a cryptosystem was built by this author in 'A simple generalization of El-Gamal cryptosystem to non-abelian groups'. It…
This is a study of the MOR cryptosystem using the special linear group over finite fields. The automorphism group of the special linear group is analyzed for this purpose. At our current state of knowledge, I show that the MOR cryptosystem…
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…
In this paper we study the MOR cryptosystem using finite classical Chevalley groups over a finite field of odd characteristic. In the process we develop an algorithm for these Chevalley groups in the same spirit as the row-column operation…
In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation.…
In this paper, we propose two cryptosystems based on group rings and existing cryptosystem. First one is Elliptic ElGamal type group ring public key cryptosystem whose security is greater than security of cryptosystems based on elliptic…
In this paper, we extend the ElGamal cryptosystem to the third group of units of the ring $\Z_{n}$, which we prove to be more secure than the previous extensions. We describe the arithmetic needed in the new setting. We also provide some…
The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…
We develop a public key cryptosystem based on invariants of diagonalizable groups and investigate properties of such cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of…
This paper introduces a newly developed private key cryptosystem and a public key cryptosystem. In the first one, each letter is encrypted with a different key. Therefore, it is a kind of a one-time pad. The second one is inspired by the…
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p^m, or 2p^m where p is an odd large prime and m is a positive integer. It is another…
We investigate questions related to the minimal degree of invariants of finitely generated diagonalizable groups. These questions were raised in connection to security of a public key cryptosystem based on invariants of diagonalizable…
An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f:G --> H, where G, H are (publically known) groups and H is…
We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity finite group based on the difficulty of the membership problem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the first…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We show that an attack based on the linear decomposition method introduced by the author can be efficiently applied to the new version of the MOR scheme proposed in \cite{BMSS}. We draw attention to some inaccuracies in the description of…
We propose a cryptosystem based on matrices over group rings and claim that it is secure against adaptive chosen ciphertext attack.
In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over…
The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) and a new…
Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The…