A public key cryptosystem based on block upper triangular matrices

We propose a public key cryptosystem based on block upper triangular matrices. This system is a variant of the Discrete Logarithm Problem with elements in a finite group, capable of increasing the difficulty of the problem while maintaining the key size. We also propose a key exchange protocol that guarantees that both parties share a secret element of this group and a digital signature scheme that provides data authenticity and integrity.

Simulación de procesos químicos (curso 2011-2012)

Apuntes en formato html que incluyen los siguientes temas de la parte de simulación en la asignatura «simulación y optimización de procesos químicos» TEMA 1. Introducción 1.1 Introducción. 1.2 Desarrollo histórico de la simulación de procesos. Relación entre simulación optimización y síntesis de procesos. 1.3 Tipos de simuladores: Modular secuencial. Modular simultáneo. Basada en ecuaciones. TEMA 2. Simulación Modular Secuencial 2.1 Descomposición de diagramas de flujo (flowsheeting) 2.2 Métodos basados en las matrices booleanas Localización de redes cíclicas máximas. Algoritmo de Sargent y Westerberg. Algoritmo de Tarjan. 2.3 Selección de las corrientes de corte: 2.3.1 Caso general planteamiento como un "set-covering problem" (algoritmo de Pho y Lapidus) 2.3.2 Número mínimo de corrientes de corte (algoritmo de Barkley y Motard) 2.3.3 Conjunto de corrientes de corte no redundante (Algoritmo de Upadhye y Grens) TEMA 3. Simulación Modular Simultánea 3.1 Efecto de las estrategias tipo cuasi Newton sobre la convergencia de los diagramas de flujo. TEMA 4. Simulación Basada en Ecuaciones 4.1 Introducción. Métodos de factorización de matrices dispersas. Métodos a priori y métodos locales. 4.2 Métodos locales: Criterio de Markowitz. 4.3 Métodos a priori: 4.3.1 Triangularización por bloques: a. Base de salida admisible (transversal completo). b. Aplicación de los algoritmos de Sargent y Tarjan a matrices dispersas. c. Reordenación. 4.3.2 Transformación en matriz triangular bordeada. 4.4 Fase numerica. Algoritmo RANKI 4.5 Comparación entre los diferentes sistemas de simulación. Ventajas e Inconvenientes. TEMA 5. Grados de libertad y variables de diseño de un diagrama de flujo 5.1 Teorema de Duhem y regla de las fases 5.2 Grados de libertad de un equipo 5.3 Grados de libertad de un diagrama de flujo 5.4 Elección de las variables de diseño.

Magnetism in graphene nanoislands

We study the magnetic properties of nanometer-sized graphene structures with triangular and hexagonal shapes terminated by zigzag edges. We discuss how the shape of the island, the imbalance in the number of atoms belonging to the two graphene sublattices, the existence of zero-energy states, and the total and local magnetic moment are intimately related. We consider electronic interactions both in a mean-field approximation of the one-orbital Hubbard model and with density functional calculations. Both descriptions yield values for the ground state total spin S consistent with Lieb’s theorem for bipartite lattices. Triangles have a finite S for all sizes whereas hexagons have S=0 and develop local moments above a critical size of ≈1.5  nm.

Optimizing the number of stations in arrays measurements: experimental outcomes for different array geometries and the f-k method

Array measurements have become a valuable tool for site response characterization in a non-invasive way. The array design, i.e. size, geometry and number of stations, has a great influence in the quality of the obtained results. From the previous parameters, the number of available stations uses to be the main limitation for the field experiments, because of the economical and logistical constraints that it involves. Sometimes, from the initially planned array layout, carefully designed before the fieldwork campaign, one or more stations do not work properly, modifying the prearranged geometry. Whereas other times, there is not possible to set up the desired array layout, because of the lack of stations. Therefore, for a planned array layout, the number of operative stations and their arrangement in the array become a crucial point in the acquisition stage and subsequently in the dispersion curve estimation. In this paper we carry out an experimental work to analyze which is the minimum number of stations that would provide reliable dispersion curves for three prearranged array configurations (triangular, circular with central station and polygonal geometries). For the optimization study, we analyze together the theoretical array responses and the experimental dispersion curves obtained through the f-k method. In the case of the f-k method, we compare the dispersion curves obtained for the original or prearranged arrays with the ones obtained for the modified arrays, i.e. the dispersion curves obtained when a certain number of stations n is removed, each time, from the original layout of X geophones. The comparison is evaluated by means of a misfit function, which helps us to determine how constrained are the studied geometries by stations removing and which station or combination of stations affect more to the array capability when they are not available. All this information might be crucial to improve future array designs, determining when it is possible to optimize the number of arranged stations without losing the reliability of the obtained results.

A Matrix PRNG with S-Box Output Filtering

We describe a modification to a previously published pseudorandom number generator improving security while maintaining high performance. The proposed generator is based on the powers of a word-packed block upper triangular matrix and it is designed to be fast and easy to implement in software since it mainly involves bitwise operations between machine registers and, in our tests, it presents excellent security and statistical characteristics. The modifications include a new, key-derived s-box based nonlinear output filter and improved seeding and extraction mechanisms. This output filter can also be applied to other generators.

Topological spin waves in the atomic-scale magnetic skyrmion crystal

We study the spin waves of the triangular skyrmion crystal that emerges in a two-dimensional spin lattice model as a result of the competition between Heisenberg exchange, Dzyalonshinkii–Moriya interactions, Zeeman coupling and uniaxial anisotropy. The calculated spin wave bands have a finite Berry curvature that, in some cases, leads to non-zero Chern numbers, making this system topologically distinct from conventional magnonic systems. We compute the edge spin-waves, expected from the bulk-boundary correspondence principle, and show that they are chiral, which makes them immune to elastic backscattering. Our results illustrate how topological phases can occur in self-generated emergent superlattices at the mesoscale.

Summary of the evolution of the fortifications of Santa Barbara Castle in Alicante from its origins to the beginning of the eighteenth century

Since ancient times, Alicante has been considered a strategic location on the east coast of Spain. Situated close to the sea, it is protected to the southeast by the Cape of Huerta and to the southwest by the Cape of Santa Pola. The city lies at the foot of Mount Benacantil, a high outcrop which has been the site of defensive buildings since time immemorial due to its naturally strong position: it was undoubtedly one of the strongest natural sites in the Levant. Its summit, lying 160 metres above the sea, is topped by a series of fortified enclosures now known as Santa Barbara Castle. This paper briefly describes the alterations made to the castle fortifications from its origins through the Renaissance, including the Muslim and Christian periods until the late fifteenth century and subsequent alterations to adapt new bastioned fortification techniques, and depicts the status of the fortress in each period. This paper is the result of doctoral research carried out at different national and international archives and leading to a thesis presented in 2011.