A Transformation for Lifting Discrete Logarithm Based Cryptography to Post-Quantum Cryptography

ePrint Report: A Transformation for Lifting Discrete Logarithm Based Cryptography to Post-Quantum Cryptography

Danilo Gligoroski

We construct algebraic structures where rising to the non-associative power indices is no longer tied with the Discrete Logarithm Problem but with a problem that has been analysed in the last two decades and does not have a quantum polynomial algorithm that solves it. The problem is called Exponential Congruences Problem. By this, \emph{we disprove} the claims presented in the ePrint report 2021/583 titled "Entropoids: …

algorithm called cryptography eprint report non post-quantum post-quantum cryptography power problem quantum quantum cryptography report rising transformation