Preview

Hill Cipher

Good Essays
Open Document
Open Document
806 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Hill Cipher
Enhancing Security using Cryptography with Matrices
P.Sai Tejesh
12bce0359
VIT University
Ph. No: 7502935512
Abstract :
Cryptography is the study of encoding and decoding secret messages. In the information age, cryptography has become one of the major methods for protection in all applications like cloud computing, mobile security. It allows people to do business electronically without worries of deceit and deception.
When people started doing business online and needed to transfer funds electronically, the applications of cryptography for integrity began to surpass its use for secrecy .The constant increase of information transmitted electronically has lead to an increased reliance on cryptography and authentication. An obvious application of cryptography is the transformation of information to prevent other from observing its meaning. Secure communication is the most straightforward use of cryptography. Two people may communicate securely by encrypting the messages sent between them. The paper presents modifications of the Hill cipher generating dynamic encryption key matrix

Index Terms—Hill cipher, Matrix encryption, Permutation matrix

NOMENCLATURE :

Introduction:
INTRODUCTION
The Hill cipher (HC) algorithm [1] is one of the famous and known symmetric algorithms in the field of cryptography. HC is computationally attractive as using multiplication of a key matrix. HC has several advantages such as masquerading letter frequencies of the plaintext and high throughput [2, 3]. . Despite the ease and speed of the HC, the original HC is no longer used due to the vulnerability against known plaintext-cipher text attack [3].
Recent research and development efforts have been done to improve the security of HC. HC modification [4], HCM-PT, uses a dynamic key matrix obtained by random permutations of rows and columns from the master key matrix and transfers an HC-encrypted permutation to the receiving side. Thus, in HCM-PT, each plaintext vector



References: : 1. Saeednia, S., “How to Make the Hill Cipher Secure”, Cryptologia, 24(4):pp. 353-360, 2000. 2. Mahmoud, A. Y., Chefranov, A. G., “Hill Cipher Modification Based on Eigenvalues HCM-EE”, in Proc. 2nd Int. Conf. Security of Information and Networks (SIN2009), Gazimagusa (TRNC) North Cyprus, Elci, A., Orgun, M., and Chefranov, A. (Eds.), ACM, New York, USA, pp. 164-167, 2009. 3. Application to Cryptography from the site http://aix1.uottawa.ca/~jkhoury/cryptography.htm

