Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
View through CrossRef
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 ElGamal cryptosystem by using the new sequence. In addition, they have compared that the new ElGamal cryptosystems and ElGamal cryptosystem in terms of cryptography. Then the authors have defined the third ElGamal cryptosystem. They have, particularly, called the new system as composite ElGamal cryptosystem. The authors made an application of composite ElGamal cryptosystem. Finally, the authors have compared that composite ElGamal cryptosystem and ElGamal cryptosystem in terms of cryptography and they have obtained that composite ElGamal cryptosystem is more advantageous than ElGamal cryptosystem.
Title: Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
Description:
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 ElGamal cryptosystem by using the new sequence.
In addition, they have compared that the new ElGamal cryptosystems and ElGamal cryptosystem in terms of cryptography.
Then the authors have defined the third ElGamal cryptosystem.
They have, particularly, called the new system as composite ElGamal cryptosystem.
The authors made an application of composite ElGamal cryptosystem.
Finally, the authors have compared that composite ElGamal cryptosystem and ElGamal cryptosystem in terms of cryptography and they have obtained that composite ElGamal cryptosystem is more advantageous than ElGamal cryptosystem.
Related Results
Perbandingan Penggunaan Bilangan Prima Aman Dan Tidak Aman Pada Proses Pembentukan Kunci
Perbandingan Penggunaan Bilangan Prima Aman Dan Tidak Aman Pada Proses Pembentukan Kunci
Algoritma ElGamal merupakan algoritma dalam kriptografi yang termasuk dalam kategori algoritma asimetris. Keamanan algoritma ElGamal terletak pada kesulitan penghitungan logaritma ...
New Forms of Defining the Hidden Discrete Logarithm Problem
New Forms of Defining the Hidden Discrete Logarithm Problem
There are introduced novel variants of defining the discrete logarithm problem in a hidden group, which represents interest for constructing post-quantum cryptographic protocols an...
Evaluation of the Coulomb logarithm using cutoff and screened Coulomb interaction potentials
Evaluation of the Coulomb logarithm using cutoff and screened Coulomb interaction potentials
The Coulomb logarithm is a fundamental plasma parameter which is commonly derived within the framework of the binary collision approximation. The conventional formula for the Coulo...
Implementasi Algoritma Elgamal dan kode HILL Untuk Keamanan Database
Implementasi Algoritma Elgamal dan kode HILL Untuk Keamanan Database
ABSTRAKPerkembangan dunia informasi saat ini semakin cepat memasuki berbagai bidang area, yang sedang berusaha memanfaatkan kecanggihan teknologi informasi masa kini. Masalah keama...
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...
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...
COMPOSITION SYMBOLS
COMPOSITION SYMBOLS
A thorough analysis of the possibilities of using existing mathematical symbols in composite geometry was carried out, and a conclusion was drawn about the need to create composite...
Alternative signature generation procedures in the digital signature schemes based on the hidden discrete logarithm problem
Alternative signature generation procedures in the digital signature schemes based on the hidden discrete logarithm problem
Public-key cryptographic algorithms and protocols based on computational difficulty of the factorization problem and on the discrete logarithm problem are widely used in informatio...