Study of a New Chaotic Dynamical System and Its Usage in a Novel Pseudorandom Bit Generator

A new chaotic discrete dynamical system, built on trigonometric functions, is proposed. With intent to use this system within cryptographic applications, we proved with the aid of specific tools from chaos theory (e.g., Lyapunov exponent, attractor’s fractal dimension, and Kolmogorov-Smirnov test) and statistics (e.g., NIST suite of tests) that the newly proposed dynamical system has a chaotic behavior, for a large parameter’s value space, and very good statistical properties, respectively. Further, the proposed chaotic dynamical system is used, in conjunction with a binary operation, in the designing of a new pseudorandom bit generator (PRBG) model. The PRBG is subjected, by turns, to an assessment of statistical properties. Theoretical and practical arguments, rounded by good statistical results, confirm viability of the proposed chaotic dynamical system and newly designed PRBG, recommending them for usage within cryptographic applications

Formal security analysis of registration protocols for interactive systems: a methodology and a case of study

In this work we present and formally analyze CHAT-SRP (CHAos based Tickets-Secure Registration Protocol), a protocol to provide interactive and collaborative platforms with a cryptographically robust solution to classical security issues. Namely, we focus on the secrecy and authenticity properties while keeping a high usability. In this sense, users are forced to blindly trust the system administrators and developers. Moreover, as far as we know, the use of formal methodologies for the verification of security properties of communication protocols isn't yet a common practice. We propose here a methodology to fill this gap, i.e., to analyse both the security of the proposed protocol and the pertinence of the underlying premises. In this concern, we propose the definition and formal evaluation of a protocol for the distribution of digital identities. Once distributed, these identities can be used to verify integrity and source of information. We base our security analysis on tools for automatic verification of security protocols widely accepted by the scientific community, and on the principles they are based upon. In addition, it is assumed perfect cryptographic primitives in order to focus the analysis on the exchange of protocol messages. The main property of our protocol is the incorporation of tickets, created using digests of chaos based nonces (numbers used only once) and users' personal data. Combined with a multichannel authentication scheme with some previous knowledge, these tickets provide security during the whole protocol by univocally linking each registering user with a single request. [..]Comment: 32 pages, 7 figures, 8 listings, 1 tabl

Parallel Local Search for the Costas Array Problem

The Costas Array Problem is a highly combina- torial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implementations, while the parallel version shows nearly linear speedups up to 8,192 cores

Large-scale parallelism for constraint-based local search: the costas array case study

International audienceWe present the parallel implementation of a constraint-based Local Search algorithm and investigate its performance on several hardware plat-forms with several hundreds or thousands of cores. We chose as the basis for these experiments the Adaptive Search method, an efficient sequential Local Search method for Constraint Satisfaction Problems (CSP). After preliminary experiments on some CSPLib benchmarks, we detail the modeling and solving of a hard combinatorial problem related to radar and sonar applications: the Costas Array Problem. Performance evaluation on some classical CSP bench-marks shows that speedups are very good for a few tens of cores, and good up to a few hundreds of cores. However for a hard combinatorial search problem such as the Costas Array Problem, performance evaluation of the sequential version shows results outperforming previous Local Search implementations, while the parallel version shows nearly linear speedups up to 8,192 cores. The proposed parallel scheme is simple and based on independent multi-walks with no communication between processes during search. We also investigated a cooperative multi-walk scheme where processes share simple information, but this scheme does not seem to improve performance

Large-Scale Parallelism for Constraint-Based Local Search: The Costas Array Case Study

Abstract We present the parallel implementation of a constraint-based Local Search algorithm and investigate its performance on several hardware platforms with several hundreds or thousands of cores. We chose as the basis for these experiments the Adaptive Search method, an efficient sequential Local Search method for Constraint Satisfaction Problems (CSP). After preliminary experiments on some CSPLib benchmarks, we detail the modeling and solving of a hard combinatorial problem related to radar and sonar applications: the Costas Array Problem. Performance evaluation on some classical CSP benchmarks shows that speedups are very good for a few tens of cores, and good up to a few hundreds of cores. However for a hard combinatorial search problem such as the Costas Array Problem, performance evaluation of the sequential version shows results outperforming previous Local Search implementations, while the parallel version shows nearly linear speedups up to 8,192 cores. The proposed parallel scheme is simple and based on independent multi-walks with no communication between processes during search. We also investigated a cooperative multi-walk scheme where processes share simple information, but this scheme does not seem to improve performance

