相关论文: Le cryptosysteme non-commutatif

The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a $p$-group, a cryptosystem was built by this author in 'A simple generalization of El-Gamal cryptosystem to non-abelian groups'. It…

Due to the rapid advances in the development of quantum computers and their susceptibility to errors, there is a renewed interest in error correction algorithms. In particular, error correcting code-based cryptosystems have reemerged as a…

This paper studies the MOR cryptosystem, using the automorphism group of the extra-special $p$-group of exponent $p$, for an odd prime $p$. Similar results can be obtained for extra-special $p$-groups of exponent $p^2$ and for the even…

In this paper it has been developed an algorithm for cryptography, using the Mellin's transform. Cryptography is very important to protect data to ensure that two people, using an insecure channel, may communicate in a secure way. In the…

Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this paper, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the…

In recent years cyber-attacks are continuously developing. This means that hackers can find their way around the traditional cryptosystems. This calls for new and more secure cryptosystems to take their place. This paper outlines a new…

In this paper we consider cryptographic applications of the arithmetic on the hyperoctahedral group. On an appropriate subgroup of the latter, we particularly propose to construct public key cryptosystems based on the discrete logarithm.…

Substitution boxes with thorough cryptographic strengths are essential for the development of strong encryption systems. They are the only portions capable of inducing nonlinearity in symmetric encryption systems. Bijective substitution…

We review the known results about characteristically nilpotent complex Lie algebras, as well as we comment recent developements in the theory.

In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper…

Despite the linearity of its encoding, compressed sensing may be used to provide a limited form of data protection when random encoding matrices are used to produce sets of low-dimensional measurements (ciphertexts). In this paper we…

We present a new attack against cryptosystems based on the rank metric. Our attack allows us to cryptanalyze two variants of the GPT cryptosystem which were designed to resist the attack of Overbeck.

A simple proof of the unconditional security of a relativistic quantum cryptosystem based on orthogonal states is proposed. Restrictions imposed by special relativity allow to substantially simplify the proof compared with the…

In recent years, a growing number of cryptosystems based on chaos have been proposed. But most of them encountered many problems such as small key space and weak security. In the present paper, a new kind of chaotic cryptosystem based on…

An improved design of a cryptosystem based on small Ree groups is proposed. We have changed the encryption algorithm and propose to use a logarithmic signature for the entire Ree group. This approach improves security against sequential key…

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.…

We establish combinatorial formulas for the index of a class of matrix Lie algebras whose matrix forms are encoded by strict partial orderings.

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…

We develop matrix cryptography based on linear recurrent sequences of any order that allows securing encryption against brute force and chosen plaintext attacks. In particular, we solve the problem of generalizing error detection and…

In this paper we investigate nilpotenct and probabilistically nilpotent Hopf algebras. We define nilpotency via a descending chain of commutators and give a criterion for nilpotency via a family of central invertible elements. These…