Hard Instances of Discrete Logarithm Problem and Cryptographic Applications

MaRDI QIDQ7188792arXivFDO

Authors Christopher Battarbee, Arman Darbinyan, Delaram Kahrobaei

Publication date 2025

Published in arXiv

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Torsion-free groups, finite rank (20K15) Cryptography (94A60)

arXiv classification

math.GR

This page was built for publication: Hard Instances of Discrete Logarithm Problem and Cryptographic Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7188792)