Division in the plactic monoid

Abstract

In [D. R. L. Brown, Plactic key agreement (insecure?), J. Math. Cryptol. 17(1) (2023) 20220010], a novel cryptographic key exchange technique was proposed using the plactic monoid, based on the apparent difficulty of solving division problems in that monoid. Specifically, given elements [Formula: see text] in the plactic monoid, the problem is to find [Formula: see text] for which [Formula: see text], given that such a [Formula: see text] exists. In this paper, we introduce a metric on the plactic monoid and use it to give a probabilistic algorithm for solving that problem which is fast for parameter values in the range of interest.