相关论文: On some block ciphers and imprimitive groups

In this paper, we propose a quasigroup based block cipher design. The round functions of the encryption and decryption algorithms use quasigroup based string transformations. We show the robustness of the design against the standard…

Cryptographic primitives are fundamental for information security: they are used as basic components for cryptographic protocols or public-key cryptosystems. In many cases, their security proofs consist in showing that they are reducible to…

The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Computational security in cryptography has a risk that computational assumptions underlying the security are broken in the future. One solution is to construct information-theoretically-secure protocols, but many cryptographic primitives…

The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key…

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

The Bivariate Function Hard Problem (BFHP) has been in existence implicitly in almost all number theoretic based cryptosystems. This work defines the BFHP in a more general setting and produces an efficient asymmetric cryptosystem. The…

In this paper two cryptographic methods are introduced. In the first method the presence of a certain size subgroup of persons can be checked for an action to take place. For this we use fragments of Raptor codes delivered to the group…

BEAR, LION and LIONESS are block ciphers presented by Biham and Anderson (1996), inspired by the famous Luby-Rackoff constructions of block ciphers from other cryptographic primitives (1988). The ciphers proposed by Biham and Anderson are…

We define the block neighborhood of a reversible CA, which is related both to its decomposition into a product of block permutations and to quantum computing. We give a purely combinatorial characterization of the block neighborhood, which…

The Ring Learning-With-Errors (LWE) problem, whose security is based on hard ideal lattice problems, has proven to be a promising primitive with diverse applications in cryptography. There are however recent discoveries of faster algorithms…

This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…

A block cipher is a bijective function that transforms a plaintext to a ciphertext. A block cipher is a principle component in a cryptosystem because the security of a cryptosystem depends on the security of a block cipher. A Feistel…

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly…

Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and…