On the Applications of Deterministic Chaos for Encrypting Data on the Cloud

Wireless sensor networks are new technologies that are used for various purposes such as environmental monitoring, home security, industrial process monitoring, healthcare programs and etc. Wireless sensor networks are vulnerable to various attacks. Cryptography is one of the methods for secure transmission of information between sensors in wireless sensor networks. A complete and secure encryption system must establish three principles of confidentiality, authentication and integrity. An encryption algorithm alone cannot provide all the principles of encryption. A hybrid encryption algorithm, consisting of symmetric and asymmetric encryption algorithms, provides complete security for a cryptographic system. The papers presented in this area over the last few years, and a new secure algorithm present with regard to the limitations of wireless sensor networks, which establishes three principles of cryptography. The details of the algorithm and basic concepts are presented in such a way that the algorithm can be operational and showed a very high efficiency in compare to the current proposed methods.

Cryptographic Primitives that Resist Backdooring and Subversion

Feistel and SPN are the two main structures in a block cipher. Feistel is a symmetric structure which has the same structure in encryption and decryption, but SPN is not a symmetric structure. Encrypt round function and decrypt round function in SPN structure have three parts, round key addition and substitution layer with S-box for confusion and permutation layer for defusion. Most SPN structure for example ARIA and AES uses 8 bit S-Box at substitution layer, which is vulnerable to Square attack, Boomerang attack, Impossible differentials cryptanalysis etc. In this paper, we propose a SPN which has a symmetric structure in encryption and decryption. The whole operations of proposed algorithm are composed of the even numbers of N rounds where the first half of them, 1 to N/2 round, applies a right function and the last half of them, (N+1)/2 to N round, employs an inverse function. And a symmetry layer is located in between the right function layer and the inverse function layer. The symmetric layer is composed with a multiple simple bit slice involution S-Boxes. The bit slice involution S-Box symmetric layer increases difficult to attack cipher by Square attack, Boomerang attack, Impossible differentials cryptanalysis etc. The proposed symmetric SPN block cipher with bit slice involution S-Box is believed to construct a safe and efficient cipher in Smart Card and RFID environments where electronic chips are built in.

The elliptic curve cryptography is almost used in the literature to develop the public key cryptosystems. A new general-purpose symmetric key cryptosystem using elliptic prime curves is proposed in this paper. For a given prime number P, there are many elliptic prime curves on which each point in the quadrant (0,0) to (P-1,P-1) lays. The set of minimum number of eligible elliptic prime curves for a given prime number P constitutes a lookup table that is the secret key of the proposed cryptosystem. The sender can pick up one eligible elliptic curve for each 2n-bit plaintext block. The sender sends two integers cipher for each 2n-bit plaintext block with encryption rate = 0.8. Moreover, a small prime number can be used efficiently with high security and good robustness against brute force attack.

Four Dimensional (4D) Playfair cipher fused with Linear Feedback Shift Register (LFSR) has the capability of providing confidentiality to any type of data. The main aim of this research is to compare this cipher with the standard ciphers AES-256 and RSA-2048. The comparisons are done on the basis of encryption and decryption times, plain data size versus cipher data size, possible number of keys and types of data supported. It is found from the comparison analysis that the AES-256 is efficient in terms of time, memory and bandwidth consumption when compared to the other two ciphers. For AES-256, data size has to be a multiple of 16 bytes or padded values shouldn’t be a part of original data values in order to be unambiguous while the other two ciphers are always unambiguous. Also, AES-256 is weak against brute force attack when compared to other two ciphers. Among RSA-2048 and 4D Playfair cipher fused with LFSR, latter is highly efficient in terms of time, memory and bandwidth. Therefore, applications wanting to secure all sorts of data efficiently and unambiguously irrespective of data size can use 4D Playfair cipher fused with LFSR. Keywords: Data security; Cryptography; AES; RSA; 4D Playfair cipher

