Cryptanalysis Of A Proposal Based On The Discrete Logarithm Problem Inside S-N

CRYPTOGRAPHY(2018)

引用 1|浏览26
暂无评分
摘要
In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group S-n 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 S-n, 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.
更多
查看译文
关键词
cryptanalysis, symmetric group, public key encryption
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要