Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem

DOI10.4213/mvk326zbMath1470.11318OpenAlexW3110623908MaRDI QIDQ3383117

Mikhaĭl V. Nikolaev

Publication date: 23 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/mvk326

zbMATH Keywords

Gaudry-Schost algorithmefficient automorphismtwo-dimensional discrete logarithm problem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)

Related Items (1)

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
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• The discrete logarithm problem for exponents of bounded height
• GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
• 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
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• Faster Compact Diffie–Hellman: Endomorphisms on the x-line
• Algorithmic Number Theory

This page was built for publication: Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem