Results 1 
6 of
6
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 7 (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 3 (0 self)
 Add to MetaCart
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.
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.
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
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.
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
 Add to MetaCart
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
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.