Alexander Ushakov

dblp:69/5394 · DBLP profile ↗
← Back
12ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0001-9042-7857ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5Theory of computation · 5 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Quadratic equations in the lamplighter group
Alexander Ushakov, Chloe Weiers
J. Symb. Comput.1
2024 Complexity of Spherical Equations in Finite Groups
Caroline Mattes, Alexander Ushakov, Armin Weiß
SOFSEM2
2020 Soft Decision Decoding in Mud Pulse Telemetry System
abstract
In this paper, we propose a new probabilistic decoding method for the measurement-while-drilling telemetry system. The mud pulse telemetry system transmits the data from inside a borehole to the surface during drilling operations. The mud pulser is equipped with a mechanical valve, which partly shuts the mud stream for a short time, realizing modulation. The system modulates the drilling mud in the well, creating pressure pulses, which are sampled on the pressure sensor at the surface pump and further decoded into digital data. In our method, each detected pulse is assigned with reliability, calculated from informative pulse measures (rising edge slope, duration and delay to the previous pulse). Knowing a set of possible information packet lengths and reliability for each detected pulse, one can apply softdecision decoding to extract information with higher probability. This approach is similar to the Viterbi soft decoder, but in our case information is not encoded. The algorithm was implemented and validated in real wells. Field tests demonstrate 32 percent reduction in packet error rate in the real-life well on the 8750 meters depth borehole.
Andrey Ivanov 0001, Dmitry Lakontsev, Alexey Fisenko, Alexander Ushakov
VTC Spring4
2019 An attack on the Walnut digital signature algorithm
Matvei Kotov, Anton Menshov, Alexander Ushakov
Des. Codes Cryptogr.3
2018 Subset sum problem in polycyclic groups
Andrey Nikolaev, Alexander Ushakov
J. Symb. Comput.2
2016 Generic case completeness
Alexei G. Myasnikov, Alexander Ushakov
J. Comput. Syst. Sci.2
2016 Knapsack problems in products of groups
Elizaveta Frenkel, Andrey Nikolaev, Alexander Ushakov
J. Symb. Comput.3
2014 A Linear Algebra Attack to Group-Ring-Based Key Exchange Protocols
Martin Kreuzer, Alex D. Myasnikov, Alexander Ushakov
ACNS3
2012 Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
abstract
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the one-relator Baumslag group is in P. Before that the best known upper bound was non-elementary. In the present paper we provide new results for power circuits and we give new applications in algorithmic group theory: 1. We define a modified reduction procedure on power circuits which runs in quadratic time thereby improving the known cubic time complexity. 2. We improve the complexity of the Word Problem for the Baumslag group to cubic time thereby providing the first practical algorithm for that problem. (The algorithm has been implemented and is available in the CRAG library.) 3. The main result is that the Word Problem of Higman's group is decidable in polynomial time. The situation for Higman's group is more complicated than for the Baumslag group and forced us to advance the theory of Power Circuits.
Volker Diekert, Jürn Laun, Alexander Ushakov
STACS3
2008 An Authentication Scheme Based on the Twisted Conjugacy Problem
Vladimir Shpilrain, Alexander Ushakov
ACNS2
2005 Thompson's Group and Public Key Cryptography
Vladimir Shpilrain, Alexander Ushakov
ACNS2
2005 A Practical Attack on a Braid Group Based Cryptographic Protocol
Alexei G. Myasnikov, Vladimir Shpilrain, Alexander Ushakov
CRYPTO3