Related papers: Non-associative key establishment for left distrib…
This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local…
A manifestly N=2 supersymmetric coset formalism is applied to analyse the "fermionic" extensions of N=2 $a=4$ and $a=-2$ KdV hierarchies. Both these hierarchies can be obtained from a manifest N=2 coset construction. This coset is defined…
With the evolution of the Internet, multicast communications seem particularly well adapted for large scale commercial distribution applications, for example, the pay TV channels and secure videoconferencing. Key management for multicast…
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy…
We classify nonultralocal Poisson brackets for 1-dimensional lattice systems and describe the corresponding regularizations of the Poisson bracket relations for the monodromy matrix . A nonultralocal quantum algebras on the lattices for…
In a wireless sensor network, the virtual connectivity between nodes is a function of the keys shared between various nodes. Pre-embedding these key configurations in the nodes would make the network inflexible. On the other hand,…
Motivated by M-theory, we define a new type of non-associative algebra involving usual and cubic matrices at the same time. The resulting algebra can be regarded as a two-term truncated $L_\infty$ algebra giving rise to a fundamental…
All possible Poisson-Lie (PL) structures on the 3D real Lie group generated by a dilation and two commuting translations are obtained. Its classification is fully performed by relating these PL groups with the corresponding Lie bialgebra…
Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subscribe systems both in centralized and distributed contexts.…
We consider a natural generalization of braids which we call shrinking braids. We state the relations of shrinking braids and use them to define algebraically the monoid $R$. We endow a subset of $R$ with a \emph{left distributive monoid}…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
In this paper, we address the problem of K-out-of-L exclusion, a generalization of the mutual exclusion problem, in which there are $\ell$ units of a shared resource, and any process can request up to $\mathtt k$ units ($1\leq\mathtt…
In this paper, we propose a brand new public key encryption scheme in the Lie group that is a non-abelian group. In particular, we firstly investigate the intractability assumptions in the Lie group, including the non-abelian factoring…
Peer to peer network architecture introduces many desired features including self-scalability that led to achieving higher efficiency rate than the traditional server-client architecture. This was contributed to the highly distributed…
Using the fact that Hopf-Galois structures on separable extensions and skew bracoids are both intrinsically connected to transitive subgroups of the holomorph of a finite group, we present algorithms to classify and enumerate these objects…
This work studies the proof theory of left (right) skew monoidal closed categories and skew monoidal bi-closed categories from the perspective of non-associative Lambek calculus. Skew monoidal closed categories represent a relaxed version…
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial…
Li et al. presented a protocol [Int. Journal of Quantum Information, Vol. 4, No. 6 (2006) 899-906] for quantum key distribution based on entanglement swapping. In this protocol they use random and certain bits to construct a classical key…
A central theme in distributed network algorithms concerns understanding and coping with the issue of locality. Inspired by sequential complexity theory, we focus on a complexity theory for distributed decision problems. In the context of…
A left brace is a triple $(\mathcal{B},+,\cdot)$, where $(\mathcal{B},+)$ is an abelian group, $(\mathcal{B},\cdot)$ is a group, and there is a left-distributivity-like axiom that relates between the two operations in $\mathcal{B}$. In…