Paper 2021/1701 Original: eprint.iacr.org/2021/1701 ↗
Cryptanalysis of the Cryptosystems Based on the Generalized Hidden Discrete Logarithm Problem
Abstract
In this paper, we will show the hidden discrete logarithm problem(HDLP) and the generalized form of HDLP(GHDLP) over non-commutative associative algebras (FNAAs) can be reduced to discrete logarithm problem(DLP) in a finite field through analyzing the eigenvalues of the representation matrix. Through the analysis of computational complexity, we will show that HDLP and GHDLP is not are not good improvements of DLP.With all the instruments in hand, we will show how some schemes based on GHDLP can be broken. Thus we can conclude that, all ideas of constructing cryptographic schemes based on the two problem are of no practical significance.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2023-06-27: last updated
- 2021-12-31: published
- Short URL
- https://ia.cr/2021/1701
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/1701,
author = {Ma Yanlong},
title = {Cryptanalysis of the Cryptosystems Based on the Generalized Hidden Discrete Logarithm Problem},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1701},
year = {2021},
url = {https://eprint.iacr.org/2021/1701}
}