The main topic of this thesis is related to the state of the art in designing cryptographic primitives from a hardware point of view. A special emphasis is dedicated to low-power/low-energy CMOS design. A set of solutions is proposed including an LFSR based stream cipher with self-synchronizing capabilities, a new memory-less Rijndael block cipher architecture and a public key scheme in the class of discrete logarithm. The former is based on arithmetic in large finite field, mainly Galois extension field GF(2‴). These solutions are droved using low-energy techniques, in order to decrease both the switching activity and the total delay. The fundamental motivation supporting this work, is to demonstrate that practical solutions can be obtained for implementing such complex primitives in large scaled circuits, that arc at once, high performance architectures (low-power, high-speed) and cryptographicaly strong, using the well known trade-off between area-speed or area-power. Security constraint has been duly considered, mainly by increasing the key-size. In this work, we explore the general aspects of designing the above mentioned cryptographic functions. We give an extensive survey of some cryptographic primitives from the hardware point of view and expose their security properties. The thesis favours stream cipher and public-key schemes, as currently the most promising advance to capture the notion of key generation and establishment and data bulk encryption. One contribution is the convenient notation for expressing cryptographic self-synchronizing stream ciphers SSSC schemes and our SSMG proposal, a scheme based on packet fingerprint identification, that relies on keyed cryptographic hash function to achieve the security requirements. We maintain an important distinction between hardware implementation and algorithm's security, because the security of cryptographic primitives cannot be based on mathematically strong functions only but requires an extensive cryptanalysis at different levels including the application. This causes a concern for a formalization of the security of an implemented cryptographic primitive. Nevertheless, while some schemes arc well known to be secure such as DL based public key schemes and enough cryptanalyzed such as the new standard Rijndael, some security aspects of the SSMG are discussed. A part of this work studies the specific aspects related to hardware implementation of Rijndael block cipher, the new standard designed to be a substitute for DES. An efficient architecture is developed targeting FPGA implementation, by simply avoiding memory blocks dedicated to the implementation of S-boxes and replacing them by on-chip forward computation using composite Galois field. This technique helps to reduce considerably the amount of hardware required at the cost of little increase of the switching activity. The main conclusion is that, while security constraint of cryptographic primitives increases the hardware complexity and reduces the performances, practical solutions exist for reducing such complexities while keeping or increasing the level of security. Nevertheless, major open questions remain both for a firm theoretical foundation and the proper cryptanalysis of certain solutions.

We analyze a minimal model of iterated function systems (IFS) and show possibilities for controlling properties of the fractal signals they generate. Applications for signal modeling and spread-spectrum communications illustrate the potentialities of IFS for signal processing.

Security of information at this point becomes easier to be abused by another party when that information is sent and stored. To overcome these problems then do research to create an application that uses a hybrid method cryptosystem and digital signature. Methods in hybrid cryptosystem is done by combining the RC4 and RSA. Digital signature method is done by using a hash function SHA-512 with RSA algorithm approach. Applications that are built to perform encryption and decryption on files as well as improving security in sending data by hybrid cryptosystem and digital signature. Based on the research results of all the file types tested successfully encrypted and decrypted as well as the larger the file size, the longer the encryption and decryption process.

Conventional scene graphs use directed acyclic graphs; conventional iterated function systems use infinitely recursive definitions. We investigate scene graphs with recursive cycles for defining graphical scenes. This permits both conventional scene graphs and iterated function systems within the same framework and opens the way for other definitions not possible with either. We explore several mechanisms for limiting the implied recursion in cyclic graphs, including both global and local limits. This approach permits a range of possibilities, including scenes with carefully controlled and locally varying recursive depth. It has applications in art and design.

