Related papers: Polycyclic groups: A new platform for cryptology?

We propose a new computational problem over the noncommutative group, called the twin conjugacy search problem. This problem is related to the conjugacy search problem and can be used for almost all of the same cryptographic constructions…

In this paper, we propose two cryptosystems based on group rings and existing cryptosystem. First one is Elliptic ElGamal type group ring public key cryptosystem whose security is greater than security of cryptosystems based on elliptic…

It is showed a new cryptosystem based on non-commutativ calculations of matrices, more specially nilpotent matrices. The cryptosystem seems powerful to restsist against usual attacks.

We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…

We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be…

The article explores the creation of a cryptosystem using a halidon group ring of a dihedral group. Due to the non-abelian nature of the group, constructing the cryptosystem is more challenging compared to an abelian group. The logic used…

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…

A new cryptosystem based on the fundamental time--energy uncertainty relation is proposed. Such a cryptosystem can be implemented with both correlated photon pairs and single photon states.

An analysis of a recently proposed cryptosystem based on chaotic oscillators and feedback inversion is presented. It is shown how the cryptosystem can be broken when Duffing's oscillator is considered. Some implementation problems of the…

In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the…

In this paper, a new key-agreement scheme is proposed and analyzed. In addition to being provably secure in shared secret key indistinguishability model, the scheme has an interesting feature: while using exponentiation over a cyclic…

A new proposal for group key exchange is introduced which proves to be both efficient and secure and compares favorably with state of the art protocols.

SIS problem has numerous applications in cryptography. Known algorithms for solving that problem are exponential in complexity. A new algorithm is suggested in this note, its complexity is sub-exponential for a range of parameters.

In a previous paper we generalized the definition of a multilinear map to arbitrary groups and introduced two multiparty key-exchange protocols using nilpotent groups. In this paper we have a closer look at the protocols and will address…

A cryptographic protocol (CP) is a distributed algorithm designed to provide a secure communication in an insecure environment. CPs are used, for example, in electronic payments, electronic voting procedures, database access systems, etc.…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

We investigate security properties of the Anshel-Anshel-Goldfeld commutator key-establishment protocol used with certain polycyclic groups. We show that despite low success of the length based attack the protocol can be broken by a…

We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring. We can find the secret key and break entirely the protocols.

We establish an algorithm to encrypt and decrypt messages, where messages can be seen as elements of a finite field, using of mutations in a cluster algebra finite type.

At Eurocrypt'99, Paillier presented a public-key cryptosystem based on a novel computational problem. It has interested many researchers because it was additively homomorphic. In this paper, we show that there is a big difference between…