0 Up votes0 Down votes

22 views4 pagesPaper Title
Secure Data Communication using AES Algorithm, Palindrome Number & Color Code
Authors
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu
Abstract
Encryption is most effective way to achieve data security. This is done by converting the data into cipher text. The existing way of doing this was using Armstrong number and prime number. Since there are few Armstrong numbers therefore a crypt-analyst can easily find the key. In this paper, we are proposing a new encryption technique that uses AES algorithm using color code and palindrome numbers for encrypting any type of file which provides more security than other approach. This paper gives a technique to send data over the network in set of three keys (palindrome number, alphanumeric random key and ASCII value of color code). Normally a crypt-analyst can easily find out the key however in this approach a mixture of palindrome number and color code which is used for encrypting the data. In the same way, decryption will also be done at receiver's side by using inverse of encryption process.
Keywords
Palindrome number; Cryptography; Color code; Unique Alphanumeric key; AES Algorithm
Citation/Export
MLA
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu, “Secure Data Communication using AES Algorithm, Palindrome Number & Color Code”, April 16 Volume 4 Issue 6 , International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 136 - 138
APA
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu, April 16 Volume 4 Issue 6, “Secure Data Communication using AES Algorithm, Palindrome Number & Color Code”, International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 136 - 138

Apr 10, 2017

© © All Rights Reserved

PDF, TXT or read online from Scribd

Paper Title
Secure Data Communication using AES Algorithm, Palindrome Number & Color Code
Authors
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu
Abstract
Encryption is most effective way to achieve data security. This is done by converting the data into cipher text. The existing way of doing this was using Armstrong number and prime number. Since there are few Armstrong numbers therefore a crypt-analyst can easily find the key. In this paper, we are proposing a new encryption technique that uses AES algorithm using color code and palindrome numbers for encrypting any type of file which provides more security than other approach. This paper gives a technique to send data over the network in set of three keys (palindrome number, alphanumeric random key and ASCII value of color code). Normally a crypt-analyst can easily find out the key however in this approach a mixture of palindrome number and color code which is used for encrypting the data. In the same way, decryption will also be done at receiver's side by using inverse of encryption process.
Keywords
Palindrome number; Cryptography; Color code; Unique Alphanumeric key; AES Algorithm
Citation/Export
MLA
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu, “Secure Data Communication using AES Algorithm, Palindrome Number & Color Code”, April 16 Volume 4 Issue 6 , International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 136 - 138
APA
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu, April 16 Volume 4 Issue 6, “Secure Data Communication using AES Algorithm, Palindrome Number & Color Code”, International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 136 - 138

© All Rights Reserved

22 views

Paper Title
Secure Data Communication using AES Algorithm, Palindrome Number & Color Code
Authors
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu
Abstract
Encryption is most effective way to achieve data security. This is done by converting the data into cipher text. The existing way of doing this was using Armstrong number and prime number. Since there are few Armstrong numbers therefore a crypt-analyst can easily find the key. In this paper, we are proposing a new encryption technique that uses AES algorithm using color code and palindrome numbers for encrypting any type of file which provides more security than other approach. This paper gives a technique to send data over the network in set of three keys (palindrome number, alphanumeric random key and ASCII value of color code). Normally a crypt-analyst can easily find out the key however in this approach a mixture of palindrome number and color code which is used for encrypting the data. In the same way, decryption will also be done at receiver's side by using inverse of encryption process.
Keywords
Palindrome number; Cryptography; Color code; Unique Alphanumeric key; AES Algorithm
Citation/Export
MLA
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu, “Secure Data Communication using AES Algorithm, Palindrome Number & Color Code”, April 16 Volume 4 Issue 6 , International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 136 - 138
APA
Prof. Manoj Dhande, Akshaya Sawant, Nidhi Pandey, Pooja Sahu, April 16 Volume 4 Issue 6, “Secure Data Communication using AES Algorithm, Palindrome Number & Color Code”, International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 136 - 138

© All Rights Reserved

