Related papers: Minimal Logarithmic Signatures for Sporadic Groups
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a quantum state to the other…
Let $G$ be a finite cyclic group. Every sequence $S$ of length $l$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be…
The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…
The article describes a new implementation of MST3 cryptosystems based on the automorphism group of the Suzuki function field. The main difference in the presented implementation is to use the logarithmic signature for encryption not only…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
Let $\Sigma$ be a closed surface other than the sphere, the torus, the projective plane or the Klein bottle. We construct a continuum of p.m.p. ergodic minimal profinite actions for the fundamental group of $\Sigma$, that are topologically…
Autonomous robots typically incorporate complex sensors in their decision-making and control loops. These sensors, such as cameras and Lidars, have imperfections in their sensing and are influenced by environmental conditions. In this…
A finite set system (FSS) is a pair (V; B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called blocks. In this paper, finite set systems are used to define a…
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coalesce into one cluster via a decentralized stochastic process,…
Based on Restricted Boltzmann Machines (RBMs), an improved pseudo-stochastic sequential cipher generator is proposed. It is effective and efficient because of the two advantages: this generator includes a stochastic neural network that can…
Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…
We prove that the minimal nontrivial finite quotient group of the mapping class group M_g of a closed orientable surface of genus g is the symplectic group PSp(2g,Z_2), for g = 3 and 4 (this might remain true, however, for arbitrary genus g…
We present a randomised variant of an algorithm of Lucchini and Thakkar for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.
We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…
In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over…
While lattices in semi-simple Lie groups are studied very well, only little is known about discrete subgroups of infinite covolume. The main class of examples are Schottky groups. Here we investigate some new examples. We consider subgroups…
Solving an integer least squares (ILS) problem usually consists of two stages: reduction and search. This thesis is concerned with the reduction process for the ordinary ILS problem and the ellipsoid-constrained ILS problem. For the…
This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA),…
In this article, we study a variant of the minimum dominating set problem known as the minimum liar's dominating set (MLDS) problem. We prove that the MLDS problem is NP-hard in unit disk graphs. Next, we show that the recent sub-quadratic…
Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS),…