8 resultados para Burlando, Amalia

em Universidad Politécnica de Madrid


Relevância:

10.00% 10.00%

Publicador:

Resumo:

The extraordinary increase of new information technologies, the development of Internet, the electronic commerce, the e-government, mobile telephony and future cloud computing and storage, have provided great benefits in all areas of society. Besides these, there are new challenges for the protection of information, such as the loss of confidentiality and integrity of electronic documents. Cryptography plays a key role by providing the necessary tools to ensure the safety of these new media. It is imperative to intensify the research in this area, to meet the growing demand for new secure cryptographic techniques. The theory of chaotic nonlinear dynamical systems and the theory of cryptography give rise to the chaotic cryptography, which is the field of study of this thesis. The link between cryptography and chaotic systems is still subject of intense study. The combination of apparently stochastic behavior, the properties of sensitivity to initial conditions and parameters, ergodicity, mixing, and the fact that periodic points are dense, suggests that chaotic orbits resemble random sequences. This fact, and the ability to synchronize multiple chaotic systems, initially described by Pecora and Carroll, has generated an avalanche of research papers that relate cryptography and chaos. The chaotic cryptography addresses two fundamental design paradigms. In the first paradigm, chaotic cryptosystems are designed using continuous time, mainly based on chaotic synchronization techniques; they are implemented with analog circuits or by computer simulation. In the second paradigm, chaotic cryptosystems are constructed using discrete time and generally do not depend on chaos synchronization techniques. The contributions in this thesis involve three aspects about chaotic cryptography. The first one is a theoretical analysis of the geometric properties of some of the most employed chaotic attractors for the design of chaotic cryptosystems. The second one is the cryptanalysis of continuos chaotic cryptosystems and finally concludes with three new designs of cryptographically secure chaotic pseudorandom generators. The main accomplishments contained in this thesis are: v Development of a method for determining the parameters of some double scroll chaotic systems, including Lorenz system and Chua’s circuit. First, some geometrical characteristics of chaotic system have been used to reduce the search space of parameters. Next, a scheme based on the synchronization of chaotic systems was built. The geometric properties have been employed as matching criterion, to determine the values of the parameters with the desired accuracy. The method is not affected by a moderate amount of noise in the waveform. The proposed method has been applied to find security flaws in the continuous chaotic encryption systems. Based on previous results, the chaotic ciphers proposed by Wang and Bu and those proposed by Xu and Li are cryptanalyzed. We propose some solutions to improve the cryptosystems, although very limited because these systems are not suitable for use in cryptography. Development of a method for determining the parameters of the Lorenz system, when it is used in the design of two-channel cryptosystem. The method uses the geometric properties of the Lorenz system. The search space of parameters has been reduced. Next, the parameters have been accurately determined from the ciphertext. The method has been applied to cryptanalysis of an encryption scheme proposed by Jiang. In 2005, Gunay et al. proposed a chaotic encryption system based on a cellular neural network implementation of Chua’s circuit. This scheme has been cryptanalyzed. Some gaps in security design have been identified. Based on the theoretical results of digital chaotic systems and cryptanalysis of several chaotic ciphers recently proposed, a family of pseudorandom generators has been designed using finite precision. The design is based on the coupling of several piecewise linear chaotic maps. Based on the above results a new family of chaotic pseudorandom generators named Trident has been designed. These generators have been specially designed to meet the needs of real-time encryption of mobile technology. According to the above results, this thesis proposes another family of pseudorandom generators called Trifork. These generators are based on a combination of perturbed Lagged Fibonacci generators. This family of generators is cryptographically secure and suitable for use in real-time encryption. Detailed analysis shows that the proposed pseudorandom generator can provide fast encryption speed and a high level of security, at the same time. El extraordinario auge de las nuevas tecnologías de la información, el desarrollo de Internet, el comercio electrónico, la administración electrónica, la telefonía móvil y la futura computación y almacenamiento en la nube, han proporcionado grandes beneficios en todos los ámbitos de la sociedad. Junto a éstos, se presentan nuevos retos para la protección de la información, como la suplantación de personalidad y la pérdida de la confidencialidad e integridad de los documentos electrónicos. La criptografía juega un papel fundamental aportando las herramientas necesarias para garantizar la seguridad de estos nuevos medios, pero es imperativo intensificar la investigación en este ámbito para dar respuesta a la demanda creciente de nuevas técnicas criptográficas seguras. La teoría de los sistemas dinámicos no lineales junto a la criptografía dan lugar a la ((criptografía caótica)), que es el campo de estudio de esta tesis. El vínculo entre la criptografía y los sistemas caóticos continúa siendo objeto de un intenso estudio. La combinación del comportamiento aparentemente estocástico, las propiedades de sensibilidad a las condiciones iniciales y a los parámetros, la ergodicidad, la mezcla, y que los puntos periódicos sean densos asemejan las órbitas caóticas a secuencias aleatorias, lo que supone su potencial utilización en el enmascaramiento de mensajes. Este hecho, junto a la posibilidad de sincronizar varios sistemas caóticos descrita inicialmente en los trabajos de Pecora y Carroll, ha generado una avalancha de trabajos de investigación donde se plantean muchas ideas sobre la forma de realizar sistemas de comunicaciones seguros, relacionando así la criptografía y el caos. La criptografía caótica aborda dos paradigmas de diseño fundamentales. En el primero, los criptosistemas caóticos se diseñan utilizando circuitos analógicos, principalmente basados en las técnicas de sincronización caótica; en el segundo, los criptosistemas caóticos se construyen en circuitos discretos u ordenadores, y generalmente no dependen de las técnicas de sincronización del caos. Nuestra contribución en esta tesis implica tres aspectos sobre el cifrado caótico. En primer lugar, se realiza un análisis teórico de las propiedades geométricas de algunos de los sistemas caóticos más empleados en el diseño de criptosistemas caóticos vii continuos; en segundo lugar, se realiza el criptoanálisis de cifrados caóticos continuos basados en el análisis anterior; y, finalmente, se realizan tres nuevas propuestas de diseño de generadores de secuencias pseudoaleatorias criptográficamente seguros y rápidos. La primera parte de esta memoria realiza un análisis crítico acerca de la seguridad de los criptosistemas caóticos, llegando a la conclusión de que la gran mayoría de los algoritmos de cifrado caóticos continuos —ya sean realizados físicamente o programados numéricamente— tienen serios inconvenientes para proteger la confidencialidad de la información ya que son inseguros e ineficientes. Asimismo una gran parte de los criptosistemas caóticos discretos propuestos se consideran inseguros y otros no han sido atacados por lo que se considera necesario más trabajo de criptoanálisis. Esta parte concluye señalando las principales debilidades encontradas en los criptosistemas analizados y algunas recomendaciones para su mejora. En la segunda parte se diseña un método de criptoanálisis que permite la identificaci ón de los parámetros, que en general forman parte de la clave, de algoritmos de cifrado basados en sistemas caóticos de Lorenz y similares, que utilizan los esquemas de sincronización excitador-respuesta. Este método se basa en algunas características geométricas del atractor de Lorenz. El método diseñado se ha empleado para criptoanalizar eficientemente tres algoritmos de cifrado. Finalmente se realiza el criptoanálisis de otros dos esquemas de cifrado propuestos recientemente. La tercera parte de la tesis abarca el diseño de generadores de secuencias pseudoaleatorias criptográficamente seguras, basadas en aplicaciones caóticas, realizando las pruebas estadísticas, que corroboran las propiedades de aleatoriedad. Estos generadores pueden ser utilizados en el desarrollo de sistemas de cifrado en flujo y para cubrir las necesidades del cifrado en tiempo real. Una cuestión importante en el diseño de sistemas de cifrado discreto caótico es la degradación dinámica debida a la precisión finita; sin embargo, la mayoría de los diseñadores de sistemas de cifrado discreto caótico no ha considerado seriamente este aspecto. En esta tesis se hace hincapié en la importancia de esta cuestión y se contribuye a su esclarecimiento con algunas consideraciones iniciales. Ya que las cuestiones teóricas sobre la dinámica de la degradación de los sistemas caóticos digitales no ha sido totalmente resuelta, en este trabajo utilizamos algunas soluciones prácticas para evitar esta dificultad teórica. Entre las técnicas posibles, se proponen y evalúan varias soluciones, como operaciones de rotación de bits y desplazamiento de bits, que combinadas con la variación dinámica de parámetros y con la perturbación cruzada, proporcionan un excelente remedio al problema de la degradación dinámica. Además de los problemas de seguridad sobre la degradación dinámica, muchos criptosistemas se rompen debido a su diseño descuidado, no a causa de los defectos esenciales de los sistemas caóticos digitales. Este hecho se ha tomado en cuenta en esta tesis y se ha logrado el diseño de generadores pseudoaleatorios caóticos criptogr áficamente seguros.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Desarrollo de algoritmo de interpolación basado en descomposición octree y funciones radiales de soporte compacto para movimiento de mallas en problemas aerolásticos

