scholar.google.com › citations
In this paper, we further reduce the reduction complexity presented in Ying and Kunihiro's work and increase the range of k and n for the tight lower bound of k ...
“Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method” is a paper by Haoxuan Wu Jincheng Zhuang published in 2024. It has an ...
Wu H., Zhuang J. Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method // Information Processing Letters. 2025. Vol. 188. p.
Bibliographic details on Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method.
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method. 通过MDS矩阵方法对广义多重离散对数问题的更紧界.
This work can be regarded as a generalization and extension on the hardness of the multiple discrete logarithm problem analyzed by Yun (EUROCRYPT '15).
An improved spectral lower bound of treewidth. 2024-10-1. Details · Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method.
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method. Haoxuan Wu, Jincheng Zhuang. Article 106535: View PDF. Article preview.
Works (8) ; Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method. Information Processing Letters. 2025-02 | Journal article.
People also ask
Why is the discrete logarithm problem hard?
What is the time complexity of the discrete logarithm problem?
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method. Inf. Process. Lett. 188: 106535 (2025); 2024. [j16]. view. electronic ...