Plactic key agreement (insecure?)

DOI10.1515/JMC-2022-0010MaRDI QIDQ2689206zbMATH OpenOpenAlexFDO

Authors Daniel R. L. Brown

Publication date 9 March 2023

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/jmc-2022-0010

zbMATH Keywords

cryptographykey exchangeKnuth's multiplication of semistandard tableauxplactic monoid

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Cryptography (94A60)

Recommendations

• Cryptanalysing variants of Stickel's key agreement scheme
• Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
• scientific article; zbMATH DE number 1952894
• Cryptanalysis of a 2-party key establishment based on a semigroup action problem
• scientific article; zbMATH DE number 1617914

Cites work

• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• An application of Young tableaux to cryptography
• Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 3817997 (Why is no real title available?)
• scientific article; zbMATH DE number 1375571 (Why is no real title available?)
• Identities in plactic, hypoplactic, sylvester, Baxter, and related monoids
• Longest Increasing and Decreasing Subsequences
• New directions in cryptography
• On the Representations of the Symmetric Group
• Permutations, matrices, and generalized Young tableaux
• Secure communications over insecure channels
• Tropical representations and identities of plactic monoids

Cited in

(1)

• Division in the plactic monoid

This page was built for publication: Plactic key agreement (insecure?)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689206)