Results 1 
9 of
9
Symmetric and asymmetric encryption
 ACM Computing Surveys
, 1979
"... All cryptosystems currently m use are symmetrm m the sense that they require the transmitter and receiver to share, m secret, either the same pmce of reformation (key) or one of a paLr of related keys easdy computed from each other, the key is used m the encryption process to introduce uncertainty t ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
All cryptosystems currently m use are symmetrm m the sense that they require the transmitter and receiver to share, m secret, either the same pmce of reformation (key) or one of a paLr of related keys easdy computed from each other, the key is used m the encryption process to introduce uncertainty to an unauthorized receiver. Not only is an
On the Keyspace of the Hill Cipher
"... ABSTRACT: In its most general form, the Hill cipher’s keyspace consists of all matrices of a given dimension that are invertible over Zm. Working from known results over finite fields, we assemble and prove a formula for the number of such matrices. We also compare this result with the total number ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
ABSTRACT: In its most general form, the Hill cipher’s keyspace consists of all matrices of a given dimension that are invertible over Zm. Working from known results over finite fields, we assemble and prove a formula for the number of such matrices. We also compare this result with the total number of matrices and the number of involutory matrices for a given dimension and modulus, identifying the effects of change in dimension and modulus on the order of the keyspace.
Hill Cipher Modification based on PseudoRandom Eigenvalues
"... Abstract: The Hill cipher is resistant to bruteforce and statistical attacks, but it can be broken with a known plaintextciphertext attack (KPCA). In this paper, we propose a modification of the Hill cipher, HCMPRE, which is still resistant to bruteforce and statistical attacks, and is resistant ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract: The Hill cipher is resistant to bruteforce and statistical attacks, but it can be broken with a known plaintextciphertext attack (KPCA). In this paper, we propose a modification of the Hill cipher, HCMPRE, which is still resistant to bruteforce and statistical attacks, and is resistant also to KPCA due to dynamic encryption key matrix generating. With the modification, the new HCMPRE can be applied widely in the systems which need high security (e.g., image encryption). Experimental results show that the proposed modification is significantly more effective in the encryption quality of images than original Hill cipher and its known modifications (HCMPT, HCMH, HCMHMAC, and HCMEE) in the case of images with large single colour areas, and slightly more effective otherwise. HCMPRE is about two times faster than HCMEE and HCMHMAC and four times faster than HCMH in the frame of our experiments.
A New Model Based Encryption Mechanism With Time Stamp and Acknowledgement Support
, 2009
"... In this work a model is going to be used which develops data distributed over a identified value which is used as nonce (IV). By properly considering an empirical value, data is derived from the developed model. This empirical value is considered as a key. The process is repeated for different timin ..."
Abstract
 Add to MetaCart
(Show Context)
In this work a model is going to be used which develops data distributed over a identified value which is used as nonce (IV). By properly considering an empirical value, data is derived from the developed model. This empirical value is considered as a key. The process is repeated for different timings which are used as time stamps in the encryption mechanism. Thus this model generates a distributed sequence which is used as sub key. The model involves a identified value which is used as nonce (IV), a considered empirical value which is used as key and different timing as time stamps which are very important parameters in symmetric data encryption schemes which supports not only security but also timeliness of encryption mechanism and also acknowledgement between the participating parties.
On Security of Hill Cipher using Finite Fields
"... Hill cipher in cryptography is a symmetric key substitution algorithm, which is vulnerable to known plaintext attack. The present paper provides two fold securities to the existing Hill cipher by using the elements of finite fields and logical operator. ..."
Abstract
 Add to MetaCart
(Show Context)
Hill cipher in cryptography is a symmetric key substitution algorithm, which is vulnerable to known plaintext attack. The present paper provides two fold securities to the existing Hill cipher by using the elements of finite fields and logical operator.
Role of Statistical tests in Estimation of the Security of a New Encryption Algorithm
"... Encryption study basically deals with three levels of algorithms. The first algorithm deals with encryption mechanism, second deals with decryption Mechanism and the third discusses about the generation of keys and sub keys used in the encryption study. In the given study, a new algorithm is discuss ..."
Abstract
 Add to MetaCart
Encryption study basically deals with three levels of algorithms. The first algorithm deals with encryption mechanism, second deals with decryption Mechanism and the third discusses about the generation of keys and sub keys used in the encryption study. In the given study, a new algorithm is discussed which generates a random sequence which is used as sub key for encryption process. The algorithm executes a series of steps and generates a sequence. This sequence is being used as sub key to be mapped to plain text to generate cipher text. The strength of the encryption & Decryption process depends on the strength of sequence generated against crypto analysis. In this part of work some statistical tests like Uniformity tests, Universal tests & Repetition tests are tried on the sequence generated to test the strength of it.
Secure Hill Cipher Modification Based on Generalized Permutation Matrix SHCGPM
, 2012
"... Abstract: Secure Hill cipher (SHC) modification based on dynamically changing generalized permutation matrix, SHCGPM is proposed. It provides better security than that of SHC due to the significantly larger number of nonrepeatedly generated keys ( 48 2 times greater for the parameters used in the ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: Secure Hill cipher (SHC) modification based on dynamically changing generalized permutation matrix, SHCGPM is proposed. It provides better security than that of SHC due to the significantly larger number of nonrepeatedly generated keys ( 48 2 times greater for the parameters used in the conducted experiments). SHCGPM is shown to be robust against the bruteforce, statistical attacks, and is resistant also to known plaintext ciphertext attack (KPCA) due to dynamic encryption key matrix generating. The proposed modification is applied for colour images encryption. Experimental results show that the proposed modification is significantly more effective in the encryption quality of bitmap images
HILL CIPHERS: A LINEARALGEBRA PROJECT WITHMATHEMATICA
"... Abstract A project on Hill ciphers is discussed here that is suitable for a beginning linear algebra course. In the project, students use the computer algebra system Mathematica to implement the Hill encipherment method and to “crack ” a Hill cipher. This paper explains Hill ciphers as an applicati ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract A project on Hill ciphers is discussed here that is suitable for a beginning linear algebra course. In the project, students use the computer algebra system Mathematica to implement the Hill encipherment method and to “crack ” a Hill cipher. This paper explains Hill ciphers as an application of linear algebra over n; describes the project from the student’s point of view; and discusses the software implementation needed for the project. Introduction Students ’ being able to learn math on their own is a desirable instructional goal. Software such as Mathematica can facilitate achieving that goal. How this can be done is illustrated by a project on Hill ciphers—an engaging application of linear algebra to cryptology—in which students express the concepts in the form of Mathematica functions which they then use to “crack ” a Hill cipher, that is, to discover
Short Paper COMMENTS ON SAEEDNIA’s IMPROVED SCHEME FOR THE HILL CIPHER
"... In 2000, Saeednia proposed a new scheme to make the Hill cipher secure. The author makes use of permutations of columns and rows of a matrix to get a different key for encrypting each message. This paper shows that the cipher key Ht can be obtained by parameter u. Besides, the Saeednia’s scheme cost ..."
Abstract
 Add to MetaCart
In 2000, Saeednia proposed a new scheme to make the Hill cipher secure. The author makes use of permutations of columns and rows of a matrix to get a different key for encrypting each message. This paper shows that the cipher key Ht can be obtained by parameter u. Besides, the Saeednia’s scheme costs a lot of time in matrix computation. To overcome the drawbacks of Saeednia’s scheme, a more secure cryptosystem with a oneway hash function is proposed. Key Words: Hill cipher, knownplaintext attack, cryptosystem, oneway hash function. *Corresponding author. (Tel: 886423590121 ext. 3287; Fax: