Next Article in Journal
Non-Invasive Detection Method for Recycled Flash Memory Using Timing Characteristics
Next Article in Special Issue
A Secure Algorithm for Inversion Modulo 2k
Previous Article in Journal
An Autonomous, Self-Authenticating, and Self-Contained Secure Boot Process for Field-Programmable Gate Arrays
Open AccessBrief Report

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

1
MACIMTE, Universidad Rey Juan Carlos, 28933 Móstoles, Madrid, Spain
2
Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USA
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Cryptography 2018, 2(3), 16; https://doi.org/10.3390/cryptography2030016
Received: 21 May 2018 / Revised: 13 July 2018 / Accepted: 16 July 2018 / Published: 19 July 2018
(This article belongs to the Special Issue Public Key Cryptography)
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. View Full-Text
Keywords: cryptanalysis; symmetric group; public key encryption cryptanalysis; symmetric group; public key encryption
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.

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.

Article Access Map by Country/Region

1
Back to TopTop