相关论文: A note on using finite non-abelian $p$-groups in t…

A characterization of predicate encryption (PE) with support for homomorphic operations is presented and we describe the homomorphic properties of some existing PE constructions. Even for the special case of IBE, there are few known…

One of the possible generalizations of the discrete logarithm problem to arbitrary groups is the so-called conjugacy search problem (sometimes erroneously called just the conjugacy problem): given two elements a, b of a group G and the…

In his paper Stadler develops techniques for improving the security of existing secret sharing protocols by allowing to check whether the secret shares given out by the dealer are valid. In particular, the secret sharing is executed over…

Any non-abelian finite $p$-group has a non-inner automorphism of order $p$.

We develop an analogue of probability theory for probabilities taking values in topological groups. We generalize Kolmogorov's method of axiomatization of probability theory: main distinguishing features of frequency probabilities are taken…

Several cryptographic protocols constructed based on less-known algorithmic problems, such as those in non-commutative groups, group rings, semigroups, etc., which claim quantum security, have been broken through classical reduction methods…

We deal with some pcf investigations mostly motivated by abelian group theory problems and deal their applications to test problems (we expect reasonably wide applications). We prove almost always the existence of aleph_omega-free abelian…

Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor polynomial time algorithm for numerical field problems like…

This paper considers large-scale linear stochastic systems representing, e.g., spatially discretized stochastic partial differential equations. Since asymptotic stability can often not be ensured in such a stochastic setting (e.g. due to…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group…

In this paper we generalize the definition of a multilinear map to arbitrary groups and develop a novel idea of multilinear cryptosystem using nilpotent group identities.

We construct an uncountable family of groups of type $FP$. In contrast to every previous construction of non-finitely presented groups of type $FP$ we do not use Morse theory on cubical complexes; instead we use Gromov's graphical small…

We study nilpotent groups acting faithfully on complex algebraic varieties. We use a method of base change. For finite p-groups, we go from $k$, a number field, to a finite field in order to use counting lemmas. We show that a finite…

We build on a working program initiated by Pudl\'ak [Pud17] and construct an oracle relative to which each $\mathrm{coNP}$-complete set has $\mathrm{P}$-optimal proof systems and $\mathrm{NP}\cap\mathrm{coNP}$ does not have complete…

The purpose of this note is to construct an example of a discrete non-abelian group $G$ and a subset $E$ of $G$, not contained in any abelian subgroup, that is a completely bounded $\Lambda (p)$ set for all $p<\infty ,$ but is neither a…

We show that in a Morse local-to-global group where stable subgroups are separable, the product of any stable subgroups is separable. As an application, we show that the product of stable subgroups in virtually special groups is separable.

Let $p$ be a prime and $\mathbb{F}_p$ be a finite field of $p$ elements. Let $\mathbb{F}_pG$ denote the group algebra of the finite $p$-group $G$ over the field $\mathbb{F}_p$ and $V(\mathbb{F}_pG)$ denote the group of normalized units in…

This paper presents a novel methodology to test the security of the Diffie-Hellman public key exchange protocol. The security of many cryptographic schemes rely on the hardness of this problem. We are presenting a purely statistical test to…

We propose modifications of known quasigroup based stream ciphers. Systems of orthogonal n-ary groupoids are used.