International Journal of Pure and Applied Mathematics

Volume 115 No. 7 2017, 423-427

ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version)
url: http://www.ijpam.eu
Special Issue
ijpam.eu

IMPLEMENTATION OF QUARTER CYCLE KEY CRYPTOGRAPHIC ALGORITHM

USING VERILOG HDL

Deekshatha A1, Fazal Noorbasha2, Harikishore Kakarla3, P.G.Mounika4, N.GangaDheeraj5,

6
M. Manasa
1,2,3,4,5,6
Department of Electronics and Communication Engineering,
K L University, Vaddeswaram, Guntur, A.P. India 522502
2
fazalnoorbasha@kluniversity.in, 6manasamuliki@kluniversity.in

Abstract:The increasing concerns regarding the
security purposes led to the use of encryption during
the transmission of information. Encryption is the
process of converting information or data into a code,
especially to prevent authorized access. In this paper
we developed a three level data encryption process. A
cryptography algorithm has implemented using the
Verilog HDL language. This code employed shall
encrypt the message data at three different levels on the
transmitter and receiver side to increase security. In this
paper we go for the three level encryption processes
where the encryption is made first by XORing data
with the key phases and then second hamming code and
finally bits shuffling for additional security. We have
used 8-bit data as input and got 13-bit encrypted data.
As we go for the higher level encryption we get the
higher level security for the information.
Key Words: - Encryption, XOR, Hamming code,
Shuffling, Verilog, FPGA.
1. Introduction
In this modern world where the technology is very
advanced and where its importance is enhanced and so
the protection of the information is very essential [1-3].
The application of the technology selection and the
related safeguard procedures are important
responsibilities of every prominent organisation in
providing the sufficient security to its electronic data
systems [4-6]. Thus we go for cryptography which is
the manipulation of the actual message where the actual
message is sent with protection where the confidential
data is secured so that the actual content is deciphered
by the right agencies. There are many methods for this
information transmission like bfsk, bpsk and qask but
we use the principle of qpsk as it has got low bit
accuracy error rate and it also has the higher bandwidth
efficiency [7-9].
This proposed work specifies the quarter cycle
cryptographic algorithm methods. Protection of the
information during the transmission is very essential
and also the integrity and the security of the data must
be enhanced while storing the data during the process.
This algorithm explicitly defines the steps to transform
the data into cryptographic cipher and then there by
increasing more security by further processing it so that
the information is more secured and hidden for the
outer sources. Thus the data encryption standards are
made by the agencies within contexts of a total security
programs like security procedures, confidential
information, computer systems and network access
controls [10-11].
2. Encryption Methodology and Implementation
Figure 1. Flow chart of data encryption
In this paper, we have three levels. During our first
level, we take an 8-bit input data (as the binary data is
to be expressed as 2-Radix). Then we use QPSK
principle. In QPSK, the modulator shifts carrier to one
of four possible phases corresponding to the four
possible values of the input symbol. We are
implementing the quarter cycle implementation where
the whole cycle of the signal is divided into four parts
with phases 45, 90,180 and 360 degrees.As QPSK
gives higher bandwidth, we have incorporated its
principle in our encryption process. Now we convert
the phases 45, 90,180 and 360 degrees into their binary
values as to be compatible with the input 8-bit binary
data. Figure 1 shows the flow chart of data encryption
process. The respective binary values are represented in
table1.
Table 1. binary value of phases and their respective
selections

423
 International Journal of Pure and Applied Mathematics Special Issue

Let us see the whole process by taking an example of

8-bit input data 01011001.
The number of bits in the binary value of 360 is Table 6.XORed and Roundup the MSB bits with even
nine. In order to have common number of bits we add parity (Level 1)
zeroes for 180, 90 and 45 at their MSB values. So we
will have nine bit representation for all our four phases.
We also add an even parity bit at the MSB of our eight
bit input data. Therefore now we have a nine bit input
data which will be XORed with the 9 bit binary value
of the respective phases based on the selection lines
show in table 1.
In our second level, the output of the first level is Table 7. Hamming code encrypted data of table 5
taken as the nine bit input data to perform hamming (Level 2)
code. Hamming code is an improvement over parity
check method. Here a code is implemented in Verilog
in which 9 bit of information data is transmitted with
four redundancy bits [12].
Table 2. Hamming code bit placement

Table 8. Shuffling bits of tabe 6 (Level 3)

d1 to d9 bits are input bits and p1 to p4 bits are parity
bits. Table 3 is showing the parity bit calculation
process from the table 2.
Table 3.Parity bit calculation

Using input data we can calculate the parity value
using the table 3. Finally we are getting a 13-bit
hamming code data. Therefore the output of our second
level is the thirteen bit data. Further in our third level
we divide the output of the second level data into five
blocks where first four blocks consists of 3 bits each
and the fifth block contains one bit as shown in the
Table 4.
Table 4. Representation of block division of 13-bit data
3. Synthesis and Simulation Results
Table 9 give the number of gates that have been used
and the operations and the cycles also the error reports
and also the utilisation and also the number of LUTs.
So this report helps us to get the entire details of the
devices used and their number. So we get the number
of devices or gates or LUTs placed in each level for
the performance of the project.
Table 9.Logic utilization table of different phases

Now as our third level encryption we shuffle the

information data with respect to the selection lines.The
choice of shuffling is shown in table 5.
Table 5. selection for the shuffling blocks

424
 International Journal of Pure and Applied Mathematics
