Related papers: On some block ciphers and imprimitive groups
The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
Recent years have shown that more than ever governments and intelligence agencies try to control and bypass the cryptographic means used for the protection of data. Backdooring encryption algorithms is considered as the best way to enforce…
The secure instantiation of the random oracle is one of the major open problems in modern cryptography. We investigate this problem using concepts and methods of algorithmic randomness. In modern cryptography, the random oracle model is…
A classical result of Claborn states that every abelian group is the class group of a commutative Dedekind domain. Among noncommutative Dedekind prime rings, apart from PI rings, the simple Dedekind domains form a second important class. We…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
Similarly to how the classical group ring isomorphism problem asks, for a commutative ring $R$, which information about a finite group $G$ is encoded in the group ring $RG$, the twisted group ring isomorphism problem asks which information…
A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering…
We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…
Semi-quantum cryptography involves at least one user who is semi-quantum or "classical" in nature. Such a user can only interact with the quantum channel in a very restricted way. Many semi-quantum key distribution protocols have been…
Quantum homomorphic encryption, which allows computation by a server directly on encrypted data, is a fundamental primitive out of which more complex quantum cryptography protocols can be built. For such constructions to be possible,…
A transitive permutation group $G$ on a finite set $\Omega$ is said to be pre-primitive if every $G$-invariant partition of $\Omega$ is the orbit partition of a subgroup of $G$. It follows that pre-primitivity and quasiprimitivity are…
Privacy-preserving neural networks have attracted increasing attention in recent years, and various algorithms have been developed to keep the balance between accuracy, computational complexity and information security from the…
Strongly bounded groups are those groups for which every action by isometries on a metric space has orbits of finite diameter. Many groups have been shown to have this property, and all the known infinite examples so far have cardinality at…
The deep locus of a cluster variety is defined to be the set of its points that do not belong to any cluster torus. We show that, if the cluster variety has a seed whose mutable part is a tree without multiple edges, then the deep locus can…
A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…
In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
Can we do a topological study of various classes of normal subgroups endowed with a hull-kernel-type topology? In this paper, we have provided an answer to this question. We have introduced as well a new class of normal subgroups called…
A 2-sphere embedded in the 4-sphere invariant under a circle action is called a branched twist spin. A branched twist spin is constructed from a 1-knot in the 3-sphere and a pair of coprime integers uniquely. In this paper, we study, for…