Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics
Chandrashekhar Meshram
Gyan Ganga Institute of Technology and Sciences, Jabalpur (M.P.)
Computer Science & IT Electrical & Electronics Engineering Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
The Beta Cryptosystem Chandrashekhar Meshram
Bulletin of Electrical Engineering and Informatics Vol 4, No 2: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v4i2.442

Abstract

This paper, we introduce mainly the concept of beta cryptosystem, whose security is based on generalized discrete logarithm problem and integer factorization problem in the multiplicative group of finite fields. We show that the proposed public key cryptosystem based on generalized discrete logarithm problem and integer factorization problem, provides more security because of double computation comparing with the generalized discrete logarithm problem and integer factorization problem. Hence the adversary has to solve distinct discrete logarithm problems and integer factorization problem simultaneously in the multiplicative group of finite fields in order to recover a corresponding plaintext from the received cipertext. Therefore, this scheme is expected to gain a higher level of security. We next show that, the newly developed scheme is efficient with respect to encryption and decryption and the validity of this algorithm is proven by applying to message that are text and returning the original message in numerical examples.
The Beta Cryptosystem Chandrashekhar Meshram
Bulletin of Electrical Engineering and Informatics Vol 4, No 2: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v4i2.442

Abstract

This paper, we introduce mainly the concept of beta cryptosystem, whose security is based on generalized discrete logarithm problem and integer factorization problem in the multiplicative group of finite fields. We show that the proposed public key cryptosystem based on generalized discrete logarithm problem and integer factorization problem, provides more security because of double computation comparing with the generalized discrete logarithm problem and integer factorization problem. Hence the adversary has to solve distinct discrete logarithm problems and integer factorization problem simultaneously in the multiplicative group of finite fields in order to recover a corresponding plaintext from the received cipertext. Therefore, this scheme is expected to gain a higher level of security. We next show that, the newly developed scheme is efficient with respect to encryption and decryption and the validity of this algorithm is proven by applying to message that are text and returning the original message in numerical examples.
The Beta Cryptosystem Chandrashekhar Meshram
Bulletin of Electrical Engineering and Informatics Vol 4, No 2: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (120.791 KB) | DOI: 10.11591/eei.v4i2.442

Abstract

This paper, we introduce mainly the concept of beta cryptosystem, whose security is based on generalized discrete logarithm problem and integer factorization problem in the multiplicative group of finite fields. We show that the proposed public key cryptosystem based on generalized discrete logarithm problem and integer factorization problem, provides more security because of double computation comparing with the generalized discrete logarithm problem and integer factorization problem. Hence the adversary has to solve distinct discrete logarithm problems and integer factorization problem simultaneously in the multiplicative group of finite fields in order to recover a corresponding plaintext from the received cipertext. Therefore, this scheme is expected to gain a higher level of security. We next show that, the newly developed scheme is efficient with respect to encryption and decryption and the validity of this algorithm is proven by applying to message that are text and returning the original message in numerical examples.
Co-Authors