3D mapping of nanoscale physical properties of VCSEL devices

There is clear lack of methods that allows studies of the nanoscale structure of the VCSEL devices1 that are mainly focused on the roughness of the DBR, or using FIB cross-sectioning and TEM analysis of failed devices to observe the mechanism of the degradation. Here we present a recently developed advanced approach that combines Ar-ion nano-cross-sectioning with material sensitive SPM2 to reveal the internal structure of the VCSEL across the whole stack of top and bottom DBR including active area. We report for the first time the direct observation of local mechanical properties, electric potential and conductance through the 3D VCSEL stack. In order to achieve this, we use beam exit cross-section polishing that creates an oblique section with sub-nm surface roughness through the whole VCSEL structure that is fully suitable for the subsequent cross-sectional SPM (xSPM) studies. We used three different SPM measurement modes – nanomechanical local elastic moduli mapping via Ultrasonic Force Microscopy (UFM) 3, surface potential mapping via Kelvin Probe Force Microscopy (KPFM) and mapping of injected current (local conductivity) via Scanning Spreading Resistance Microscopy (SSRM). xSPM allowed to observe the resulting geometry of the whole device, including active cavity multiple quantum wells (MQW), to obtain profiles of differential doping of the DBR stack, profile of electric potential in the active cavity, and spatial variation of current injection in the individual QW in MQW area. Moreover, by applying forward bias to the VCSEL to initiate laser emission, we were able to observe distribution of the potential in the working regime, paving the way to understanding the 3D current flow in the complete device. Finally, we use finite element modelling (FEM) that confirm the experimental results that of the measurements of the local doping profiles and charge distribution in the active area of the VCSEL around the oxide current confinement aperture. While we show that the new xSPM methodology allowed advanced in-situ studies of VCSELs, it establishes a highly efficient characterisation platform for much broader area of compound semiconductor materials and devices. REFERENCES. 1. D. T. Mathes, R. Hull, K. Choquette, K. Geib, A. Allerman, J. Guenter, B. Hawkins and B. Hawthorne, in Vertical-Cavity Surface-Emitting Lasers Vii, edited by C. Lei and S. P. Kilcoyne (2003), Vol. 4994, pp. 67-82. 2. A. J. Robson, I. Grishin, R. J. Young, A. M. Sanchez, O. V. Kolosov and M. Hayne, Acs Applied Materials & Interfaces 5 (8), 3241-3245 (2013). 3. J. L. Bosse, P. D. Tovee, B. D. Huey and O. V. Kolosov, Journal of Applied Physics 115 (14), 144304 (2014)

Mathematical Modelling of Energy Systems and Fluid Machinery

The ongoing digitalization of the energy sector, which will make a large amount of data available, should not be viewed as a passive ICT application for energy technology or a threat to thermodynamics and fluid dynamics, in the light of the competition triggered by data mining and machine learning techniques. These new technologies must be posed on solid bases for the representation of energy systems and fluid machinery. Therefore, mathematical modelling is still relevant and its importance cannot be underestimated. The aim of this Special Issue was to collect contributions about mathematical modelling of energy systems and fluid machinery in order to build and consolidate the base of this knowledge

Laboratory directed research and development. FY 1995 progress report

This document presents an overview of Laboratory Directed Research and Development Programs at Los Alamos. The nine technical disciplines in which research is described include materials, engineering and base technologies, plasma, fluids, and particle beams, chemistry, mathematics and computational science, atmic and molecular physics, geoscience, space science, and astrophysics, nuclear and particle physics, and biosciences. Brief descriptions are provided in the above programs