Competition may explain the fine-scale spatial patterns and genetic structure of two co-occurring plant congeners

1. The spatial distribution of individual plants within a population and the population’s genetic structure are determined by several factors, like dispersal, reproduction mode or biotic interactions. The role of interspecific interactions in shaping the spatial genetic structure of plant populations remains largely unknown. 2. Species with a common evolutionary history are known to interact more closely with each other than unrelated species due to the greater number of traits they share. We hypothesize that plant interactions may shape the fine genetic structure of closely related congeners. 3. We used spatial statistics (georeferenced design) and molecular techniques (ISSR markers) to understand how two closely related congeners, Thymus vulgaris (widespread species) and T. loscosii (narrow endemic) interact at the local scale. Specific cover, number of individuals of both study species and several community attributes were measured in a 10 × 10 m plot. 4. Both species showed similar levels of genetic variation, but differed in their spatial genetic structure. Thymus vulgaris showed spatial aggregation but no spatial genetic structure, while T. loscosii showed spatial genetic structure (positive genetic autocorrelation) at short distances. The spatial pattern of T. vulgaris’ cover showed significant dissociation with that of T. loscosii. The same was true between the spatial patterns of the cover of T. vulgaris and the abundance of T. loscosii and between the abundance of each species. Most importantly, we found a correlation between the genetic structure of T. loscosii and the abundance of T. vulgaris: T. loscosii plants were genetically more similar when they were surrounded by a similar number of T. vulgaris plants. 5. Synthesis. Our results reveal spatially complex genetic structures of both congeners at small spatial scales. The negative association among the spatial patterns of the two species and the genetic structure found for T. loscosii in relation to the abundance of T. vulgaris indicate that competition between the two species may account for the presence of adapted ecotypes of T. loscosii to the abundance of a competing congeneric species. This suggests that the presence and abundance of close congeners can influence the genetic spatial structure of plant species at fine scales.

Dissolution and gettering of iron during contact co-firing

The dissolution and gettering of iron is studied during the final fabrication step of multicrystalline silicon solar cells, the co-firing step, through simulations and experiments. The post-processed interstitial iron concentration is simulated according to the as-grown concentration and distribution of iron within a silicon wafer, both in the presence and absence of the phosphorus emitter, and applying different time-temperature profiles for the firing step. The competing effects of dissolution and gettering during the short annealing process are found to be strongly dependant on the as-grown material quality. Furthermore, increasing the temperature of the firing process leads to a higher dissolution of iron, hardly compensated by the higher diffusivity of impurities. A new defect engineering tool is introduced, the extended co-firing, which could allow an enhanced gettering effect within a small additional time

Computational Study of the Fe(CN)(2)CO Cofactor and Its Binding to HypC Protein.

In the intricate maturation process of [NiFe]-hydrogenases, the Fe(CN)2CO cofactor is first assembled in a HypCD complex with iron coordinated by cysteines from both proteins and CO is added after ligation of cyanides. The small accessory protein HypC is known to play a role in delivering the cofactor needed for assembling the hydrogenase active site. However, the chemical nature of the Fe(CN)2CO moiety and the stability of the cofactor–HypC complex are open questions. In this work, we address geometries, properties, and the nature of bonding of all chemical species involved in formation and binding of the cofactor by means of quantum calculations. We also study the influence of environmental effects and binding to cysteines on vibrational frequencies of stretching modes of CO and CN used to detect the presence of Fe(CN)2CO. Carbon monoxide is found to be much more sensitive to sulfur binding and the polarity of the medium than cyanides. The stability of the HypC–cofactor complex is analyzed by means of molecular dynamics simulation of cofactor-free and cofactor-bound forms of HypC. The results show that HypC is stable enough to carry the cofactor, but since its binding cysteine is located at the N-terminal unstructured tail, it presents large motions in solution, which suggests the need for a guiding interaction to achieve delivery of the cofactor.

Securing implementations of feedback-shift-register-based ciphers using compiler optimizations and co-processors