- Digital Signature
- IJETTCS-2015-01-01-12
- IJETTCS-2016-03-24-29
- METHODS TOWARD ENHANCING RSA ALGORITHM : A SURVEY
- Enhancement of Security in DNA Based Cryptographyee
- Investigation Report 2013
- _5
- RSA Algorithm and ClassParticipation
- it act 2000
- An Efficient Solution for Privacypreserving, Secure Remote Access to Sensitive Data
- A Location Based encryption technique and some of its applications
- LUC
- Key Recovery for Certification Authorities
- 100418
- SMU MCA Assignments
- Chapter 3
- Digital Signatures and Certificates
- PublicKey
- Introduction
- auditing operating systems and networks

You are on page 1of 4

______________________________________________________________________________________

Randomized Encryption Cryptosystem

1. 2.

R. Sivaraman Dr. Sonal Bharti

Ph.D. Research Scholar in Mathematics Head, Department of Mathematics

Sri Satya Sai University of Technology and Medical Sri Satya Sai University of Technology and Medical

Sciences, Bhopal, Madhya Pradesh Sciences

National Awardee for Popularizing Mathematics among Bhopal, Madhya Pradesh

masses, Chennai 600 094 Email: sbsonalbharti6@gmail.com

Email: rsivaraman1729@yahoo.co.in

Abstract

Abstract: - Cryptography is the art of secret writing. There are essentially two types of cryptosystems.

(i) Secret-key cryptosystems also called symmetric cryptosystems

(ii) Public-key cryptosystems also called asymmetric cryptosystems.

In this paper, we shall consider a Public-key cryptosystem whose security is based on the infeasibility of the Quadratic Residuosity

Problem (QRP)

__________________________________________________*****_________________________________________________

Algorithm:

This algorithm uses the randomized method to encrypt messages and is based on the Quadratic Residuosity Problem

(QRP) [1]. The algorithm is given in three steps, namely key generation, Message encryption and Decryption

Consider two persons say Ram and shyam. Both Ram and Shyam should do the following to generate their public and

secret Keys:

(i) Select two large distinct primes p and q, each with roughly the same size, say, each with bits.

(ii) Compute n = pq

y

(iii) Select a y Z / nZ , such that y Qn and 1 (i.e. y is a pseudo square modulo n) Qn is the set of all

n

quadratic residues modulo n. Qn is the set of all pseudosquares modulo n

(iv) Make the Key (n,y) public, but keep the Key (p,q) secret.

Step II Encryption:

(i) Obtain shyams Public key (n,y)

(ii) Represent the message m as a binary string m = m1 m2 m3 mk of length k.

(iii) For i = 1 to k do

Choose at random an x (Z/nZ)* call it xi. Compute ci from

157

IJRITCC | October 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 4 Issue: 10 157 - 160

______________________________________________________________________________________

(iv) Send the k-typle c = (c1,c2,ck) to shyam. Each ci is an integer such that 1 ci < n. Note also that since n is a 2 bit

integer it is clear that the cipher text c is a much longer string than the original plain text m.

To Decrypt Rams message (i.e the cipher text c constructed above), shyam should do the following

(i) For i = 1 to k do

Evaluate the Legendre symbols

This completes the algorithm.

2. RESULTS CONCERNING LEGENDRE SYMBOL

We shall consider the following important results for the Decryption step.

Let p,q be primes

158

IJRITCC | October 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 4 Issue: 10 157 - 160

______________________________________________________________________________________

3. ILLUSTRATION:

Let us consider the Algorithm for the message SPY. The binary equivalent for the letters S,P,Y are 10010, 01111,

11000 respectively. So the message space m is given by m = 10010 01111 11000

Let n = 21 = 3 * 7 so that p = 3, q = 7

m2 = 0 choose x2 = 5

159

IJRITCC | October 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 4 Issue: 10 157 - 160

______________________________________________________________________________________

4. FEATURES OF THE CRYPTOSYSTEM:

(i) The encryption process in this system is random in the sense that the same bit is transformed into different strings

depending on the choice of the random number x. For this reason, it is also called Probabilistic encryption [4].

(ii) Each bit is encrypted as an integer modulo n, and hence each bit is transformed in to a 2 bit string.

(iii) The Algorithm proposed in this system takes o(2) time to encrypt each bit and o (3) time [5] to decrypt each bit.

(iv) Solving Quadratic Residuosity Problem is equivalent to computing the prime factorization of n and so it is

computationally infeasible.

(v) This system is more secure than the most famous RSA Cryptosystem [6] which is not secure for all probability

distributions of the message space, in the sense that under fixed Public-key, a particular plain text m is always

