О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом

DOI10.4213/mvk144zbMath1476.11143OpenAlexW2789618043MaRDI QIDQ5152389

Mikhaĭl V. Nikolaev

Publication date: 20 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk144

zbMATH Keywords

elliptic curveGaudry-Schost algorithmefficient automorphismtwo-dimensional discrete logarithm problem

Mathematics Subject Classification ID

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

Related Items

Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-uniform birthday problem with applications to discrete logarithms
• Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
• An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
• On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with effective automorphism of order
• Algorithmic Number Theory

This page was built for publication: О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом