Notes on Reference Citations - Version 2.71, by Dr. Herong Yang
Implementing the Information Security using Modified RSA
'How Secure Is RSA Algorithm?' tutorial was cited in an International Journal of Innovative Research in Computer and Communication Engineering paper in 2016.
The How Secure Is RSA Algorithm? tutorial was cited in an International Journal of Innovative Research in Computer and Communication Engineering paper in 2016.
Subject: Implementing the Information Security using Modified RSA Algorithm with the Help of N Prime Number Date: Oct 15, 2016 Author: Md Wasim, Prof. Dr Pranam Paul Source: https://www.ijircce.com/upload/2016/october/92_23_Implementing.pdf ABSTRACT: In any communication, security is the most important issue in today‟s world. Lots of data security and data hiding algorithms have been developed in the last decade, which worked as motivation for the research. The scenario of present day of information security system includes confidentiality, authenticity, integrity, non-repudiation. This present work focus is enlightening the technique to secure data or message with authenticity and integrity. With the growth of internet and network, the need for secure data transmission become more and more essential and important, as security is a major concern in the internet world. Data likely to be kept hide from all people except from the authorized user cannot be sent in plain text. So the plain text should be codified by the process of encryption. Each type of data has its own features; therefore different techniques should be used to protect confidential data from unauthorized access. Here we modify the RSA algorithm with N prime number. The earlier RSA algorithm is use to encrypt the text with the help of two prime number, now the modify RSA algorithm can also be used to encrypt the plain text with the help of N prime number. In this algorithm encryption is done on the binary file so it can be applicable for any type of data such as text as well as multimedia. Here the same idea of cryptography is working (i.e. using key conversion of plain text into cipher text called encryption and the reverse means cipher text to plain text called decryption). ... REFERENCES  Pranam Paul, Saurabh Dutta, A K Bhattacharjee,”AnApproach to ensure Security through Bit-level Encryption with Possible Lossless Compression”, International Journal ofComputer Science and Network Security”, Vol. 08, No. 2, pp.291 – 299, 2008.  William Stallings, “Cryptography and network security principles and practices”, 4th edition, Pearson Education, Inc.publishing as Prentice Hal, 2006.  Atul Kahate, „„Cryptography and Network Security‟‟, 4th edition, McGraw-Hill publishing company limited, 2008  http://www.herongyang.com/Cryptography /RSA-Algorithm-How-Secure-Is-RSA-Algorithm.html  Pranam Paul, Saurabh Dutta, A K Bhattacharjee ; ”An Approach to ensure Security through Bit-level Encryption with Possible Lossless Compression”, International Journal of Computer Science and Network Security”, Vol. 08, No. 2, pp. 291 – 299, 2008.  Moinak chowdhury , Prof. Dr. Pranam Paul ; Block Based Data Encryption and ecryption Using The Distence Between Prime Numbers” ; 2015. ...
Table of Contents