Pseudo-random bit generator based on lag time series

"In this paper, we present a pseudo-random bit generator (PRBG) based on two lag time series of the logistic map using positive and negative values in the bifurcation parameter. In order to hidden the map used to build the pseudo-random series we have used a delay in the generation of time series. These new series when they are mapped xn against xn+1 present a cloud of points unrelated to the logistic map. Finally, the pseudo-random sequences have been tested with the suite of NIST giving satisfactory results for use in stream ciphers.

Pseudo-random bit generator based on multi-modal maps

"In this work we present a pseudo-random Bit Generator via unidimensional multi-modal discrete dynamical systems calledk-modal maps. These multi-modal maps are based on the logistic map and are useful to yield pseudo-random sequences with longer period, i.e., in order to attend the problem of periodicity. In addition the pseudo-random sequences generated via multi-modal maps are evaluated with the statistical suite of test from NIST and satisfactory results are obtained when they are used as key stream. Furthermore, we show the impact of using these sequences in a stream cipher resulting in a better encryption quality correlated with the number of modals of the chaotic map. Finally, a statistical security analysis applied to cipher images is given. The proposed algorithm to encrypt is able to resist the chosen-plaintext attack and differential attack because the same set of encryption keys generates a different cipher image every time it is used.

Estudio de mapeos caóticos discretos y su aplicación en criptografía

"La seguridad de la información digital cada vez tiene más auge, debido al creciente uso de dispositivos móviles, además del incremento de operaciones realizadas a través de internet. Esto representa un gran reto ya que para lograr la confidencialidad, integridad y autentificación es necesario el uso de mecanismos especializados, una forma de proporcionar estos servicios es por medio de la criptografía, sin embargo, la creciente demanda requiere de nuevos algoritmos que sean más rápidos y a su vez más seguros. Una opción para lograr estos objetivos es la criptografía basada en sistemas caóticos. Este trabajo de tesis se presenta en tres partes, en la primera parte se muestran los conceptos y definiciones básicas de las ¿áreas de criptografía y sistemas dinámicos, así como las herramientas que se tienen para estudiar cada uno de estos sistemas. Además se da una visión general de estas áreas así como una clasificación, de tal forma que nos enfocaremos en cifrados en flujo y en sistemas dinámicos de tiempo discreto. Cabe señalar que los sistemas dinámicos estudiados en este trabajo a diferencia del mapeo logístico y casa de campaña son multi-modales, los cuales presentan ciertas ventajas en comparación con los mapeos uni-modales. Posteriormente se analizan las similitudes y diferencias que se encuentran en estas dos áreas, dando lugar a la criptografía caótica, la cual ha sido objeto de estudio por diversos grupos de investigación en los últimos años. En la segunda parte de este trabajo se proponen metodologías para construir dos generadores pseudo-aleatorios, los cuales son la parte fundamental en el uso de cifrados en flujo, por un lado se propone el uso de valores positivos y negativos en el parámetro de bifurcación del mapeo logístico en conjunto con retardos, de esta forma es posible construir un generador que muestra resultados satisfactorios a las pruebas estadísticas de aleatoriedad propuestas por el NIST y además no es posible reconstruir el espacio fase. Por otro lado se presenta un generador basado en mapeos multi-modales el cual obtiene una secuencia binaria por medio de la combinación de diferentes modas, la principal ventaja radica en que solo es necesario definir un mapeo para obtener diferentes comportamientos, de igual forma este generador presenta resultados satisfactorios al ser evaluado por las pruebas estadísticas propuestas por el NIST.""The security of digital information is increasingly due to increasing use of mobile devices, in addition to the increase in transactions conducted via Internet. This represents a great challenge in order to achieve confidentiality, integrity and authentication is necessary use specialized mechanisms, a way of providing these services is through cryptography, however, the growing demand requires new algorithms that are faster and safe. One option to achieve these goals is chaos based cryptography. This thesis is presented in three parts, in the first part the basic concepts and definitions of the cryptography and dynamic systems as well as the tools to study each of these systems are shown. Furthermore an overview of these areas and a classification is given, we will focus on stream ciphers and discrete time dynamical systems. Note that the dynamical systems studied in this work unlike the logistic and tent map are multimodal, which have certain advantages compared with uni-modal maps. Afterwards the similarities and differences found in these two areas are analyzed, resulting in chaotic cryptography, which has been studied by several research groups in recent years. In the second part of this work we construct two pseudo-random generators, which are an essential part in the use of stream ciphers, in one hand we propose use positive and negative values in the bifurcation parameter of the logistic map together with delays, in this way it is possible to build a generator showing satisfactory results to statistical tests of randomness proposed by the NIST and it is not possible to reconstruct the phase space. On the other hand we present a generator based on multi-modal maps which produce a binary sequence obtained by combining different modal, the main advantage is that it is only necessary to define one map for different behaviors, similarly this generator presents satisfactory results when is evaluated by statistical tests proposed by the NIST.

