Dynamic Encryption Algorithm Based on Ergodic Matrix

2012 ◽  
Vol 542-543 ◽  
pp. 1451-1454
Author(s):  
Quan Wang ◽  
Zhi Guo ◽  
Jun Ru Zhang ◽  
Qi Gui Zang

The dynamic encryption algorithm is based on the idea of carrying on encryption to the information using dynamic algorithm; it is one kind of algorithm which can produce the stochastic algorithm. The algorithm, may guarantee that the algorithm transforms dynamically using each time, like this caused that the security of the cryptogram system is relied on protection to cryptogram and also carry on the protection to the encryption algorithm. The key length of dynamic encryption algorithm is random, is suitable to carry on the encryption to the random length plaintext, and the encryption speed is quick, the intensity is high, and therefore there is the broad application prospect. This article given one kind of dynamic encryption algorithm models based on the ergodic matrix as well as the concrete realization method, and proves the algorithm security according to the analysis on massive empirical datum.

2012 ◽  
Vol 542-543 ◽  
pp. 1447-1450
Author(s):  
Hong Wei Xue ◽  
Shi Qun Shen ◽  
Li Na Zhu ◽  
Zhi Guo

The dynamic encryption algorithm is based on the idea of carrying on encryption to the information using dynamic algorithm; it is one kind of algorithm which can produce the stochastic algorithm. The key length of dynamic encryption algorithm is random, is suitable to carry on the encryption to the random length plaintext, and the encryption speed is quick, the intensity is high, and therefore there is the broad application prospect. This article given one kind of dynamic encryption algorithm models based on the ergodic matrix and proves the algorithm security according to the analysis on massive empirical datum.


Author(s):  
Ahmad Al-Jarrah ◽  
Amer Albsharat ◽  
Mohammad Al-Jarrah

<p>This paper proposes a new algorithm for text encryption utilizing English words as a unit of encoding. The algorithm vanishes any feature that could be used to reveal the encrypted text through adopting variable code lengths for the English words, utilizing a variable-length encryption key, applying two-dimensional binary shuffling techniques at the bit level, and utilizing four binary logical operations with randomized shuffling inputs. English words that alphabetically sorted are divided into four lookup tables where each word has assigned an index. The strength of the proposed algorithm concluded from having two major components. Firstly, each lookup table utilizes different index sizes, and all index sizes are not multiples of bytes. Secondly, the shuffling operations are conducted on a two-dimensional binary matrix with variable length. Lastly, the parameters of the shuffling operation are randomized based on a randomly selected encryption key with varying size. Thus, the shuffling operations move adjacent bits away in a randomized fashion. Definitively, the proposed algorithm vanishes any signature or any statistical features of the original message. Moreover, the proposed algorithm reduces the size of the encrypted message as an additive advantage which is achieved through utilizing the smallest possible index size for each lookup table.</p>


2012 ◽  
Vol 490-495 ◽  
pp. 339-342
Author(s):  
Zhi Qiang Liu ◽  
De Han

By introducing dynamic keys in this paper, we present a new encryption algorithm ,which is called dynamic encryption algorithm. The algorithm allows a key to encrypt the plaintext twice, producing two ciphertexts, so that each of them is different if the time is not same. Thus chosen plaintext attacks and known plaintext attacks will become infeasible .


2018 ◽  
Vol 12 (2) ◽  
pp. 46-63 ◽  
Author(s):  
Muzzammil Hussain ◽  
Neha Kaliya

Data privacy is now-a-days a special issue in era of Internet of Things because of the big data stored and transmitted by the public/private devices. Different types and levels of privacy can be provided at different layers of IoT architecture, also different mechanisms operate at different layers of IoT architecture. This article presents the work being done towards the design of a generic framework to integrate these privacy preserving mechanisms at different layers of IoT architecture and can ensure privacy preservation in a heterogeneous IoT environment. The data is classified into different levels of secrecy and appropriate rules and mechanisms are applied to ensure this privacy. The proposed framework is implemented and evaluated for its performance with security and execution time or primary parameters. Various scenarios are also evaluated, and a comparison is done with an existing mechanism ABE (Attribute Based Encryption). It has been found that the proposed work takes less time and is more secure due to short key length and randomness of the parameters used in encryption algorithm.


2020 ◽  
Vol 9 (1) ◽  
pp. 1906-1910

The rapid growth development of the Internet of Things (IoT) has supported communication between various smart devices and it helps to exchange data between them. IoT is very highly demand topics between the researchers. The main goal of IoT in health care is to provide real time monitoring of the patient. But these new challenges also introduced the privacy and security to the health care data. Security is a major concern of the data. A system requires with authentic protocol for maintaining privacy of health care data. After going through all methodologies of the protocol encryption will be carried out of data of the health care with “two fish” encryption technique. At server side, it will automatically get decrypted after applying key. Two fish encryption algorithm is a block cipher algorithm of 128 bit. The key length vary until 256 bit. Key is divided in two parts as the first half of the key will encrypt the plain text and second half of the key will modify the encryption algorithm.


Sign in / Sign up

Export Citation Format

Share Document