An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem

Authors

  • Gunnala S Department of Information Technology, SreeNidhi Institute of Science and Technology, Hyderabad, India
  • Murthy DSR Department of Computer Science and Engineering, Geethanjali College of Engineering and Technology, Hyderabad, India
  • Kakarla S Department of Computer Science and Engineering, SreeNidhi Institute of Science and Technology, Hyderabad, India

DOI:

https://doi.org/10.26438/ijcse/v6i9.687690

Keywords:

Attributes, Composite residuosity classes, Decryption, Encryption, and Intractability

Abstract

In this paper, we design a public key encryption scheme, is based on the composite residuosity classes and having the property as randomization, also called as non- determinism. The non-deterministic nature of this cryptosystem produces dissimilar ciphertexts for a given same plaintext character on each iteration. The intractability of factorization of this scheme is achieved through the concept of composite residuosity class problem. The key involved in the encryption procedure of the scheme uses the credentials like unique identities of the sender to ensure the authenticity of the user. These identities, are also called attributes of the user, include email, Social Security Number (SSN) or Aadhaar number etc. While encrypting the message, the sender will use any of his identity value as a key in the procedure. The recipient can calculate this attribute value in the decryption procedure

References

S. Goldwasser and S. Micali., “Probabilistic Encryption”, in Journal of Computer and System Sciences, 28, pp 270–299, 1984.

D. Naccache and J. Stern, “A New Cryptosystem based on Higher Residues” , in Proc. of the 5th CCCS, pp 59–66. ACM press, 1998.

T. Okamoto and S. Uchiyama, “A new public key cryptosystem as secure as factoring”, in Proc. Eurocrypt ’98, pp 310–318, 1998.

P. Paillier, “Public-Key Cryptosystems Based on Discrete Logarithms Residues”, in Eurocrypt ’99, LNCS 1592, pp 223–238. Springer-Verlag, 1999.

J C. Benaloh, “Verifiable Secret-Ballot Elections”, PhD Thesis, Yale University, 1988.

G. Sumalatha, D.S.R. Murthy and K. Shirisha , “A Secure Intractable Public Key Cryptosystem Involving p-Sylow

Subgroup” , International journal of Network Security, in press.

R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, in Communications of the ACM, 21(2), pp120–126, 1978.

V. Kapoor, “Data Encryption and Decryption Using Modified RSA Cryptography Based on Multiple Public Keys and ‘n’prime

Number”, International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.35-38, 2013.

Sumalatha Gunnala, Shirisha Kakarla and Sreerama Chandra

Murthy Dasika , “An Attribute Involved Public Key Cryptosystem

Based on p-Sylow Subgroups and Randomization” , Journal of Applied Computer Science & Mathematics , vol. 12, Issue 1/2018, pp 34-38, 2018.

Sarita Sharma, Rakesh Gaherwal, “Comparative Study and Analysis of Unique Identification Number and Social Security Number”, International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.1, pp.27-30, 2017.

Downloads

Published

2025-11-15
CITATION
DOI: 10.26438/ijcse/v6i9.687690
Published: 2025-11-15

How to Cite

[1]
S. Gunnala, D. Murthy, and S. Kakarla, “An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem”, Int. J. Comp. Sci. Eng., vol. 6, no. 9, pp. 687–690, Nov. 2025.

Issue

Vol. 6 No. 9 (2018): IJCSE September Editor

Section

Review Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.