2025-06-21 –, Gallery
Generalized Discrete Logarithm Problem (GDLP) is an extension of the Discrete Logarithm Problem (DLP). The DLP is not quantum secure. However we have proven that GDLP is. In this workshop we will discuss the complexity theory properties of the GDLP and compare it to the DLP.
Cem Unsal holds a PhD in Applied Mathematics from the University of Maryland, College Park, He is a quantum algorithms developer/inventor for combinatorial optimization, biochemistry, networks, and high-performance computing.
https://ar5iv.labs.arxiv.org/html/2212.12577