Skip to main content
Article thumbnail
Location of Repository

A Cryptosystem Based on the Symmetric Group Sn

By Javad N. Doliskani, Ehsan Malekian and Ali Zakerolhosseini

Abstract

This paper proposes a public key cryptosystem based on the symmetric group Sn, and validates its theoretical foundation. The proposed system benefits from the algebraic properties of Sn such as non commutative, high computational speed and high flexibility in selecting keys which make the Discrete Logarithm Problem (DLP) resistant to attacks by algorithms such as Pohlig-Hellman. Against these properties, the only disadvantage of the scheme is its relative large memory and bandwidth requirements. Due to the similarities in the algebraic structures, many other cryptosystems can be translated to their symmetric group analogs, and the proposed cryptosystem is in fact the Generalized El-Gamal cryptosystem which is based on Sn instead of GF(p). Key words

Topics: Cryptosystem, Public Key, Discrete Logarithm Problem
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.5778
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://paper.ijcsns.org/07_boo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.