Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn

In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group Sn as mathematical platform. In 2012, an improvement of the cryptosystem’s memory requirements was suggested by Othman. The proposal by Doliskani et al. in particular requires the discrete logar...

Full description

Bibliographic Details
Main Authors: María Isabel González Vasco, Angela Robinson, Rainer Steinwandt
Format: Article
Language:English
Published: MDPI AG 2018-07-01
Series:Cryptography
Subjects:
Online Access:http://www.mdpi.com/2410-387X/2/3/16
_version_ 1828353534220828672
author María Isabel González Vasco
Angela Robinson
Rainer Steinwandt
author_facet María Isabel González Vasco
Angela Robinson
Rainer Steinwandt
author_sort María Isabel González Vasco
collection DOAJ
description In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group Sn as mathematical platform. In 2012, an improvement of the cryptosystem’s memory requirements was suggested by Othman. The proposal by Doliskani et al. in particular requires the discrete logarithm problem in Sn, using its natural representation, to be hard. Making use of the Chinese Remainder Theorem, we describe an efficient method to solve this discrete logarithm problem, yielding a polynomial time secret key recovery attack against Doliskani et al.’s proposal.
first_indexed 2024-04-14T02:10:07Z
format Article
id doaj.art-227c9228d55a4001b5fecf2731f7e2f2
institution Directory Open Access Journal
issn 2410-387X
language English
last_indexed 2024-04-14T02:10:07Z
publishDate 2018-07-01
publisher MDPI AG
record_format Article
series Cryptography
spelling doaj.art-227c9228d55a4001b5fecf2731f7e2f22022-12-22T02:18:26ZengMDPI AGCryptography2410-387X2018-07-01231610.3390/cryptography2030016cryptography2030016Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside SnMaría Isabel González Vasco0Angela Robinson1Rainer Steinwandt2MACIMTE, Universidad Rey Juan Carlos, 28933 Móstoles, Madrid, SpainDepartment of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USADepartment of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USAIn 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group Sn as mathematical platform. In 2012, an improvement of the cryptosystem’s memory requirements was suggested by Othman. The proposal by Doliskani et al. in particular requires the discrete logarithm problem in Sn, using its natural representation, to be hard. Making use of the Chinese Remainder Theorem, we describe an efficient method to solve this discrete logarithm problem, yielding a polynomial time secret key recovery attack against Doliskani et al.’s proposal.http://www.mdpi.com/2410-387X/2/3/16cryptanalysissymmetric grouppublic key encryption
spellingShingle María Isabel González Vasco
Angela Robinson
Rainer Steinwandt
Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
Cryptography
cryptanalysis
symmetric group
public key encryption
title Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
title_full Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
title_fullStr Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
title_full_unstemmed Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
title_short Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
title_sort cryptanalysis of a proposal based on the discrete logarithm problem inside sn
topic cryptanalysis
symmetric group
public key encryption
url http://www.mdpi.com/2410-387X/2/3/16
work_keys_str_mv AT mariaisabelgonzalezvasco cryptanalysisofaproposalbasedonthediscretelogarithmprobleminsidesn
AT angelarobinson cryptanalysisofaproposalbasedonthediscretelogarithmprobleminsidesn
AT rainersteinwandt cryptanalysisofaproposalbasedonthediscretelogarithmprobleminsidesn