Figure 2 Simulation waveforms of Encryption process
Thus from step1 output we understand the data bits
d[7:0] which are 8 bit binary numbers are EXOR ed
with the phases which are converted into binary bits
dk[8:0] using selection lines s[1:0] where we get an
exored output of y[8:0] as output.
Figure 3. Simulation waveforms of Hamming code
process
In step 2 we get the output c[13:1] of 13 binary bits by
applying hamming code to the input which is the output
of the step 1 and then they are converted into 13 bit
output by adding parity bits to the input d[9:1] by using
selection lines s[1:0].
Figure 4 Simulation waveforms of Shuffling data bits
In step 3 we get the output y[13:1] of the three level
encrypted data by taking the output obtained by step 2 as
input d[13:1] thus by further dividing it into five blocks
which are shuffled as required and thus the three level
encrypted data of the input data is obtained.
4. Conclusion
We developed a simple and a new encryption process
using XOR, Hamming code and shuffling process. In
this process an 8-bit data is converting into a 13-bit
encrypted data. Here we have used three level of
encryption process. Hamming code is used for error
detection and correction purpose. Xilinx simulation tool
used to perform the code operations and so the number
of gates and LUTs used can be verified and this
security pattern can be used to help for the lengthier
blocks of bits. Thus quarter cycle makes it very
difficult for the intruders to get on the information from
the transmitters and while holding the information and
helps the receivers to decode it very easily and with
more security. This work can further be extended to the
decryption of the more protected and more hidden and
well protected data where we concentrated only on the
encryption part which is an advanced one for the
security to hold and to send confidential details. Thus
this could further be extended to decrypting the data
which we hope can be extended to the future.
References
[1] Vishakha Pareek, A novel implementation of
QPSK modulator on FPGA, IEEE Students'
Special Issue
Conference on Electrical, Electronics and
Computer Science, 2016, PP. 1-4.
[2] Indra Raj Sharma, Vipin Gupta Comparative
Analysis of DES and S-DES, Encryption Algorithm
Using Verilog Coding, International Journal of
Innovative Research in Electrical, Electronics,
Instrumentation and Control Engineering, Vol. 1,
Issue 9, December 2013, PP. 469-473.
[3] T. Narendra Babu, Fazal Noorbasha, M. Harita, N.
Tejashree and K. Vamsi Krishna, FPGA
Implementation of High Speed Error Detection
and Correction of Orthogonal Codes using
Segmentation Method, Indian Journal of Science
and Technology, Vol 9(30), August 2016, PP. 1-7.
[4] P. M. Durai Raj Vincent, Syed Amber Iqbal, Karan
Bhagat and Kamal Kant Kushwaha,
Cryptography: a Mathematical Approach, Indian
Journal of Science and Technology, Vol 6(12),
December 2013, PP 56075611.
[5] Narendra Babu T., Fazal Noorbasha, Sai Krishna
Ch., Sai Charan K. and R. S. V. S. Sai Kalyan,
FPGA implementation of cryptographic system
using BODMAS sequence of operations, ARPN
Journal of Engineering and Applied Sciences, Vol.
11, No. 19, October 2016, PP. 11475- 11479.
[6] Tulasimani Lakshmanan, Madheswaran
Muthusamy, A Novel Secure Hash Algorithm for
Public Key Digital Signature Schemes, The
International Arab Journal of Information
Technology, Vol. 9, No. 3, May 2012.
[7] Upputuri Neelima, Fazal Noorbasha, Data
Encryption and Decryption using Reed-Muller
Techniques, International Journal of Engineering
and Technology (IJET), Vol 8, No 1, Feb-Mar
2016, PP 83-91.
[8] Xiao-Bie Liu, Soo Ngee Koh, Chee-Cheon Chui
and Xin-Wen Wu, A study on reconstruction of
linear scrambler using dual words of channel
encoder, IEEE Transactions on Information
Forensics and Security, Vol. 8, No. 3, March 2013,
PP. 542-552.
[9]Cncio Monteiro, Yasuhiro Takahashi, Toshikazu
Sekine, Low-power secure S-box circuit using
charge-sharing symmetric adiabatic logic for
advanced encryption standard hardware design,
IET Circuits, Devices & Systems, Vol.9, Iss.5,
2015, PP.362369.
[10]A.Jeniffer, S.Haripasath, S.Chinthamani, G.Chitra,
V.Karthiga, An Effective FPGA Implementation
425
 International Journal of Pure and Applied Mathematics Special Issue

of Denoising of Impulse Noise in Images

International Innovative Research Journal of
Engineering and Technology, ISSN NO:2456-
1983, Vol.2, no.1, pp.41-48, sep 2016.

[11] Fazal Noorbasha, K. Sundar Teja, Bhavana

Endreddy, Nikitha Adidela and Ch. Naga Pavan
Kumar, Implementation of Cryptography
Algorithm with Adders and Subtractor, Indian
Journal of Science and Technology, Vol 10(4),
January 2017, PP. 1-9.

[12] A. Grediaga, F. Brotons, B. Ledesma and F. G.

Cresp, Analysis and Implementation
Hardware-Software of Rijndael Encryption, IEEE
Latin America Transactions, Vol. 8, No. 1, March
2010, PP. 82-87.

[13] Fazal Noorbasha, M. Manasa, R. Tulasi Gouthami,

S. Sruthi, D. Hari Priya, N. Prashanth, And Md. Zia Ur
Rahman, FPGA Implementation Of Cryptographic
Systems For Symmetric Encryption, Journal of
Theoretical and Applied Information Technology, 15th
May 2017. Vol.95. No 9, PP. 2038-2045.

[14] T. Padmapriya and V.Saminadan, Handoff

Decision for Multi-user Multiclass Traffic in MIMO-
LTE-A Networks, 2nd International Conference on
Intelligent Computing, Communication & Convergence
(ICCC-2016) Elsevier - PROCEDIA OF
COMPUTER SCIENCE, vol. 92, pp: 410-417, August
2016.

426
427
428