Four-generated direct powers of partition lattices and authentication
From MaRDI portal
Publication:5013129
Abstract: For an integer , H. Strietz (1975) and L. Z'adori (1986) proved that the lattice Part of all partitions of is four-generated. Developing L. Z'adori's particularly elegant construction further, we prove that even the -th direct power Part of Part is four-generated for many but only finitely many exponents . E.g., Part is four-generated for every , and it has a four element generating set that is not an antichain for every . In connection with these results, we outline a protocol how to use these lattices in authentication and secret key cryptography.
Recommendations
- Four-element generating sets of partition lattices and their direct products
- Lower bound for the number of 4-element generating sets of direct products of two neighboring partition lattices
- scientific article; zbMATH DE number 4031760
- scientific article; zbMATH DE number 67323
- An interesting way to partition a number
Cited in
(6)- scientific article; zbMATH DE number 4031760 (Why is no real title available?)
- Sperner theorems for unrelated copies of posets and generating distributive lattices
- Lower bound for the number of 4-element generating sets of direct products of two neighboring partition lattices
- Minimum-sized generating sets of the direct powers of free distributive lattices
- Four-element generating sets of partition lattices and their direct products
- Atoms and coatoms in three-generated lattices
This page was built for publication: Four-generated direct powers of partition lattices and authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013129)