12,259 research outputs found
On a new fast public key cryptosystem
This paper presents a new fast public key cryptosystem namely : a key
exchange algorithm, a public key encryption algorithm and a digital signature
algorithm, based on the difficulty to invert the following function :
.\\* Mod is modulo operation , Div is
integer division operation , a , p and q are integers where .\\* In
this paper we also evaluate the hardness of this problem by reducing it to SAT
A Smart Approach for GPT Cryptosystem Based on Rank Codes
The concept of Public- key cryptosystem was innovated by McEliece's
cryptosystem. The public key cryptosystem based on rank codes was presented in
1991 by Gabidulin -Paramonov-Trejtakov(GPT). The use of rank codes in
cryptographic applications is advantageous since it is practically impossible
to utilize combinatoric decoding. This has enabled using public keys of a
smaller size. Respective structural attacks against this system were proposed
by Gibson and recently by Overbeck. Overbeck's attacks break many versions of
the GPT cryptosystem and are turned out to be either polynomial or exponential
depending on parameters of the cryptosystem. In this paper, we introduce a new
approach, called the Smart approach, which is based on a proper choice of the
distortion matrix X. The Smart approach allows for withstanding all known
attacks even if the column scrambler matrix P over the base field Fq.Comment: 5 pages. to appear in Proceedings of IEEE ISIT201
A new public key cryptosystem based on IFS
Most public key encryption methods suffers from the inability to prove the difficulty of the algorithms, which summarizes under the category of mathematical problems
that have inverses which are believed (but not proven) to be
hard. The length and strength of the Cryptography keys are considered an important mechanism. The keys used for encryption and decryption must be strong enough to produce strong encryption. Fractals and chaotic systems have properties which have been extensively studied over the years, and derive their inherent complexity from the extreme
sensitivity of the system to the initial conditions. In this
paper a new cryptographic system based on Iterated Function Systems ( IFS) have been proposed to reduce the computation cost and increase the security for the public-key cryptography protocols. In the proposed public-key encryption algorithm, generate iterated function systems
as a global public element, then its Hutchinson operator is
used as a public key. To encrypt the plaintext with the receiver's public key we use one of the key agreement
protocols to generate a shared private key that used to find
the attractor of the IFS. The chaotic nature of the fractal functions ensures the security of the proposed public-key cryptosystem scheme
A McEliece cryptosystem using permutation codes
This paper is an attempt to build a new public-key cryptosystem; similar to
the McEliece cryptosystem, using permutation error-correcting codes. We study a
public-key cryptosystem built using two permutation error-correcting codes. We
show that these cryptosystems are insecure. However, the general framework in
these cryptosystems can use any permutation error-correcting code and is
interesting
- …