9 citations · 9 across the 6 of their papers we have counts for
6 papers
Generic case complexity and One-Way functions
Alex D. Myasnikov
The goal of this paper is to introduce ideas and methodology of the generic case complexity to cryptography community. This relatively new approach allows one to analyze the behavi…
Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol
Alex D. Myasnikov, Alexander Ushakov
The Anshel-Anshel-Goldfeld-Lemieux (abbreviated AAGL) key agreement protocol is proposed to be used on low-cost platforms which constraint the use of computational resources. The c…
Report on Generic Case Complexity
Robert Gilman, Alexei G. Miasnikov, Alexey D. Myasnikov +1
This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of a computational problem while ignoring atypical be…
Statistical analysis of the Diffie-Hellman key exchange protocol in a finite group
I. Florescu, A. Myasnikov, A. Mahalanobis
This paper presents a novel methodology to test the security of the Diffie-Hellman public key exchange protocol. The security of many cryptographic schemes rely on the hardness of…
A Hybrid Search Algorithm for the Whitehead Minimization Problem
A. D. Myasnikov, R. M Haralick
The Whitehead Minimization problem is a problem of finding elements of the minimal length in the automorphic orbit of a given element of a free group. The classical algorithm of Wh…
On the Andrews-Curtis equivalence
Alexei D. Myasnikov, Alexei G. Myasnikov, Vladimir Shpilrain
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which a…