900 resultados para symmetric block ciphers
Resumo:
In symmetric block ciphers, substitution and diffusion operations are performed in multiple rounds using sub-keys generated from a key generation procedure called key schedule. The key schedule plays a very important role in deciding the security of block ciphers. In this paper we propose a complex key generation procedure, based on matrix manipulations, which could be introduced in symmetric ciphers. The proposed key generation procedure offers two advantages. First, the procedure is simple to implement and has complexity in determining the sub-keys through crypt analysis. Secondly, the procedure produces a strong avalanche effect making many bits in the output block of a cipher to undergo changes with one bit change in the secret key. As a case study, matrix based key generation procedure has been introduced in Advanced Encryption Standard (AES) by replacing the existing key schedule of AES. The key avalanche and differential key propagation produced in AES have been observed. The paper describes the matrix based key generation procedure and the enhanced key avalanche and differential key propagation produced in AES. It has been shown that, the key avalanche effect and differential key propagation characteristics of AES have improved by replacing the AES key schedule with the Matrix based key generation procedure
Resumo:
n the recent years protection of information in digital form is becoming more important. Image and video encryption has applications in various fields including Internet communications, multimedia systems, medical imaging, Tele-medicine and military communications. During storage as well as in transmission, the multimedia information is being exposed to unauthorized entities unless otherwise adequate security measures are built around the information system. There are many kinds of security threats during the transmission of vital classified information through insecure communication channels. Various encryption schemes are available today to deal with information security issues. Data encryption is widely used to protect sensitive data against the security threat in the form of “attack on confidentiality”. Secure transmission of information through insecure communication channels also requires encryption at the sending side and decryption at the receiving side. Encryption of large text message and image takes time before they can be transmitted, causing considerable delay in successive transmission of information in real-time. In order to minimize the latency, efficient encryption algorithms are needed. An encryption procedure with adequate security and high throughput is sought in multimedia encryption applications. Traditional symmetric key block ciphers like Data Encryption Standard (DES), Advanced Encryption Standard (AES) and Escrowed Encryption Standard (EES) are not efficient when the data size is large. With the availability of fast computing tools and communication networks at relatively lower costs today, these encryption standards appear to be not as fast as one would like. High throughput encryption and decryption are becoming increasingly important in the area of high-speed networking. Fast encryption algorithms are needed in these days for high-speed secure communication of multimedia data. It has been shown that public key algorithms are not a substitute for symmetric-key algorithms. Public key algorithms are slow, whereas symmetric key algorithms generally run much faster. Also, public key systems are vulnerable to chosen plaintext attack. In this research work, a fast symmetric key encryption scheme, entitled “Matrix Array Symmetric Key (MASK) encryption” based on matrix and array manipulations has been conceived and developed. Fast conversion has been achieved with the use of matrix table look-up substitution, array based transposition and circular shift operations that are performed in the algorithm. MASK encryption is a new concept in symmetric key cryptography. It employs matrix and array manipulation technique using secret information and data values. It is a block cipher operated on plain text message (or image) blocks of 128 bits using a secret key of size 128 bits producing cipher text message (or cipher image) blocks of the same size. This cipher has two advantages over traditional ciphers. First, the encryption and decryption procedures are much simpler, and consequently, much faster. Second, the key avalanche effect produced in the ciphertext output is better than that of AES.
Resumo:
Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa una función booleana vectorial se puede inicializar de manera muy flexible mediante diferentes estructuras de datas tales como la Tabla de verdad, la Representación de traza y la Forma algebraica normal entre otras. De esta manera VBF permite evaluar los criterios criptográficos más relevantes de los algoritmos de cifra en bloque y de stream, así como funciones hash: por ejemplo, proporciona la no-linealidad, la distancia lineal, el grado algebraico, las estructuras lineales, la distribución de frecuencias de los valores absolutos del espectro Walsh o del espectro de autocorrelación, entre otros criterios. Adicionalmente, VBF puede llevar a cabo operaciones entre funciones booleanas vectoriales tales como la comprobación de igualdad, la composición, la inversión, la suma, la suma directa, el bricklayering (aplicación paralela de funciones booleanas vectoriales como la empleada en el algoritmo de cifra Rijndael), y la adición de funciones coordenada. La tesis también muestra el empleo de la librería VBF en dos aplicaciones prácticas. Por un lado, se han analizado las características más relevantes de los sistemas de cifra en bloque. Por otro lado, combinando VBF con algoritmos de optimización, se han diseñado funciones booleanas cuyas propiedades criptográficas son las mejores conocidas hasta la fecha. ABSTRACT This thesis develops the theoretical foundations and designs an open collection of C++ classes, called VBF, designed for analyzing vector Boolean functions (functions that map a Boolean vector to another Boolean vector) from a cryptographic perspective. This new implementation uses the NTL library from Victor Shoup, adding new modules which complement the existing ones making VBF better suited for cryptography. The fundamental class representing a vector Boolean function can be initialized in a flexible way via several alternative types of data structures such as Truth Table, Trace Representation, Algebraic Normal Form (ANF) among others. This way, VBF allows the evaluation of the most relevant cryptographic criteria for block and stream ciphers as well as for hash functions: for instance, it provides the nonlinearity, the linearity distance, the algebraic degree, the linear structures, the frequency distribution of the absolute values of the Walsh Spectrum or the Autocorrelation Spectrum, among others. In addition, VBF can perform operations such as equality testing, composition, inversion, sum, direct sum, bricklayering (parallel application of vector Boolean functions as employed in Rijndael cipher), and adding coordinate functions of two vector Boolean functions. This thesis also illustrates the use of VBF in two practical applications. On the one hand, the most relevant properties of the existing block ciphers have been analysed. On the other hand, by combining VBF with optimization algorithms, new Boolean functions have been designed which have the best known cryptographic properties up-to-date.
Resumo:
A method is proposed to offer privacy in computer communications, using symmetric product block ciphers. The security protocol involved a cipher negotiation stage, in which two communicating parties select privately a cipher from a public cipher space. The cipher negotiation process includes an on-line cipher evaluation stage, in which the cryptographic strength of the proposed cipher is estimated. The cryptographic strength of the ciphers is measured by confusion and diffusion. A method is proposed to describe quantitatively these two properties. For the calculation of confusion and diffusion a number of parameters are defined, such as the confusion and diffusion matrices and the marginal diffusion. These parameters involve computationally intensive calculations that are performed off-line, before any communication takes place. Once they are calculated, they are used to obtain estimation equations, which are used for on-line, fast evaluation of the confusion and diffusion of the negotiated cipher. A technique proposed in this thesis describes how to calculate the parameters and how to use the results for fast estimation of confusion and diffusion for any cipher instance within the defined cipher space.
Resumo:
In this work will applied the technique of Differential Cryptanalysis, introduced in 1990 by Biham and Shamir, on Papílio s cryptosystem, developed by Karla Ramos, to test and most importantly, to prove its relevance to other block ciphers such as DES, Blowfish and FEAL-N (X). This technique is based on the analysis of differences between plaintext and theirs respective ciphertext, in search of patterns that will assist in the discovery of the subkeys and consequently in the discovery of master key. These differences are obtained by XOR operations. Through this analysis, in addition to obtaining patterns of Pap´ılio, it search to obtain also the main characteristics and behavior of Papilio throughout theirs 16 rounds, identifying and replacing when necessary factors that can be improved in accordance with pre-established definitions of the same, thus providing greater security in the use of his algoritm
Resumo:
We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.
Resumo:
In der algebraischen Kryptoanalyse werden moderne Kryptosysteme als polynomielle, nichtlineare Gleichungssysteme dargestellt. Das Lösen solcher Gleichungssysteme ist NP-hart. Es gibt also keinen Algorithmus, der in polynomieller Zeit ein beliebiges nichtlineares Gleichungssystem löst. Dennoch kann man aus modernen Kryptosystemen Gleichungssysteme mit viel Struktur generieren. So sind diese Gleichungssysteme bei geeigneter Modellierung quadratisch und dünn besetzt, damit nicht beliebig. Dafür gibt es spezielle Algorithmen, die eine Lösung solcher Gleichungssysteme finden. Ein Beispiel dafür ist der ElimLin-Algorithmus, der mit Hilfe von linearen Gleichungen das Gleichungssystem iterativ vereinfacht. In der Dissertation wird auf Basis dieses Algorithmus ein neuer Solver für quadratische, dünn besetzte Gleichungssysteme vorgestellt und damit zwei symmetrische Kryptosysteme angegriffen. Dabei sind die Techniken zur Modellierung der Chiffren von entscheidender Bedeutung, so das neue Techniken entwickelt werden, um Kryptosysteme darzustellen. Die Idee für das Modell kommt von Cube-Angriffen. Diese Angriffe sind besonders wirksam gegen Stromchiffren. In der Arbeit werden unterschiedliche Varianten klassifiziert und mögliche Erweiterungen vorgestellt. Das entstandene Modell hingegen, lässt sich auch erfolgreich auf Blockchiffren und auch auf andere Szenarien erweitern. Bei diesen Änderungen muss das Modell nur geringfügig geändert werden.
Resumo:
We study the preconditioning of symmetric indefinite linear systems of equations that arise in interior point solution of linear optimization problems. The preconditioning method that we study exploits the block structure of the augmented matrix to design a similar block structure preconditioner to improve the spectral properties of the resulting preconditioned matrix so as to improve the convergence rate of the iterative solution of the system. We also propose a two-phase algorithm that takes advantage of the spectral properties of the transformed matrix to solve for the Newton directions in the interior-point method. Numerical experiments have been performed on some LP test problems in the NETLIB suite to demonstrate the potential of the preconditioning method discussed.
Resumo:
The ordering of block copolymers in thin films is reviewed, starting, from the fundamental principles and extending to recent promising developments as templates for nanolithography which may find important applications in the semiconductor industry. Ordering in supported thin films of symmetric and asymmetric AB diblock and ABA triblock copolymers is discussed, along with that of more complex materials such as ABC triblocks and liquid crystalline block copolymers Techniques to prepare thin films, and to characterise ordering within them, are summarized. Several methods to align Hock copolymer nanostructures, important in several applications are outlined A number of potential applications in nanolithography, production of porous materials, templating. and patterning of organic and inorganic materials are then presented. The influence of crystallization on the morphology of a block copolymer film is briefly discussed, as are structures in grafted block copolymer films. (C) 2009 Elsevier Ltd All rights reserved.
Resumo:
Melts of ABA triblock copolymer molecules with identical end blocks are examined using self-consistent field theory (SCFT). Phase diagrams are calculated and compared with those of homologous AB diblock copolymers formed by snipping the triblocks in half. This creates additional end segments which decreases the degree of segregation. Consequently, triblock melts remain ordered to higher temperatures than their diblock counterparts. We also find that middle-block domains are easier to stretch than end-block domains. As a result, domain spacings are slightly larger, the complex phase regions are shifted towards smaller A-segment compositions, and the perforated-lamellar phase becomes more metastable in triblock melts as compared to diblock melts. Although triblock and diblock melts exhibit very similar phase behavior, their mechanical properties can differ substantially due to triblock copolymers that bridge between otherwise disconnected A domains. We evaluate the bridging fraction for lamellar, cylindrical, and spherical morphologies to be about 40%–45%, 60%–65%, and 75%–80%, respectively. These fractions only depend weakly on the degree of segregation and the copolymer composition.
Resumo:
The stability of ternary blends of two immiscible homopolymers and a block copolymer compatiblizer depends crucially on the effective interaction between the copolymermonolayers that form between the unlike homopolymer domains. Here, the interaction is calculated for blends involving A and B homopolymers of equal size with ABABdiblock copolymers of symmetric composition using both self-consistent field theory (SCFT) and strong-segregation theory (SST). If the homopolymers are larger than the copolymer molecules, an attractive interaction is predicted which would destroy the blend. This conclusion coupled with considerations regarding the elastic properties of the monolayer suggests that the optimum size of the homopolymer molecules is about 80% that of the copolymer molecule. A detailed examination of the theory demonstrates that the attraction results from the configurational entropy loss of the homopolymer molecules trapped between the copolymermonolayers. We conclude by suggesting how the monolayers can be altered in order to suppress this attraction and thus improve compatiblization.
Resumo:
A novel Schiff base-copper(II) complex [Cu(2)L(2)(N(3))(2)](ClO(4))(2) 1, where L = (4-imidazolyl)ethylene-2-amino-1-ethylpyridine (apyhist), containing azide-bridges between adjacent copper ions in a dinuclear arrangement was isolated and characterized both in the solid state and in solution by X-ray crystallography and different spectroscopic techniques. Azide binding constants were estimated from titrations of the precursor [CuL(H(2)O)(2)](2+) solutions with sodium azide, giving rise to the azido-bridged species, [Cu(2)L(2)(N(3))(2)](2+). Raman spectra showed asymmetric stretching band at 2060 cm(-1), indicating the presence of azido ligands with a symmetric mu(1,) (1) binding geometry. EPA spectra, in frozen methanol/water solutions at 77 K, exhibited characteristic features of copper centers in tetragonal pyramidal coordination geometry, exhibiting magnetic interactions between them. Further, in solid state, two different values for magnetic coupling in this species were obtained, J/k = -(5.14 +/- 0.02) cm(-1) attributed to the mu(1, 1) azide-bridge mode, and J`z`/k = -(2.94 +/- 0.11) cm(-1) for the interaction between dinuclear moieties via water/perchorate bridges. Finally, an attempt was made to correlate structure and magnetic data for this dinuclear asymmetric end-on azido bridged-copper(II) 1 complex with those of another correlated dinuclear system, complex [Cu(2)L(2)Cl(2)](ClO(4))(2) 2, containing the same tridentate diimine ligand, but with chloro-bridged groups between the copper centres.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
This work reports the first instance of self-organized thermoset blends containing diblock copolymers with a crystallizable thermoset-immiscible block. Nanostructured thermoset blends of bisphenol A-type epoxy resin (ER) and a low-molecular-weight (M-n = 1400) amphiphilic polyethylene-block-poly(ethylene oxide) (EEO) symmetric diblock copolymer were prepared using 4,4'-methylenedianiline (MDA) as curing agent and were characterized by transmission electron microscopy (TEM), atomic force microscopy (AFM), small-angle X-ray scattering (SAXS), and differential scanning calorimetry (DSC). All the MDA-cured ER/EEO blends do not show macroscopic phase separation but exhibit microstructures. The ER selectively mixes with the epoxy-miscible PEO block in the EEO diblock copolymer whereas the crystallizable PE blocks that are immiscible with ER form separate microdomains at nanoscales in the blends. The PE crystals with size on nanoscales are formed and restricted within the individual spherical micelles in the nanostructured ER/EEO blends with EEO content up to 30 wt %. The spherical micelles are highly aggregated in the blends containing 40 and 50 wt % EEO. The PE dentritic crystallites exist in the blend containing 50 wt % EEO whereas the blends with even higher EEO content are completely volume-filled with PE spherulites. The semicrystalline microphase-separated lamellae in the symmetric EEO diblock copolymer are swollen in the blend with decreasing EEO content, followed by a structural transition to aggregated spherical micellar phase morphology and, eventually, spherical micellar phase morphology at the lowest EEO contents. Three morphological regimes are identified, corresponding precisely to the three regimes of crystallization kinetics of the PE blocks. The nanoscale confinement effect on the crystallization kinetics in nanostructured thermoset blends is revealed for the first time. This new phenomenon is explained on the basis of homogeneous nucleation controlled crystallization within nanoscale confined environments in the block copolymer/thermoset blends.
Resumo:
The microphase separation of block copolymer (BCP) thin films can afford a simple and cost-effective means to studying nanopattern surfaces, and especially the fabrication of nanocircuitry. However, because of complex interface effects and other complications, their 3D morphology, which is often critical for application, can be more complex than first thought. Here, we describe how emerging microscopic methods may be used to study complex BCP patterns and reveal their rich detail. These methods include helium ion microscopy (HIM) and high resolution x-section transmission electron microscopy (XTEM), and complement conventional secondary electron and atomic force microscopies (SEM and TEM). These techniques reveal that these structures are quite different to what might be expected. We illustrate the advances in the understanding of BCP thin film morphology in several systems, which result from this characterization. The systems described include symmetric, lamellar forming polystyrene-b-polymethylmethacrylate (PS-b-PMMA), cylinder forming polystyrene-b-polydimethylsiloxane (PS-b-PDMS), as well as lamellar and cylinder forming patterns of polystyrene-b-polyethylene oxide (PS-b-PEO) and polystyrene-b-poly-4-vinylpyridine (PS-b-P4VP). Each of these systems exhibits more complex arrangements than might be first thought. Finding and developing techniques whereby complex morphologies, particularly at very small dimensions, can be determined is critical to the practical use of these materials in many applications. The importance of quantifying these complex morphologies has implications for their use in integrated circuit manufacture, where they are being explored as alternative pattern forming methods to conventional UV lithography.