Markovsky algorithm on i-invertibile groupoids
Nadeghda N. Malyutina, Alexandra V. Scerbacova, Victor A., Shcherbacov
TL;DR
This paper introduces a modification of the Markovsky cryptographic algorithm tailored for n-ary groupoids that are invertible in at least one position, expanding its applicability.
Contribution
It presents a novel adaptation of the Markovsky algorithm for a specific class of invertible n-ary groupoids, enhancing cryptographic versatility.
Findings
Modified algorithm applicable to a broader class of groupoids
Potential improvements in cryptographic security or efficiency
Theoretical validation of invertibility conditions
Abstract
We propose modification of Markovsky crypto-algorithm [2, 3, 4] on n-ary groupoids [1] that are invertible on at least one place.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · graph theory and CDMA systems · Mathematics and Applications