The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2010  
         
  Article:   ENCRYPTION SYSTEM OVER THE SYMMETRICAL GROUP OF ORDER N.

Authors:  .
 
       
         
  Abstract:  The encryption systems with public keys are related to algebraic structures, which have to ensure, by means of their computational properties or their dimensions, a high level of security for the generated keys, which are secret. The ElGamal algorithm is defined over the group of remainder classes modulo n, which is a suitable structure for an encryption algorithm. This paper chooses another structure for which the ElGamal algorithm is to be applied to. This structure is the symmetrical group of order n. Properties which ensure the opportunity of choosing this structure are: the cardinal of the group is high enough, the operation of composition of the permutations is simple from a computational point of view and every permutation can be decomposed uniquely into a product of disjunctive cycles.

Key words and phrases: ElGamal over the permutations group, discrete logarithm problem.
 
         
     
         
         
      Back to previous page