Earticle

초록

영어

In 1984, Shamir proposed the concept of the ID-based cryptosystem (IBC). Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large public key file is not required. Since new cryptographic schemes always face security challenges and many integer factorization and discrete logarithm based cryptographic systems have been deployed, therefore, the purpose of this paper is to design a transformation process that can transfer the entire integer factorization problem and discrete logarithm problem based cryptosystems into the ID-based systems rather than re-invent a new system. We consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.

목차

Abstract
 1. Introduction
 2. The Public Key Encryption based on Factoring and Discrete log
  2.1. Key Generation
  2.2. Encryption
  2.3. Decryption
 3. Consistency of the Algorithm
 4. Example
 5. Implementation of the IBC
  5.1. Preparation for the Center and Each Entity
 6. System Initialization Parameters
  6.1 Center Secrete Information
  6.2 Center Public Information
  6.3 EntitySecretes Keys
  6.4 Entitypublic information:
 7. Proposed IBC
  7.1 Encryption
  7.2 Decryption
 8. Security Analysis and Discus
 9. Enhancement of Security and Processing Cost
  9.1. Encryption
  9.2. Decryption
 10. Conclusion
 References

키워드

저자

• Chandrashekhar Meshram [ Department of Mathematics RTM Nagpur University, Nagpur, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605