encrypted to the same cipher text c, where as in this system the plaintext m is converted into different forms of

ciphertext c, because of the randomness in the encryption process.

References / Notes:

[1] Neal koblitz, A course in Number Theory and cryptography, 43, 2004.

[2] C.F. Gauss Proved the stated result called Law of Quadratic Reciprocity, Disquistiones Arithmeticae, Yale university

press, 1966

[3] Euler Proved an important result regarding QRP which is both necessary and sufficient.

[4] S. Goldwasser and S. Micali, Probabilistic Encryption, Journal of computer and system sciences, 28, 1984.

[5] Neal Koblitz, A course in Number Theory and cryptography, 79, 2004.

[6] Three MIT researchers, Ronald L. Rivest, Adishamir, Leonard Adleman proposed the first practical Public-key

cryptosystem, now widely known as the RSA Public-key cryptosystem. There are two important References.

[7] R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining Digital signatures and Public - key cryptosystems,

communications of the ACM, 21, 2, (1978), 120126

[8] R.L. Rivest, Remarks on a proposed cryptanalytic attack on the M.I.T. Public-key cryptosystem,cryptologia, 2, 1

(1978), 6265

160

IJRITCC | October 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

- Digital SignatureUploaded bySandeep Vishwakarma
- IJETTCS-2015-01-01-12Uploaded byAnonymous vQrJlEN
- IJETTCS-2016-03-24-29Uploaded byAnonymous vQrJlEN
- METHODS TOWARD ENHANCING RSA ALGORITHM : A SURVEYUploaded byAIRCC - IJNSA
- Enhancement of Security in DNA Based CryptographyeeUploaded byIOSRjournal
- Investigation Report 2013Uploaded byNelson Perez
- _5Uploaded byMade Fitri Damayanti
- RSA Algorithm and ClassParticipationUploaded byaarthisub
- it act 2000Uploaded byRajiv Kumar
- An Efficient Solution for Privacypreserving, Secure Remote Access to Sensitive DataUploaded byCS & IT
- A Location Based encryption technique and some of its applicationsUploaded byHardik
- LUCUploaded bysappii10
- Key Recovery for Certification AuthoritiesUploaded byJournal of Mobile, Embedded and Distributed Systems (JMEDS)
- 100418Uploaded byvol2no4
- SMU MCA AssignmentsUploaded byNarendra Dev
- Chapter 3Uploaded byDr. Pradeep Singh Shaktawat
- Digital Signatures and CertificatesUploaded byBridget Smith
- PublicKeyUploaded bysnigdhadontharaju
- IntroductionUploaded byKhairi Azmi
- auditing operating systems and networksUploaded byPatOcampo
- Assignment 2Uploaded byPrincess Tanu
- London Python Developer_AWS Devop EngineerUploaded byms6675223
- RsaUploaded byAnshu Mittal
- _5039fd753bf80892ed407d5650d99930_rsaUploaded bySoumy Ladha
- 4_Abikoye et al. 50 - 60.pdfUploaded byHermann Schmidt
- Final - RP_kunalUploaded byKunal Gupta
- Multi-Biometric Authentication through Hybrid Cryptographic SystemUploaded byIntegrated Intelligent Research
- on-digital-cash-like-payment-systems.pdfUploaded bySachin
- 4901 paper 2Uploaded bySyed Zakir Hussaini
- doubble encriptionUploaded bydeepak kumar

