ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION

DOI10.17223/20710410/28/10OpenAlexW4249910769MaRDI QIDQ5150693

Mikhaĭl V. Nikolaev

Publication date: 15 February 2021

Published in: PRIKLADNAYa DISKRETNAYa MATEMATIKA (Search for Journal in Brave)

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

zbMATH Keywords

Gaudry-Schost algorithmdiscrete logarithm problem in interval

Mathematics Subject Classification ID

Difference and functional equations (39-XX) Information and communication theory, circuits (94-XX)

Cites Work

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