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

DOI10.1515/DMA-2013-022zbMATH Open1353.11114OpenAlexW2326516898MaRDI QIDQ5249792FDOQ5249792

Authors: 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

Recommendations

• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• К вопросу о сведении вычисления дискретных логарифмов на эллиптической кривой к вычислению дискретных логарифмов в конечном поле
• An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems

Mathematics Subject Classification ID

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

Cited In (3)

• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION
• Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms

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 6

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