• Pulugu Harshavardhan Reddy
• Ashriya Deb
• Gadug Shudhamshu

INFORMATION PROTECTION IN DISTRIBUTED COMPUTING IS A BASIC ISSUE TODAY. COMPLETELY HOMOMORPHIC ENCRYPTION PLANS ARE VERY SUGGESTED FOR INFORMATION SECURITY IN DISTRIBUTED COMPUTING. INDEED, PRIVACY OF REASONABLE INFORMATION CAN BE SAVED REGARDLESS OF WHETHER A NON-CONFIDED IN CLOUD SERVER FORMS IT; THE SECRET BEHIND THIS IS COMPLETELY HOMOMORPHIC ENCRYPTION PLANS PERMIT PREPARING ENCODED INFORMATION WITHOUT THE NEED OF AN EARLIER UNSCRAMBLING. IN THIS PAPER WE PRESENT ANOTHER COMPLETELY HOMOMORPHIC ENCRYPTION CONSPIRE FROM NUMBERS. OUR ENCRYPTION PLAN CAN BE UTILIZED BASICALLY TO VERIFY REASONABLE INFORMATION IN DISTRIBUTED COMPUTING. THE PROPOSED PLAN UTILIZES A HUGE NUMBER RING AS CLEARTEXT SPACE AND ONE KEY FOR ENCRYPTION AND DECODING, FOR EXAMPLE IT IS A SYMMETRIC ENCRYPTION CONSPIRE.

"Homomorphic Data Encryption", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.536-541, June-2019, Available :http://www.jetir.org/papers/JETIR1906366.pdf

"Homomorphic Data Encryption", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp536-541, June-2019, Available at : http://www.jetir.org/papers/JETIR1906366.pdf