Open Access   Article Go Back

An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem

Sumalatha Gunnala1 , D.S.R. Murthy2 , Shirisha Kakarla3

Section:Review Paper, Product Type: Journal Paper
Volume-6 , Issue-9 , Page no. 687-690, Sep-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i9.687690

Online published on Sep 30, 2018

Copyright © Sumalatha Gunnala, D.S.R. Murthy, Shirisha Kakarla . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Sumalatha Gunnala, D.S.R. Murthy, Shirisha Kakarla, “An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.9, pp.687-690, 2018.

MLA Style Citation: Sumalatha Gunnala, D.S.R. Murthy, Shirisha Kakarla "An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem." International Journal of Computer Sciences and Engineering 6.9 (2018): 687-690.

APA Style Citation: Sumalatha Gunnala, D.S.R. Murthy, Shirisha Kakarla, (2018). An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem. International Journal of Computer Sciences and Engineering, 6(9), 687-690.

BibTex Style Citation:
@article{Gunnala_2018,
author = {Sumalatha Gunnala, D.S.R. Murthy, Shirisha Kakarla},
title = {An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2018},
volume = {6},
Issue = {9},
month = {9},
year = {2018},
issn = {2347-2693},
pages = {687-690},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2928},
doi = {https://doi.org/10.26438/ijcse/v6i9.687690}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i9.687690}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2928
TI - An Attribute Involved Non deterministic Cryptosystem using Composite Residuosity Class Problem
T2 - International Journal of Computer Sciences and Engineering
AU - Sumalatha Gunnala, D.S.R. Murthy, Shirisha Kakarla
PY - 2018
DA - 2018/09/30
PB - IJCSE, Indore, INDIA
SP - 687-690
IS - 9
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
389 318 downloads 243 downloads
  
  
           

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.

Key-Words / Index Term

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

References

[1] S. Goldwasser and S. Micali., “Probabilistic Encryption”, in Journal of Computer and System Sciences, 28, pp 270–299, 1984.
[2] D. Naccache and J. Stern, “A New Cryptosystem based on Higher Residues” , in Proc. of the 5th CCCS, pp 59–66. ACM press, 1998.
[3] T. Okamoto and S. Uchiyama, “A new public key cryptosystem as secure as factoring”, in Proc. Eurocrypt ’98, pp 310–318, 1998.
[4] P. Paillier, “Public-Key Cryptosystems Based on Discrete Logarithms Residues”, in Eurocrypt ’99, LNCS 1592, pp 223–238. Springer-Verlag, 1999.
[5] J C. Benaloh, “Verifiable Secret-Ballot Elections”, PhD Thesis, Yale University, 1988.
[6] 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.
[7] 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.
[8] 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.
[9] 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.
[10] 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.