The H.264 video coding standard has been widely applied to multimedia data transmission. To prevent the contents of video from being recognized by someone unauthorized, providing sufficient security to H.264 has become more and more important. In this thesis, an improved H.264/AVC video encryption method is proposed. As compared with the Shahid’s method, more data are encrypted. And this makes the outcome more desirable. In the proposed scheme, selective encryption (SE) is performed in the motion vector difference (MVD), delta quantization parameter (delta QP), and the context-based adaptive variable length coding (CAVLC) modules. Owing that the encrypted stream should be decoded correctly before decryption, a format-compliant method is presented. Furthermore, in order to keep the bitrate unchanged, keeping the same stream length is another important characteristic of our proposed scheme. Since there is no escalation in bitrate, the proposed encryption algorithm is suitable for real-time multimedia streaming over heterogeneous networks. The encrypting key is generated by using the advanced encryption standard (AES) algorithm, and every frame has its own unique key. Four benchmark video sequences with different combinations of motion, texture and objects were used for experimental evaluation of the proposed scheme. The structural similarity (SSIM) index, a reference value to image quality, of the proposed scheme is 0.202 which is lower than 0.233 of the Shahid’s scheme. The key security is shown reliable under the test of only 1 bit change. The extra computation needed by our scheme is less than 0.5%, so it is feasible for real-time transmission. The above performance on security and sensitivity demonstrates that our proposed scheme is a good candidate for practical applications.

In this paper, an image encryption algorithm using a key of length 64 bits is proposed. And as an enhancement of this technique, a unique 8-bit time-stamp is used prior encryption. Initially, the pixel data is separated into blocks and are then encrypted in a chained fashion. The encrypted blocks are then combined to form an encrypted image. Several graphical and mathematical experiments are performed to validate the enhanced security of the proposed technique.

# Structure of Genetic Regulatory Networks: Evidence for Scale Free Networks (L S Liebovitch et al.) # Modelling Fractal Dynamics (B J West) # Fractional Relaxation of Distributed Order (R Gorenflo & F Mainardi) # Fractional Time: Dishomogeneous Poisson Processes vs. Homogeneous Non-Poisson Processes (P Allegrini et al.) # Markov Memory in Multifractal Natural Processes (N Papasimakis & F Pallikari) # Description of Complex Systems in Terms of Self-Organization Processes of Prime Integer Relations (V Korotkikh & G Korotkikh) # Dynamical Decomposition of Multifractal Time Series as Fractal Evolution and Long-Term Cycles: Applications to Foreign Currency Exchange Market (A Turiel & C Perez-Vicente) # Fractal Sets from Noninvertible Maps (Ch Mira) # A Generative Construction and Visualization of 3D Fractal Measures (T Martyn) # Complexity in Nature and Society: Complexity Management in the Age of Globalization (K Mainzer) # Fractals, Complexity and Chaos in Supply Chain Networks (M Pearson) # The Effects of Different Competition Rules on the Power-Law Exponent of High Income Distribution (K Yamamoto et al.) # Synergetics on Its Way to the Life Sciences (H Haken) # Complexity, Fractals, Nature and Industrial Design: Some Connections (N Sala) # Modelling Pattern Formation Upon Laser-Induced Etching (A Mora et al.) # Fractal Properties of Some Machined Surfaces (T R Thomas & B-G Rosen) # Fractals, Morphological Spectrum and Complexity of Interfacial Patterns in Non-Equilibrium Solidification (P K Galenko & D M Herlach) # Competition of Doublon Structure in the Phase-Field Model (S Tokunaga & H Sakaguchi) # Study of Thermal Field in Composite Materials (P Stefkova et al.) # Simulation of Geochemical Banding in Acidization-Precipitation Experiments In Situ (M Msharrafieh et al.) # Bulk Mediated Surface Diffusion: Non Markovian and Biased Behavior (J A Revelli et al) # Multifractal Formalism for Remote Sensing: A Contribution to the Description and the Understanding of Meteorological Phenomena in Satellite Images (J Grazzini et al.) # The Distance Ratio Fractal Image (X-Z Zhang et al.) # Iterated Function Systems in Mixed Euclidean and p-Adic Spaces (B Sing) # Multifractality of the Multiplicative Autogressive Point Processes (B Kaulakys et al.) # Analysis of Geographical Distribution Patterns in Plants Using Fractals (A Bari et al.) # Hierarchy of Cellular Automata in Relation to Control of Chaos or Anticontrol (M Markus et al.) # Fractal Analysis of the Images Using Wavelet Transformation (P Jerabkova et al.) # Clustering Phenomena in the Time Distribution of Lightning (L Telesca et al.) # A Cornucopia of Connections: Finding Four Familiar Fractals in the Tower of Hanoi (D R Camp) # Monitoring the Depth of Anaesthesia Using Fractal Complexity Method (W Klonowski et al.) # The Complex Couplings and Gompertzian Dynamics (P Waliszewski & J Konarski)

