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...

This paper provides theoretical foundations for the group signature primitive. We introduce strong, formal definitions for the core requirements of anonymity and traceability. We then show that these imply the large set of sometimes ambiguous existing informal requirements in the literature, thereby unifying and simplifying the requirements for this primitive. Finally we prove the existence of ...

A permutation group G on ? is called a rank 3 if it has precisely three orbits in its induced action × . The largest having the same as 2 - closure of description -closures groups given. As special case, proved that -closure primitive one-dimensional affine sufficiently large degree also and one-dimensional.

one of the most important characteristics of the eternal religion is the adaptation of its decrees with the changes of the human’s life in the transition of time. so, it is necessary for us to review the second decrees as the flexible dimensions of the decrees. according to the causes of some decrees’ change, altering the decree’s subject leads to the change of the primitive decrees into the se...