You are looking at a specific version 20210812:153406 of this paper.
See the latest version.
Paper 2021/625
Plactic key agreement
Daniel R. L. Brown
Abstract
Plactic key agreement is a new key agreement scheme that uses Knuth’s multiplication of semistandard tableaus from combinatorial algebra. The security of plactic key agreement relies on the difficulty of some computational problems, such as division of semistandard tableaus. Division by erosion uses backtracking to divide tableaus. Division by erosion is estimated to be infeasible against public keys of 768 or more bytes. If division by erosion is the best attack against plactic key agreement, then secure plactic key agreement could be practical.
Note: This version corrects two typos from the previous versions, one major about estimated security of challenge, 2^253, which has been corrected to 2^153.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- key agreementkey exchangecombinatoricsplactic monoidsemistandard tableau
- Contact author(s)
- danibrown @ blackberry com
- History
- 2022-09-23: last of 6 revisions
- 2021-05-17: received
- See all versions
- Short URL
- https://ia.cr/2021/625
- License
-
CC BY