Los algoritmos basados en registros de desplazamiento con realimentación (en inglés FSR) se han utilizado como generadores de flujos pseudoaleatorios en aplicaciones con recursos limitados como los sistemas de apertura sin llave. Se considera canal primario a aquel que se utiliza para realizar una transmisión de información. La aparición de los ataques de canal auxiliar (en inglés SCA), que explotan información filtrada inintencionadamente a través de canales laterales como el consumo, las emisiones electromagnéticas o el tiempo empleado, supone una grave amenaza para estas aplicaciones, dado que los dispositivos son accesibles por un atacante. El objetivo de esta tesis es proporcionar un conjunto de protecciones que se puedan aplicar de forma automática y que utilicen recursos ya disponibles, evitando un incremento sustancial en los costes y alargando la vida útil de aplicaciones que puedan estar desplegadas. Explotamos el paralelismo existente en algoritmos FSR, ya que sólo hay 1 bit de diferencia entre estados de rondas consecutivas. Realizamos aportaciones en tres niveles: a nivel de sistema, utilizando un coprocesador reconfigurable, a través del compilador y a nivel de bit, aprovechando los recursos disponibles en el procesador. Proponemos un marco de trabajo que nos permite evaluar implementaciones de un algoritmo incluyendo los efectos introducidos por el compilador considerando que el atacante es experto. En el campo de los ataques, hemos propuesto un nuevo ataque diferencial que se adapta mejor a las condiciones de las implementaciones software de FSR, en las que el consumo entre rondas es muy similar. SORU2 es un co-procesador vectorial reconfigurable propuesto para reducir el consumo energético en aplicaciones con paralelismo y basadas en el uso de bucles. Proponemos el uso de SORU2, además, para ejecutar algoritmos basados en FSR de forma segura. Al ser reconfigurable, no supone un sobrecoste en recursos, ya que no está dedicado en exclusiva al algoritmo de cifrado. Proponemos una configuración que ejecuta múltiples algoritmos de cifrado similares de forma simultánea, con distintas implementaciones y claves. A partir de una implementación sin protecciones, que demostramos que es completamente vulnerable ante SCA, obtenemos una implementación segura a los ataques que hemos realizado. A nivel de compilador, proponemos un mecanismo para evaluar los efectos de las secuencias de optimización del compilador sobre una implementación. El número de posibles secuencias de optimizaciones de compilador es extremadamente alto. El marco de trabajo propuesto incluye un algoritmo para la selección de las secuencias de optimización a considerar. Debido a que las optimizaciones del compilador transforman las implementaciones, se pueden generar automáticamente implementaciones diferentes combinamos para incrementar la seguridad ante SCA. Proponemos 2 mecanismos de aplicación de estas contramedidas, que aumentan la seguridad de la implementación original sin poder considerarse seguras. Finalmente hemos propuesto la ejecución paralela a nivel de bit del algoritmo en un procesador. Utilizamos la forma algebraica normal del algoritmo, que automáticamente se paraleliza. La implementación sobre el algoritmo evaluado mejora en rendimiento y evita que se filtre información por una ejecución dependiente de datos. Sin embargo, es más vulnerable ante ataques diferenciales que la implementación original. Proponemos una modificación del algoritmo para obtener una implementación segura, descartando parcialmente ejecuciones del algoritmo, de forma aleatoria. Esta implementación no introduce una sobrecarga en rendimiento comparada con las implementaciones originales. En definitiva, hemos propuesto varios mecanismos originales a distintos niveles para introducir aleatoridad en implementaciones de algoritmos FSR sin incrementar sustancialmente los recursos necesarios. ABSTRACT Feedback Shift Registers (FSR) have been traditionally used to implement pseudorandom sequence generators. These generators are used in Stream ciphers in systems with tight resource constraints, such as Remote Keyless Entry. When communicating electronic devices, the primary channel is the one used to transmit the information. Side-Channel Attack (SCA) use additional information leaking from the actual implementation, including power consumption, electromagnetic emissions or timing information. Side-Channel Attacks (SCA) are a serious threat to FSR-based applications, as an attacker usually has physical access to the devices. The main objective of this Ph.D. thesis is to provide a set of countermeasures that can be applied automatically using the available resources, avoiding a significant cost overhead and extending the useful life of deployed systems. If possible, we propose to take advantage of the inherent parallelism of FSR-based algorithms, as the state of a FSR differs from previous values only in 1-bit. We have contributed in three different levels: architecture (using a reconfigurable co-processor), using compiler optimizations, and at bit level, making the most of the resources available at the processor. We have developed a framework to evaluate implementations of an algorithm including the effects introduced by the compiler. We consider the presence of an expert attacker with great knowledge on the application and the device. Regarding SCA, we have presented a new differential SCA that performs better than traditional SCA on software FSR-based algorithms, where the leaked values are similar between rounds. SORU2 is a reconfigurable vector co-processor. It has been developed to reduce energy consumption in loop-based applications with parallelism. In addition, we propose its use for secure implementations of FSR-based algorithms. The cost overhead is discarded as the co-processor is not exclusively dedicated to the encryption algorithm. We present a co-processor configuration that executes multiple simultaneous encryptions, using different implementations and keys. From a basic implementation, which is proved to be vulnerable to SCA, we obtain an implementation where the SCA applied were unsuccessful. At compiler level, we use the framework to evaluate the effect of sequences of compiler optimization passes on a software implementation. There are many optimization passes available. The optimization sequences are combinations of the available passes. The amount of sequences is extremely high. The framework includes an algorithm for the selection of interesting sequences that require detailed evaluation. As existing compiler optimizations transform the software implementation, using different optimization sequences we can automatically generate different implementations. We propose to randomly switch between the generated implementations to increase the resistance against SCA.We propose two countermeasures. The results show that, although they increase the resistance against SCA, the resulting implementations are not secure. At bit level, we propose to exploit bit level parallelism of FSR-based implementations using pseudo bitslice implementation in a wireless node processor. The bitslice implementation is automatically obtained from the Algebraic Normal Form of the algorithm. The results show a performance improvement, avoiding timing information leakage, but increasing the vulnerability against differential SCA.We provide a secure version of the algorithm by randomly discarding part of the data obtained. The overhead in performance is negligible when compared to the original implementations. To summarize, we have proposed a set of original countermeasures at different levels that introduce randomness in FSR-based algorithms avoiding a heavy overhead on the resources required.