Professional Documents
Culture Documents
Download textbook Futuristic Trends In Network And Communication Technologies First International Conference Ftnct 2018 Solan India February 9 10 2018 Revised Selected Papers Pradeep Kumar Singh ebook all chapter pdf
Download textbook Futuristic Trends In Network And Communication Technologies First International Conference Ftnct 2018 Solan India February 9 10 2018 Revised Selected Papers Pradeep Kumar Singh ebook all chapter pdf
123
Communications
in Computer and Information Science 958
Commenced Publication in 2007
Founding and Former Series Editors:
Phoebe Chen, Alfredo Cuzzocrea, Xiaoyong Du, Orhun Kara, Ting Liu,
Dominik Ślęzak, and Xiaokang Yang
Editorial Board
Simone Diniz Junqueira Barbosa
Pontifical Catholic University of Rio de Janeiro (PUC-Rio),
Rio de Janeiro, Brazil
Joaquim Filipe
Polytechnic Institute of Setúbal, Setúbal, Portugal
Ashish Ghosh
Indian Statistical Institute, Kolkata, India
Igor Kotenko
St. Petersburg Institute for Informatics and Automation of the Russian
Academy of Sciences, St. Petersburg, Russia
Krishna M. Sivalingam
Indian Institute of Technology Madras, Chennai, India
Takashi Washio
Osaka University, Osaka, Japan
Junsong Yuan
University at Buffalo, The State University of New York, Buffalo, USA
Lizhu Zhou
Tsinghua University, Beijing, China
More information about this series at http://www.springer.com/series/7899
Pradeep Kumar Singh Marcin Paprzycki
•
123
Editors
Pradeep Kumar Singh Jitender Kumar Chhabra
Jaypee University of Information National Institute of Technology
Technology Kurukshetra
Solan, India Kurukshetra, India
Marcin Paprzycki Narottam Chand Kaushal
Systems Research Institute National Institute of Technology Hamirpur
Polish Academy of Sciences Hamirpur, India
Warsaw, Poland
Yugal Kumar
Bharat Bhargava Jaypee University of Information
Department of Computer Sciences Technology
Purdue University Solan, India
West Lafayette, IN, USA
This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
Preface
TPC Chairs
Bharat Bhargava Purdue University, USA
Wei-Chiang Hong Jiangsu Normal University, China
Jitender Kumar Chhabra NIT Kurukshetra, India
Pao-Ann Hsiung National Chung Cheng University, Taiwan
Abhijit Sen Kwantlen Polytechnic University, Canada
TPC Committee
A. K. Saini University School of Management Studies,
Guru Gobind Singh Indraprastha University,
New Delhi, India
A. K. Verma Centre for Reliability Engineering, IIT Mumbai,
Mumbai, India
A. Q. Ansari Jamia Millia Islamia, New Delhi, India
Abdelmajid Khelil Technische Universität Darmstadt, Germany
Ahmed Kadhim Hussein Babylon University, HIILA, Iraq
Ajith Abraham Machine Intelligence Research Labs (MIR Labs), USA
Ajmer Saini DCRUST, Sonipat, India
Alak Majumdar National Institute of Technology,
NIT-Arunchal Pradesh, India
Alessandro Brawerman Positivo University, Brazil
Alex Kwang Leng Goh Curtin University, Australia
Alexey Vinel Saint-Petersburg Institute for Informatics
and Automation, Russia
Alok Singh University of Hyderabad, India
Amay Kumar Rath DRIEMS, Cuttack, India
Amit Prakash Singh GGSIPU, Delhi, India
Amit Prakash Singh IP University, Delhi, India
Ammar Almomani Al- Balqa Applied University, Jordan
Amrit Kumar Agrawal Apollo Institute of Technology, Kanpur, India
Anand Kumar M.S. Engineering College, Bangalore, India
Andera Stern University of Sydney, Australia
Andy Adamatzky University of the West of England, UK
Anil Panghal HCTM Technical Campus, Kaithal, India
VIII Organization
Organizing Committee
Chief Patrons
Shri Jaiprakash Gaur Ji Jaypee Group, India
Shri Manoj Gaur Ji Jaypee Group JUIT, India
Patron
Vinod Kumar Jaypee University of Information Technology, India
Co-patron
Samir Dev Gupta Jaypee University of Information Technology, India
Advisory Committee
Abhijit Sen Computer Science and Information Technology,
Kwantlen Polytechnic University, Canada
Ioan-Cosmin Mihai Alexandru Ioan Cuza Police Academy, Romania
Pljonkin Anton Institute of Computer Technologies and Information
Security, Southern Federal University, Russia
Marcin Paprzycki Systems Research Institute, Polish Academy
of Sciences, Warsaw, Poland
Sanjay Sood C-DAC Mohali, India
Arti Noor C-DAC Noida, India
Honorary Chairs
Pao-Ann Hsiung National Chung Cheng University, Taiwan
Wei-Chiang Hong School of Education Intelligent Technology,
Jiangsu Normal University, China
Program Chairs
Jitender Kumar Chhabra Department of Computer Engineering, NIT
Kurukshetra, India
Narottam Chand Kaushal NIT Hamirpur, India
Organization XV
Finance Chair
Maj Gen Rakesh Bassi Jaypee University of Information Technology, India
(Retd.)
Organizing Secretariat
Yugal Kumar Jaypee University of Information Technology, India
Amit Kumar Jaypee University of Information Technology, India
Academic Partner
Sponsors
Communication Technologies
S-BOX Architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
Abhishek Kumar and Sokat Tejani
Network Technologies
Wireless Networks
1 Introduction
Thus, researchers are devoted to develop new techniques to cope up with these attacks.
New techniques are being devised which are highly secured, reliable and computa-
tionally efficient. Existing communication techniques are being updated to minimise
their vulnerability to attacks [1].
In 1997, US National Institute of Standards and Technology (NIST) called for pro-
posals for Advanced Encryption Standard [2]. Fifteen proposals were submitted, out of
which five were finalised for further analysis in 1999. In 2000, Rijndael algorithm was
selected by NIST as AES. On 26 November 2001, AES was adopted as a formal US
standard. It was published as Federal Information Processing Standard 197 (FIPS 197)
in the Federal Register in 2001 [3]. AES is derived from Rijndael Algorithm, which
was designed by two cryptographers - Jon Daemen and Vincent Rijmen. Rijndael has
many sub-parts with different data block length and key lengths [4].
128
Key
2.2 Byte
The main entity of data which is manipulated in AES is a byte, i.e. a group of 8 bits is
considered as a basic single unit. Plaintext, Cipher key and Ciphertext are dealt with as
collection of bytes [5].
Block length = 128 bits (128/8 = 16 bytes) Key Length = 128 bits (128/8 = 16 bytes)
Key Length = 192 bits (192/8 = 24 bytes)
Key Length = 256 bits (256/8 = 32 bytes)
Implementation of AES-128 Using Multiple Cipher Keys 5
Here, the discussion is limited to AES-128 only as the proposed technique attempts
at modifying it by increasing the no. of keys.
B0 B4 B8 B12
B1 B5 B9 B13
B2 B6 B10 B14
B3 B7 B11 B15
Constituent bytes in each column of the array form 32 bit words. Therefore, state is
signified as 1 4 matrix of four 32-bit words [5].
ShiftRows Sublayer
Round
Diffusion Layer
1
MixColumn Sublayer
ShiftRows Sublayer
Round
9
MixColumn Sublayer
Ciphertext
Byte Substitution Layer. The initial layer of every round is byte substitution layer.
This is a byte substitution that operates in a non-linear fashion independently on every
element of the State matrix using a Substitution-box. Each element from the state
matrix is substituted by a byte from the substitution-box [2].
ShiftRows Sublayer. This operation performs shifting on the second row in state
matrix cyclically by one position in left, the third row by two positions in the left and
the fourth row by three positions to the left. No change is done to the first row. The
main motive behind the operation of ShiftRows is to diffuse each element over the
Implementation of AES-128 Using Multiple Cipher Keys 7
whole matrix [2]. Let us assume that the input for this operation is state matrix E = (E0,
E1,…, E15):
E0 E4 E8 E12
E1 E5 E9 E13
E2 E6 E10 E14
E3 E7 E11 E15
2 3 2 32 3
C0 02 03 01 01 B0
6 C1 7 6 01 02 03 01 76 B5 7
6 7 6 76 7
4 C2 5 ¼ 4 01 01 02 03 54 B10 5
C3 03 01 01 02 B15
The next four bytes for the next column can be calculated by multiplication of the
input bytes (B4, B9, B14, B3) by the same matrix given above.
Key Addition Layer. This layer in AES has two inputs – the state matrix which has
16 elements or 16 bytes, and the cipher key which also has byte length of 16 bytes. The
inputs are added, which is equal to a logical XOR in Galois field having two elements.
The subkeys for subsequent rounds are extracted by iterating the same operations in
key schedule.
Key Schedule. Key Schedule extracts the subkeys from cipher key, which are subse-
quently used in further rounds of AES. The no. of subkeys required is equal to one
more than the total no. of rounds. Therefore, in case of AES-128, the required no. of are
11 since there are total 10 rounds, as discussed previously. The subkeys are derived
8 S. Sachdeva and A. Kakkar
recursively in AES i.e. in order to extract 2nd key, 1st key must be known and for 3rd
subkey, 2nd subkey must be known and so on [2].
3 Literature Review
Tankard [6] discussed that in a big data set, it is impossible to find every piece of
confidential information and tracking the users which have the access to sensitive data.
Confidential data is to be encrypted which can include information in data bases, spread
sheets, word documents and archives etc. Garfinkel [7] referenced the problem of
securing financial transactions and other critical applications through the use of cryp-
tography. Tomhave [8] introduced the main facets in key management. For coping up
with key loss, it seemed befitting to establish an extra key that could be used in
retrieving data for an emergent scenario. Parker [9] stressed upon the judicious usage of
cryptography in various applications. The dangers and vulnerabilities posed to the
system by cryptography were highlighted. Transmission errors, lost keys etc. can lead
to critical information loss and harm an organisation greatly. Yang et al. [10] described
the general theoretical ideas, algorithms, and standards for encryption of data, images
and MPEG video. Comparisons were drawn between the various cryptographic algo-
rithms based on various parameters like complexity, speed, memory requirement, key
length etc. Patil et al. [11] discussed the basic standards for symmetric and asymmetric
cryptography like DES, 3DES, AES, RSA and Blowfish. Nadeem et al. [12] high-
lighted the performance degradation of encryption algorithms when implemented in
hardware across various applications. DES, TDES, AES and Blowfish were the
algorithms which were used to encrypt same data files across various hardware plat-
forms and performance was compared. Buchanan et al. [13] researched about the
varying servers used across various industry sectors in today’s scenario. In TLS Pro-
tocol, ECDHE-RSA-AES256-GCM-SHA384 is described to be the most popular
cipher suite, which uses AES-256 for data encryption along with other schemes for key
sharing and authentication. Rachh et al. [14] described the efficient implementation of
Implementation of AES-128 Using Multiple Cipher Keys 9
AES encryption and decryption in FPGA and ASIC using fully pipelined structures.
Integrated circuits were designed by implementing block architectures of different
layers in AES which minimized the delay in implementation. Osvik et al. [15]
implemented AES-128 encryption technique in software targeting both low speed
microcontrollers and microprocessors, and the high-speed Cell broadband engine and
NVIDIA graphics processing units (GPUs). Jingmei et al. [16] discussed that the
simple S-box of AES with only 9 terms can pose a vulnerability. A new S-box with 255
terms was presented which increase the security against attacks like linear and differ-
ential cryptanalysis. Gong et al. [17] discussed the AES Encryption Algorithm based
on multiple look up tables. The main advantage was to reduce the encryption time. The
mathematical preliminaries for generating the look-up tables were discussed. Dara et al.
[18] discussed that the S-box used in standard AES algorithm is static. Generating the
S-Box dynamically presents an important advantage of increasing the security of AES
cipher system. Kumar et al. [19] suggested modification in AES by using a key of 320
bits from Polybius square and increasing the no. of rounds to 16 from 10, for
encryption and decryption of data. Wahaballa et al. [20] discussed providing multiple
layers of security to data communication by employing encryption and steganography,
which is the technique to hide confidential data in a cover file so that data commu-
nication becomes undetectable to an intruder.
4 Proposed Methodology
From literature review, it was observed that the research done in field of AES was to
improve performance and enhance the security by modifying the parameters and basic
algorithm for AES. The changes were done either in by increasing the length of keys or
improving S-Box implementation etc.
The proposed technique does not change the basic nature of AES-128 algorithm.
The basic parameters are kept same as listed below.
• Data Block (Plaintext) Length: 128 bits (16 bytes)
• Cipher Key Length: 128 bits (16 bytes)
• Number of Rounds: 10
• State matrix: 4 4
• S-Box: Same as prescribed in the standard FIPS-197
In the proposed technique, an attempt is made to increase the security of the
algorithm threefold by increasing the number of keys, which are used in encryption of
the data or plaintext. A basic approach for a GUI is programmed in which user is
prompted to enter the data or plaintext and three keys which are to be used for the
purpose of encryption. The same keys shall be used for decrypting the ciphertext
otherwise the result will not be the true plaintext. The increase in number of keys
increases the effective key space. This drastically increases the number of permutations
and combinations which will be required by the intruder to breach the security.
Therefore, this approach enhances the security of algorithm in terms of encryption time
as compared to security model proposed by Kakkar et al. [21].
10 S. Sachdeva and A. Kakkar
Start
1
Input the Plaintext Input three keys
From the user From the user
1
Implement MixColumn
No
1 Round = 9
?
Yes
Set Plaintext = Ciphertext
Implement Byte Substitution
End
Olin tuskin saanut oven jälkeeni kiinni, kun näin hienon naisen
lakeijan saattamana nousevan portaita ylös. »Herra Jumala, tuo on
tietysti rouva Abaza», ajattelin minä. Sydäntäni alkoi jyskyttää
ajatellessani kuvaelmaa, joka syntyisi, kun Idan ylhäinen suosija
astuisi huoneeseemme.
*****
»Jos niin on, niin hän pahasti erehtyy. Meillä on kyllä suvussamme
rikkaita, mutta meillä itsellämme ei ole omaisuuksia.»
*****
Heidän ainoa poikansa Alexander oli syntynyt 1864. Hän oli siis
vereltään puoleksi juutalainen, mutta ei yleensä tahtonut sietää siitä
puhuttavan, vaan väitti tuntevansa itsensä koko sielunelämältään
puhtaaksi germaaniksi. Hän oli saanut hienon kasvatuksen.
Saksassa, germaanien päämaassa, sanotaan jokaisen lahjakkaan
nuorukaisen tuntevan kutsumuksekseen joko tulla runoilijaksi tai
filosofiksi. Alexander Uexküll-Gyllenband lienee nuoruutensa päivinä
tuntenut kutsumusta kumpaankin: »Arthur ja Irene»-tarina viittaa
runouteen, mutta hänen häämatkallaan 1894 pitämänsä päiväkirja
todistaa, että hän siihen aikaan tunsi lähimmäksi
elämäntehtäväkseen filosofian, eli tarkemmin sanottuna: eetillisen
filosofian harrastamisen.
*****
»Matka 1894» on kirjoitettu nimilehdelle suurehkoon sinikantiseen
vihkoon, johon noin kolmenkymmenen vuoden ikäinen vapaaherra
Alexander Uexküll-Gyllenband on merkinnyt ajatelmiaan ja
kokemuksiaan häämatkaltaan, jolle lähti Ida Aalbergin kanssa vasten
vanhempiensa tahtoa. Muistiinpanot ovat osaksi salamerkeillä
kirjoitettuja, salamerkeillä, joiden avain kuitenkin on vihon kannessa,
mutta muutenkin on hänen käsialansa niin vaikeasti luettavaa, että
hetkellinen uteliaisuus löytää kovin vähän tyydytystä sivujen
selailemisesta. Niin tilapäisiä kuin nuo muistiinpanot ovatkin, ne
kuitenkin puhuvat mitä rehellisintä kieltä tuon matkan vaiheista.
Se on naistaktiikkaa.
Heikkoa, valheellista ja sairaalloista naistaktiikkaa.
Jos sen tiedät ja jos siihen uskot: miten pientä onkaan silloin
semmoista taustaa vastaan olla herkkätunteinen!
Sinä tiedät, etten tule ennen lepäämään, enkä saakaan sitä tehdä,
ennenkuin ne ovat jäljettömiin kadonneet.
*****
Pelkää sitä.
Ole vapaa.» ‒ ‒
»Joko:
tai:
»Rakkaani.
Tahdotko odottaa?
Vaimoni!