Thermal emission of macroporous silicon chirped photonic crystals

Postprint (author's final draft

On-line case-based policy learning for automated planning in probabilistic environments

Many robotic control architectures perform a continuous cycle of sensing, reasoning and acting, where that reasoning can be carried out in a reactive or deliberative form. Reactive methods are fast and provide the robot with high interaction and response capabilities. Deliberative reasoning is particularly suitable in robotic systems because it employs some form of forward projection (reasoning in depth about goals, pre-conditions, resources and timing constraints) and provides the robot reasonable responses in situations unforeseen by the designer. However, this reasoning, typically conducted using Artificial Intelligence techniques like Automated Planning (AP), is not effective for controlling autonomous agents which operate in complex and dynamic environments. Deliberative planning, although feasible in stable situations, takes too long in unexpected or changing situations which require re-planning. Therefore, planning cannot be done on-line in many complex robotic problems, where quick responses are frequently required. In this paper, we propose an alternative approach based on case-based policy learning which integrates deliberative reasoning through AP and reactive response time through reactive planning policies. The method is based on learning planning knowledge from actual experiences to obtain a case-based policy. The contribution of this paper is two fold. First, it is shown that the learned case-based policy produces reasonable and timely responses in complex environments. Second, it is also shown how one case-based policy that solves a particular problem can be reused to solve a similar but more complex problem in a transfer learning scope.This paper has been partially supported by the Spanish Ministerio de Econom a y Competitividad TIN2015-65686-C5-1-R and the European Union's Horizon 2020 Research and Innovation programme under Grant Agreement No. 730086 (ERGO)

Difference map and its electronic circuit realization

"In this paper we study the dynamical behavior of the one-dimensional discrete-time system, the so-called iterated map. Namely, a bimodal quadratic map is introduced which is obtained as an amplification of the difference between well-known logistic and tent maps. Thus, it is denoted as the so-called difference map. The difference map exhibits a variety of behaviors according to the selection of the bifurcation parameter. The corresponding bifurcations are studied by numerical simulations and experimentally. The stability of the difference map is studied by means of Lyapunov exponent and is proved to be chaotic according to Devaney’s definition of chaos. Later on, a design of the electronic implementation of the difference map is presented. The difference map electronic circuit is built using operational amplifiers, resistors and an analog multiplier. It turns out that this electronic circuit presents fixed points, periodicity, chaos and intermittency that match with high accuracy to the corresponding values predicted theoretically.

Cements based on kaolinite waste

The cement industry involves high-energy consumption that generates high CO2 emissions into the atmosphere. Environmental concerns can be addressed by replacing parts of Portland cement clinkers with pozzolanic materials in mortars and concrete. Slag, fly ash and silica fume are materials considered for the planned replacement. Research studies on clay minerals, such as kaolinite, are being followed with special attention by the scientific community and the cement industry. It is well known that these minerals require an activation process to transform kaolinite (K) into metakaolinite (MK). MK is an amorphous material from the transformation of K with high pozzolanic activity, which is its capacity to react with the portlandite released during the hydration of Portland cement, generating compounds such as C–S–H gels and some aluminum-phase hydrates. One of the MK production methods is heat treatment controlled by kaolinite at temperatures in the range of 600–900°C. Different residues have been used (coal mining, paper sludge and waste from a drinking water treatment plant) activated at 600°C for 2h to elaborate blended cements. Due to their good behaviour as future eco-efficient additions, this research is a study by x-ray fluorescence (XRF), x-ray diffraction (XRD) and scanning electron microscopy (SEM) of their influence on the performances of blended cement mixtures (binary and ternary one), with substitutions of pozzolan ratio at 28 days of hydration. The porosity of pozzolanic cements decreases because of the formation of hydrated phases during pozzolanic reaction.the Spanish Ministry of the Economy and Competitiveness under coordinated projects BIA2015-65558C3-1-2-3R (MINECO/FEDER

Emissive properties of SiO2 thin films through photonic windows

Postprint (published version

Empirical demonstration of CO2 detection using macroporous silicon photonic crystals as selective thermal emitters

This study describes the detection of CO2 using macroporous silicon photonic crystals as thermal emitters. It demonstrates that the reduction of structural nonhomogeneities leads to an improvement of the photonic crystals’ emission. Narrow emission bands (¿~120) located within the R-branch of carbon dioxide were achieved. Measurements were made using a deuterated triglycine sulfate photodetector and the photonic crystals, heated to 400°C, as selective emitters. A gas cell with a CO2 concentration between 0 ppm and 10,000 ppm was installed in the center. Results show high sensibility and selectivity that could be used in current nondispersive infrared devices for improving their features. These results open the door to narrowband emission in the mid-infrared for spectroscopic gas detection.Postprint (author's final draft