Please use this identifier to cite or link to this item:
Title: A study of some block ciphers for secure transmission of information
Researcher: Ravi Shankar, N
Guide(s): Durga Bhavani, S
Sastry, V U K
Keywords: Cryptography
Modular Arithmetic Inverse
Hill Cipher
Upload Date: 3-Sep-2012
University: Jawaharlal Nehru Technological University
Completed Date: September, 2011
Abstract: In this thesis, we have investigated several problems in the area of cryptography. In these problems, we have developed several block ciphers, wherein, iteration plays a fundamental role. The first chapter is introductory in nature. It deals with the basic concepts and a survey of the relevant literature in the area of cryptography. In the second chapter, we have developed a block cipher by taking a large key matrix (of size 384 binary bits) and a plaintext matrix containing two columns (112 bits). In this, the plaintext column vectors, operated by the key matrix are thoroughly interlaced at each stage of the iteration. The cryptanalysis carried out in this chapter clearly indicates that the cipher is difficult to break by any conventional cryptanalytic attack. In chapter 3, we have developed a large block cipher by modifying the Hill cipher. This is an extension of the analysis carried out in chapter 2, to a plaintext block of unlimited size. Chapter 4 is devoted to the study of a block cipher basing upon the modification of the Hill cipher. In this, we have considered the effect of key dependent permutation together with interlacing. The analysis clearly reveals the strength of the cipher. In chapter 5, we have dealt with another block cipher, wherein the size of the key matrix is 384 bits and the size of the plaintext is as large as we please. Here also, we have studied the effects of the key dependent permutation, interlacing and the iteration. Here, we have noticed that all these agents are strengthening the cipher in a remarkable manner. Chapter 6 deals with another modification of the Hill cipher. In this, we have introduced interweaving in each step of the iteration. Here, we have found that the interweaving of the resulting plaintext, at each stage of the iteration, and the multiplication with the key matrix strengthen the cipher quite significantly. In the investigation presented in chapter 7, we have extended the analysis of the modified Hill cipher involving interweaving.
Pagination: 235p.
Appears in Departments:Faculty of Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File75.55 kBAdobe PDFView/Open
02_certificates.pdf67.83 kBAdobe PDFView/Open
03_acknowledgements.pdf67.08 kBAdobe PDFView/Open
04_abstract.pdf69.36 kBAdobe PDFView/Open
05_contents.pdf79.91 kBAdobe PDFView/Open
06_list of figures.pdf68.16 kBAdobe PDFView/Open
07_list of research papers.pdf67.11 kBAdobe PDFView/Open
08_chapter 1.pdf125.81 kBAdobe PDFView/Open
09_chapter 2.pdf122.81 kBAdobe PDFView/Open
10_chapter 3.pdf123.13 kBAdobe PDFView/Open
11_chapter 4.pdf122.77 kBAdobe PDFView/Open
12_chapter 5.pdf124.29 kBAdobe PDFView/Open
13_chapter 6.pdf120.38 kBAdobe PDFView/Open
14_chapter 7.pdf118.97 kBAdobe PDFView/Open
15_chapter 8.pdf122.12 kBAdobe PDFView/Open
16_chapter 9.pdf119.8 kBAdobe PDFView/Open
17_chapter 10.pdf127.61 kBAdobe PDFView/Open
18_chapter 11.pdf126.16 kBAdobe PDFView/Open
19_chapter 12.pdf123.13 kBAdobe PDFView/Open
20_chapter 13.pdf121.95 kBAdobe PDFView/Open
21_chapter 14.pdf79.64 kBAdobe PDFView/Open
22_references.pdf90.88 kBAdobe PDFView/Open
23_appendix.pdf3 MBAdobe PDFView/Open

Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.