On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with effective automorphism of order

DOI10.1515/DMA-2013-022zbMath1353.11114OpenAlexW2326516898MaRDI QIDQ5249792

Mikhaĭl V. Nikolaev, D. V. Matyukhin

Publication date: 12 May 2015

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2013-022

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION ⋮ О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом

This page was built for publication: On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with effective automorphism of order