Relevância:

10.00% 10.00%

Publicador:

Resumo:

En este artículo se realiza el criptoanálisis de un criptosistema caótico basado en el sistema de Lorenz, que utiliza dos canales de comunicación y una función no lineal caótica. Se demuestra que el sistema propuesto es inseguro ya que los valores de los parámetros del sistema pueden determinarse con gran precisión utilizando un receptor intruso.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We examine the connectivity fluctuations across networks obtained when the horizontal visibility (HV) algorithm is used on trajectories generated by nonlinear circle maps at the quasiperiodic transition to chaos. The resultant HV graph is highly anomalous as the degrees fluctuate at all scales with amplitude that increases with the size of the network. We determine families of Pesin-like identities between entropy growth rates and generalized graph-theoretical Lyapunov exponents. An irrational winding number with pure periodic continued fraction characterizes each family. We illustrate our results for the so-called golden, silver, and bronze numbers

Relevância:

10.00% 10.00%

Publicador:

Resumo:

La crisis y la disminución de confianza en las Administraciones Públicas están produciendo que los gobiernos apuesten por nuevos sistemas de gobernanza y organización. Si bien esto es un hecho claro, no lo es tanto el nivel de implantación e implicación en estos temas por parte de las Administraciones. El objetivo principal de este proyecto es el de determinar el Estado de Madurez del Gobierno Abierto en el Sector Público Español. Para ello, se realiza un estudio teórico en el que se enmarca este concepto y se dan a conocer las definiciones previas y puntos clave necesarios para su implantación. Posteriormente, mediante distintos análisis, entre los que se incluyen indicadores, encuestas y estudios de las diferentes webs, se pretende llegar al estado actual y a un modelo general y eficiente de Gobierno Abierto. ABSTRACT. Crisis and the fall in public authorities confident are making Governments go to new systems of Government and organization. Although this is a fact, not so much the level of implantation and involvement in these issues by the administrations. The main aim of this project is determine the State of Maturity of the Open Government in the Spanish Public Sector. To achieve this, a theoretical study is made which include this concept and the previous definitions and key points required are given for its implementation. Subsequently, by several analysis, including indicators, surveys and studies of the different sites, we intend to reach the current state and a general and efficient model of Open Government.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Legumes establish a root-nodule symbiosis with soil bacteria collectively known as rhizobia. This symbiosis allows legumes to benefit from the nitrogen fixation capabilities of rhizobia and thus to grow in the absence of any fixed nitrogen source. This is especially relevant for Agriculture, where intensive plant growth depletes soils of useable, fixed nitrogen sources. One of the main features of the root nodule symbiosis is its specificity. Different rhizobia are able to nodulate different legumes. Rhizobium leguminosarum bv. viciae is able to establish an effective symbiosis with four different plant genera (Pisum, Lens, Vicia, Lathyrus), and any given isolate will nodulate any of the four plant genera. A population genomics study with rhizobia isolated from P. sativum, L. culinaris, V. sativa or V. faba, all originating in the same soil, showed that plants select specific genotypes from those available in that soil. This was demonstrated at the genome-wide level, but also for specific genes. Accelerated mesocosm studies with successive plant cultures provided additional evidence on this plant selection and on the nature of the genotypes selected. Finally, representatives from the major rhizobial genotypes isolated from these plants allowed characterization of the size and nature of the respective pangenome and specific genome compartments. These were compared to the different genotypes ?symbiotic and non-symbiotic?present in rhizobial populations isolated directly from the soil without plant intervention.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Rhizobium leguminosarum bv viciae (Rlv) is a soil bacterium able to establish specific root-nodule symbioses with legumes of four different genera: Pisum, Vicia, Lens and Lathyrus. Rlv isolates from nodules of any of these legumes can nodulate any of them; however, it has been shown that plants select specific rhizobial genotypes from those present in the soil (1,2). We have previously shown this at the genomic level by following a population genomics approach. Pool genomic sequences from 100 isolates from each of four plant species: P. sativum, L. culinaris, V. faba and V. sativa, show different, specific profiles at the single nucleotide polymorphism (SNP) level for relevant genes. In this work, the extent of Rlv selection from a well-characterized soil population by different legume plant hosts: P. sativum, L. culinaris, V. faba and V. sativa, after a medium-term mesocosm study is described. Direct soil isolates from each of these mesocosm studies have been tested for specific rhizobial genes (glnII and fnrN) and symbiotic genes (nodC and nifH). Different populations were characterized further by Sanger sequencing of both the rpoB phylogenetic marker gene and the symbiotic genes nodC and nifH. The distribution and size of the rhizobial population for each legume host showed changes during the medium-term mesocosm study. Particularly, a non-symbiotic group of rhizobia was enriched by all four hosts, in contrast to the symbiotic rhizobia profile, which was specific for each legume plant host.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The refractive index and extinction coefficient of chemical vapour deposition grown graphene are determined by ellipsometry analysis. Graphene films were grown on copper substrates and transferred as both monolayers and bilayers onto SiO2/Si substrates by using standard manufacturing procedures. The chemical nature and thickness of residual debris formed after the transfer process were elucidated using photoelectron spectroscopy. The real layered structure so deduced has been used instead of the nominal one as the input in the ellipsometry analysis of monolayer and bilayer graphene, transferred onto both native and thermal silicon oxide. The effect of these contamination layers on the optical properties of the stacked structure is noticeable both in the visible and the ultraviolet spectral regions, thus masking the graphene optical response. Finally, the use of heat treatment under a nitrogen atmosphere of the graphene-based stacked structures, as a method to reduce the water content of the sample, and its effect on the optical response of both graphene and the residual debris layer are presented. The Lorentz-Drude model proposed for the optical response of graphene fits fairly well the experimental ellipsometric data for all the analysed graphene-based stacked structures.