- a clustering and associativity analysis based probabilistic method for web page predictionUploaded byrahul sharma
- Regression Based Comparative Study for Continuous BP Measurement Using Pulse Transit TimeUploaded byEditor IJRITCC
- A Review of Wearable Antenna for Body Area Network ApplicationUploaded byEditor IJRITCC
- Channel Estimation Techniques over MIMO-OFDM SystemUploaded byEditor IJRITCC
- Safeguarding Data Privacy by Placing Multi-level Access RestrictionsUploaded byEditor IJRITCC
- space complexity analysis of rsa and ecc based security algorithms in cloud dataUploaded byrahul sharma
- A Review of 2D &3D Image Steganography TechniquesUploaded byEditor IJRITCC
- IJRITCC Call for Papers (October 2016 Issue) Citation in Google Scholar Impact Factor 5.837 DOI (CrossRef USA) for each paper, IC Value 5.075Uploaded byEditor IJRITCC
- Performance Analysis of Image Restoration Techniques at Different NoisesUploaded byEditor IJRITCC
- Comparative Analysis of Hybrid Algorithms in Information HidingUploaded byEditor IJRITCC
- Importance of Similarity Measures in Effective Web Information RetrievalUploaded byEditor IJRITCC
- 7 1534938100_22-08-2018Uploaded byEditor IJRITCC
- Fuzzy Logic A Soft Computing Approach For E-Learning: A Qualitative ReviewUploaded byEditor IJRITCC
- Modeling Heterogeneous Vehicle Routing Problem with Strict Time ScheduleUploaded byEditor IJRITCC
- Network Approach based Hindi Numeral RecognitionUploaded byEditor IJRITCC
- Efficient Techniques for Image CompressionUploaded byEditor IJRITCC
- A Study of Focused Web Crawling TechniquesUploaded byEditor IJRITCC
- Prediction of Crop Yield Using LS-SVMUploaded byEditor IJRITCC
- Predictive Analysis for Diabetes using TableauUploaded byEditor IJRITCC
- Simulation of Vector Controlled Adjustable Speed System of Doubly Fed Induction MachineUploaded byEditor IJRITCC
- iTimer - Count On Your TimeUploaded byEditor IJRITCC
- Hybrid Algorithm for Enhanced Watermark Security with Robust DetectionUploaded byEditor IJRITCC
- 48 1530871571_06-07-2018.pdfUploaded byrahul sharma
- IoT and Fingerprint Based Door Looking SystemUploaded byEditor IJRITCC
- Kinematic Hardening Parameters Identification with Finite Element Simulation of Low Cycle Fatigue using Genetic Algorithm ApproachUploaded byEditor IJRITCC
- image restoration techniques using fusion to remove motion blurUploaded byrahul sharma
- a content based region separation and analysis approach for sar image classificationUploaded byrahul sharma

- 156-310-sUploaded byashwinshettym
- GP Card Specification 2.1.1Uploaded byCharlieBrown
- hw1Uploaded byrnapando
- DSS and MISUploaded byRavi Teja Tallam
- CCNAS Chp9 PTActA Secure-Network InstructorUploaded byXuân Diệu
- As 2805.11-2000 Electronic Funds Transfer - Requirements for Interfaces Card Parameter TableUploaded bySAI Global - APAC
- ARABIC Cryptography Technique Using Neural Network and Genetic AlgorithmUploaded byIRJCS-INTERNATIONAL RESEARCH JOURNAL OF COMPUTER SCIENCE
- eccUploaded byroyalties12632
- 140sp2208Uploaded byEduardo Aranguiz
- EMV_v4.3_Book_4_Other_Interfaces_20120607062305603-1.pdfUploaded byassert fail
- Wired Equivalent Privacy (WEP)Uploaded byNguyễn Thanh Tuấn
- HYBRID APPROACH FOR SECURE DATA COMMUNICATION FOR DECENTALIZED DISRUPTION-TOLERANT MILITARY NETWORKSUploaded byInternational Journal for Scientific Research and Development - IJSRD
- Sigsafe: An electronic key tag for signing bitcoin transactionsUploaded byPeter__R
- CA AuditChecklistUploaded bybigumangaba
- Newpresentation(DES)Uploaded byshubham shukla
- Best Practices for the Encrypting File SystemUploaded byabdulyunus_amir
- E Banking RossUploaded byOmar Al-Otaibi
- RSA.pdfUploaded byRoseri Sinaga
- bit cn manual 7th cseUploaded byvpradeepbm
- DES AlgorithmUploaded byImran
- Digital Signatures 20130304Uploaded byDiana Carolina
- Book ReviewUploaded byRowen Sewmungal
- Ch02 Classical EncryptionUploaded bySamer Halawani
- Batch RSA Amos FiatUploaded byShehanWickramarathne
- CBK v1.0Uploaded bySonam Pandita
- A Protected Single Sign on Technique Using 2D Password in DistributedUploaded byEditor IJRITCC
- CISA_Participants2016_Ch_5.pptxUploaded byObumpa Teye
- Zip AttacksUploaded byshahrukh_viper
- E-commerce Notes at HomeUploaded byLaxmiPant
- TeamViewer Security Statement EnUploaded bydudo

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.