You May Also Find These Documents Helpful

  • Good Essays

    Match common encryption algorithms and methods with the scenarios representing real-world business applications and requirements.…

    • 406 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Lab #3

    • 517 Words
    • 3 Pages

    This lab demonstrated how hashing tools can be used to ensure message and file transfer integrity and how encryption can be used to maximize confidentiality. Common hashing and encryption tools, including MD5, SHA1, and GnuPG, were used. You used GnuPG to generate both a public and private key and a secret key for encryption only.…

    • 517 Words
    • 3 Pages
    Good Essays
  • Better Essays

    Every time we have to change our index page htmls for an assignment, we have to log into our personalized servers with passwords. The reason for these passwords is because the information and permissions we have access to should be given to everyone, and therefore the information we have is encrypted from others. As it has become increasingly apparent, our everyday cyber footprint involves many interactions with some sort of encryption. Because of this, most of everything we discuss in class can be considered relevant to the importance of cryptography and/or…

    • 773 Words
    • 4 Pages
    Better Essays
  • Powerful Essays

    What is Steganography?

    • 3206 Words
    • 13 Pages

    Genetic algorithm based method of message hiding employs the features of both Cryptography and Steganography to provide high level protection of secret information .The developed system generates the CRC of the message to be hidden, compresses it to achieve faster speed of transmission and asks for a JPEG image which acts as a carrier of the message. The compressed message is then embedded into JPEG image by P01 algorithm using a secret key at the sending end, hence generating a crypt-stego JPEG image. At the receiving end, the compressed message is extracted from crypt-stego using the same secret key which was used for embedding. The use of cryptography along with genetic algorithm makes the proposed “Crypt-Stegnography” technique more secure and maintains privacy and secrecy of the message. Genetic algorithm maintains appropriate peak signal to noise ratio of JPEG images which results in lesser probability of detection of secret message. The use of P01 technique ensures high embedding capacity. The experiments carried out through the developed system proves higher embedding capacity and maintains secrecy of data.…

    • 3206 Words
    • 13 Pages
    Powerful Essays
  • Better Essays

    Elliptic Curves in Public Key Cryptography: The Diffie Hellman Key Exchange Protocol and its relationship to the Elliptic Curve Discrete Logarithm Problem Public Key Cryptography Public key cryptography is a modern form of cryptography that allows different parties to exchange information securely over an insecure network, without having first to agree upon some secret key. The main use of public key cryptography is to provide information security in computer science, for example to transfer securely email, credit card details or other secret information between sender and recipient via the internet. There are three steps involved in transferring information securely from person A to person B over an insecure network. These are encryption of the original information, called the plaintext, transfer of the encrypted message, or ciphertext, and decryption of the ciphertext back into plaintext. Since the transfer of the ciphertext is over an insecure network, any spy has access to the ciphertext and thus potentially has access to the original information, provided he is able to decipher the message. Thus, a successful cryptosystem must be able encrypt the original message in such a way that only the intended receiver can decipher the ciphertext. The goal of public key cryptography is to make the problem of deciphering the encrypted message too difficult to do in a reasonable time (by say brute-force) unless certain key facts are known. Ideally, only the intended sender and receiver of a message should know these certain key facts. Any certain piece of information that is essential in order to decrypt a message is known as a key. A key(s) specifies the particular function that transforms the original message into ciphertext and vice versa. Public key cryptography relies on two keys, a…

    • 3024 Words
    • 13 Pages
    Better Essays
  • Better Essays

    Also, misused and unauthorized access to personal and private information has become a serious challenge in the digital world. Encryption is a classic and efficient method to solve these issues. However, traditional standard methods such as DES and AES are typically designed for textual information. Those methods due to certain characteristics such as large data and high correlation among pixels are not suitable for multimedia information…

    • 1090 Words
    • 5 Pages
    Better Essays
  • Good Essays

    INTRODUCTION: Blowfish, a symmetric block cipher developed by Bruce Schneier[SCHN93, SCHN94), is a Feistel network, iterating simple encryption and decryption functions of 16 times each. The block size is 64 bits, and the key can be any length up to 448 bits. Although there is a complex initialization phase required before any encryption can take place, the actual encryption of data is very efficient on large microprocessors. Blowfish was designed to have the following characteristics: Fast: Blowfish encrypts data on 32-bit microprocessors at a rate of 18 clock cycles per byte. Compact: Blowfish can run in less than 5K of memory. Simple: Blowfish's simple structure is easy to implement and eases the task of determining the strength of the algorithm. Variably secure: The key length is variable and can be as long as 448 bits. This allows a tradeoff between higher speed and higher security. Blowfish encrypts 64-bit blocks of plaintext into 64-bit blocks of ciphertext. Blowfish is implemented in numerous products and has received a fair amount of scrutiny. So far, the security of Blowfish is unchallenged. DESIGN DECISIONS Based on Schneier's design parameters, he have made these design decisions. The algorithm should: - Manipulate data in large blocks, preferably 32 bits in size (and not in single bits, such as DES). - Have either a 64-bit or a 128-bit block size. - Have a scalable key, from 32 bits to at least 256 bits. - Use simple operations that are efficient on microprocessors: e.g., exclusiveor, addition, table lookup, modular- multiplication. It should not use variablelength shifts or bit-wise permutations, or conditional jumps. - Be implementable on an 8-bit processor with a minimum of 24 bytes of RAM (in addition to the RAM required to store the key) and 1 kilobyte of ROM. - Employ precomputable subkeys. On large-memory systems, these subkeys can be precomputed for faster operation. Not precomputing the subkeys will result in…

    • 607 Words
    • 3 Pages
    Good Essays
  • Better Essays

    Cryptography and Matrices

    • 1619 Words
    • 6 Pages

    Cryptography has played an important role in information and communication security for thousand years. It was first invented due to the need to maintain the secrecy of information transmitted over public lines. The word cryptography came from the Greek words kryptos and graphein, which respectively mean hidden and writing (Damico). Since the ancient days, many forms of cryptography have been created. And in 1929, Lester S. Hill, an American mathematician and educator, introduced a method of cryptography, named Hill cipher, which was based on linear algebra applications. (Anton Rorres 719) Like other forms’, Hill cipher’s basic idea is that by using matrix multiplication, an original message – plaintext – will be converted into a coded message, called ciphertext. This converting process has three main steps: translating the message into a matrix, then multiplying with a cipher matrix to create the encrypted one, and finally converting it into letters.…

    • 1619 Words
    • 6 Pages
    Better Essays
  • Powerful Essays

    Public Key Encription

    • 1636 Words
    • 7 Pages

    Given a key pair, data encrypted with the public-key can only be decrypted with its privatekey; conversely, data encrypted with the private-key can only be decrypted with its publickey. This characteristic is used to implement encryption and digital signature. Both encryption and digital signature principles are illustrated in Figure 1 and Figure 2.…

    • 1636 Words
    • 7 Pages
    Powerful Essays
  • Better Essays

    Qaz1234

    • 4226 Words
    • 17 Pages

    where A is an 8 x 8 matrix with entries in GF(2) and C is a column matrix in GF(2), m(x) is an irreducible polynomial in GF(29). The entries used in A matrix are [f8h; 7ch, 3eh, 1fh, 8fh, c7h, e1h, f1h]T and C = [63h]T (2) To be useful as S-box generator, matrix A should be non-singular. We can generate approximately 263 such non-singular matrices with each irreducible polynomials. The polynomials that result in non-singular matrices are bound by [01; 02; 04; 08; 10; 20; 40; 80]T on lower end and [feh, 7fh, bfh, dfh, efh, f7h, fbh, fdh]T on higher end. As per Avalanche criteria a one bit change in input should result in at least 50% changes in the output bits. A cryptographic…

    • 4226 Words
    • 17 Pages
    Better Essays
  • Better Essays

    Quantum Cryptography

    • 1404 Words
    • 6 Pages

    Cryptology is the process of encoding (cryptography) and decoding (crypto analysis) information or messages (called plaintext). All of these processes combined are cryptology. Earlier cryptology was based on algorithms -- a mathematical process or procedure which were created by a sender and transmitted to a receiver. These algorithms are used in conjunction with a key, a collection of bits (usually numbers). Without the proper key, it 's virtually impossible to decipher an encoded message, even if you know what algorithm to use.…

    • 1404 Words
    • 6 Pages
    Better Essays
  • Satisfactory Essays

    Keyboard Hacking

    • 287 Words
    • 2 Pages

    Network security is a never ending battle between the system design engineers and the computer hackers. In an effort to keep the hackers out, engineers have developed an impressive array of encryption algorithms, authentication protocols and intrusion detection systems. The hackers have developed an equally impressive way of bypassing the security walls.…

    • 287 Words
    • 2 Pages
    Satisfactory Essays
  • Better Essays

    E.F. Brickell (Ed.): Advances in Cryptology - CRYPT0 '92, LNCS 740, pp. 487-496, 1993. 0 Springer-Verlag Berlin Heidelberg 1993…

    • 4403 Words
    • 18 Pages
    Better Essays
  • Satisfactory Essays

    Dynamic Source Routing

    • 375 Words
    • 2 Pages

    In this technical paper a session based symmetric key cryptographic technique, termed as SBSKCT, has been proposed. This proposed technique is very secure and suitable for encryption of large files of any type. SBSKCT considers the plain text as a string with finite no. of binary bits. This input binary string is broken down into blocks of various sizes (of 2k order where k = 3, 4, 5, ….). The encrypted binary string is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string cipher text is formed. Combination of values of block length, number of blocks and no. of iterations generates the session based key for SBSKCT. For decryption the cipher text is considered as binary string. Using the session key information, this binary string is broken down into blocks. The decrypted binary string is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string plain text is reformed.…

    • 375 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Sms Project

    • 5180 Words
    • 21 Pages

    Nowadays mobile phone communications (phone calls) are used mostly by everyone due to the GSM technology. In mobile phones there are several services a person can use to communicate other than making a phone call such as; SMS, MMS, contact registry and cameras. The most commonly used service after phone calls is the SMS that most of us find it easier even faster to share or to communicate with one another. An SMS (short message service) is a text messaging service component in mobile phones that is offered by operators. Several companies presently are using SMS as a business tool/strategy in running their business. High authorities such as government organizations also make use of SMS technology. However, SMS technology is venerable to intruders or attackers whom threats the security of sensitive data transmitted through. In this paper we will show SMS security threats and the proposed solution to overcome such threats, by encrypting SMS messages using Diffie-Hellman. Telecommunication companies, E-marketers and banks are using SMS to run their business like; offering wallpapers, songs, mobile banking, hotel packages, etc... When the user subscribes to such services and interacts with them it will benefits those companies. In addition to that, banks and government departments uses SMS to provide their services in a convenient way. On the other hand there is a serious issue in SMS security because of several attacks that took place in the transmission medium. It is a great technology to use but it lacks security when sending our personal or sensitive information. That is because in GSM network the transmission channel is not secured allows intruders to intercept and keep record of any message passing through. In addition, telecommunication companies do not provide security service. Besides, there is no mandatory requirement for SMS system implantation which means confidentiality and…

    • 5180 Words
    • 21 Pages
    Good Essays