Internet is an important part in the daily life of people in many ways, which allows the people in any corner of the world to share all types of information. Image encryption is used to transmit sensitive multimedia information in unsecured networks to provide high degree of confidentiality. In this paper, a new image encryption method is proposed based on novel implementation of pixel scan, utilizing the Knight’s Travel Path, and true random number. The Knight’s travel path is a pattern in which the path of a Knight around a chess board is taken without revisiting any node. This travel path pattern is used to permute the pixel positions of the original image to obtain the scrambled image. The scrambled image is further XORed with the random key numbers to get the cipher image. To change the pixel values of the scrambled image, true random numbers are generated from the amplitude values of a chosen noise audio file. Decryption is performed to confirm the reception of the sent image. The proposed method resists the statistical, differential, and entropy attacks significantly which have been demonstrated with various standard images.

MDS matrices are used in the design of diffusion layers in many block ciphers and hash functions due to their optimal branch number. But MDS matrices, in general, have costly implementations. So in search for efficiently implementable MDS matrices, there have been many proposals. In particular, circulant, Hadamard, and recursive MDS matrices from companion matrices have been widely studied. In a recent work, recursive MDS matrices from sparse DSI matrices are studied, which are of interest due to their low fixed cost in hardware implementation. In this paper, we present results on the exhaustive search for (recursive) MDS matrices over GL(4, F2). Specifically, circulant MDS matrices of order 4, 5, 6, 7, 8; Hadamard MDS matrices of order 4, 8; recursive MDS matrices from companion matrices of order 4; recursive MDS matrices from sparse DSI matrices of order 4, 5, 6, 7, 8 are considered. It is to be noted that the exhaustive search is impractical with a naive approach. We first use some linear algebra tools to restrict the search to a smaller domain and then apply some space-time trade-off techniques to get the solutions. From the set of solutions in the restricted domain, one can easily generate all the solutions in the full domain. From the experimental results, we can see the (non) existence of (involutory) MDS matrices for the choices mentioned above. In particular, over GL(4, F2), we provide companion matrices of order 4 that yield involutory MDS matrices, circulant MDS matrices of order 8, and establish the nonexistence of involutory circulant MDS matrices of order 6, 8, circulant MDS matrices of order 7, sparse DSI matrices of order 4 that yield involutory MDS matrices, and sparse DSI matrices of order 5, 6, 7, 8 that yield MDS matrices. To the best of our knowledge, these results were not known before. For the choices mentioned above, if such MDS matrices exist, we provide base sets of MDS matrices, from which all the MDS matrices with the least cost (with respect to d-XOR and s-XOR counts) can be obtained. We also take this opportunity to present some results on the search for sparse DSI matrices over finite fields that yield MDS matrices. We establish that there is no sparse DSI matrix S of order 8 over F28 such that S8 is MDS.

Document security is one of the most important things in the exchange of data, especially the exchange of data in the virtual world in which there are many threats when the process is done. Data security, especially for text documents for an organization that assumes that the document is confidential (private and confidential). One aspect of security in a text document is its authenticity, form and contents must be in accordance with the intended by the author. Until now the cryptographic system is one solution to ensure the security of a data that is by encode the contents or content file the document becomes difficult content not even understood through the process of encryption and to recover the original information is done, the decryption process is accompanied by using the key correct. One of the most popular methods in cryptography is RSA, which to this day is very difficult to solve and will take a very long time. This method uses 2 (two) keys, namely public key and private key. Where the key length can be determined and adjusted to the desired level of security. Keywords: data security, RSA, cryptography