Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Cryptanalysis of a combinatorial public key cryptosystem
View through CrossRef
AbstractWe discuss pitfalls in the security of the combinatorial public key cryptosystem based on Nielsen transformations inspired by the ElGamal cryptosystem proposed by Fine, Moldenhauer and Rosenberger. We introduce three different types of attacks to possible combinatorial public key encryption schemes and apply these attacks to the scheme corresponding to the cryptosystem under discussion. As a result of our observation, we show that under some natural assumptions the scheme is vulnerable to at least one of the proposed attacks.
Title: Cryptanalysis of a combinatorial public key cryptosystem
Description:
AbstractWe discuss pitfalls in the security of the combinatorial public key cryptosystem based on Nielsen transformations inspired by the ElGamal cryptosystem proposed by Fine, Moldenhauer and Rosenberger.
We introduce three different types of attacks to possible combinatorial public key encryption schemes and apply these attacks to the scheme corresponding to the cryptosystem under discussion.
As a result of our observation, we show that under some natural assumptions the scheme is vulnerable to at least one of the proposed attacks.
Related Results
Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
In this chapter, the authors have defined a new ElGamal cryptosystem by using the power Fibonacci sequence module m. Then they have defined a new sequence module m and the other El...
Identification of Fake Messages Using Two PKCs
Identification of Fake Messages Using Two PKCs
Abstract
In this paper, two public key cryptosystems are presented and analyzed. The first cryptosystem is an improvement of RSA public key cryptosystem. The second...
Identification of Fake Messages Using Two PKCs
Identification of Fake Messages Using Two PKCs
Abstract
In this paper, two public key cryptosystems are presented and analyzed. The first cryptosystem is an improvement of the RSA public key c...
Modified Playfair cryptosystem for improved data security
Modified Playfair cryptosystem for improved data security
Playfair is the earliest known classical block cipher which is capable of taking two characters as a unit in the process of encryption and decryption. However, the cipher is suffer...
Deep Learning-Based Cryptanalysis of a Simplified AES Cipher
Deep Learning-Based Cryptanalysis of a Simplified AES Cipher
Recently, Deep Neural Networks have shown great deal of reliability and applicability as its applications spread in different areas. This paper proposes a cryptanalysis model based...
Basic Algorithms Quantum Cryptanalysis
Basic Algorithms Quantum Cryptanalysis
Purpose of the article: development of quantum algorithms for efficient solution of cryptanalysis problems of asymmetric encryption schemes (RSA, ElGamal) and digital signature (DS...
On the High Dimensional RSA Algorithm—A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory
On the High Dimensional RSA Algorithm—A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory
<div> The most known of public key cryptosystem was introduced in 1978 by Rivest, Shamir and Adleman [19] and now called the RSA public key cryptosystem in their honor. Later...
On the High Dimensional RSA Algorithm—A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory
On the High Dimensional RSA Algorithm—A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory
<div> The most known of public key cryptosystem was introduced in 1978 by Rivest, Shamir and Adleman [19] and now called the RSA public key cryptosystem in their honor. Later...