Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
MACIMTE, Universidad Rey Juan Carlos, 28933 Móstoles, Madrid, Spain
Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USA
These authors contributed equally to this work.
Author to whom correspondence should be addressed.
Received: 21 May 2018 / Revised: 13 July 2018 / Accepted: 16 July 2018 / Published: 19 July 2018
In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group
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
, 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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
González Vasco, M.I.; Robinson, A.; Steinwandt, R. Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn. Cryptography 2018, 2, 16.
González Vasco MI, Robinson A, Steinwandt R. Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn. Cryptography. 2018; 2(3):16.
González Vasco, María I.; Robinson, Angela; Steinwandt, Rainer. 2018. "Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn." Cryptography 2, no. 3: 16.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
Multiple requests from the same IP address are counted as one view.