Adaptive Chaotic Maps in Cryptography Applications

Chaotic cryptography is a promising area for the safe and fast transmission, processing, and storage of data. However, many developed chaos-based cryptographic primitives do not meet the size and composition of the keyspace and computational complexity. Another common problem of such algorithms is dynamic degradation caused by computer simulation with finite data representation and rounding of results of arithmetic operations. The known approaches to solving these problems are not universal, and it is difficult to extend them to many chaotic systems. This chapter describes discrete maps with adaptive symmetry, making it possible to overcome several disadvantages of existing chaos-based cryptographic algorithms simultaneously. The property of adaptive symmetry allows stretching, compressing, and rotating the phase space of such maps without significantly changing the bifurcation properties. Therefore, the synthesis of one-way piecewise functions based on adaptive maps with different symmetry coefficients supposes flexible control of the keyspace size and avoidance of dynamic degradation due to the embedded technique of perturbing the chaotic trajectory

On the Application of PSpice for Localised Cloud Security

The work reported in this thesis commenced with a review of methods for creating random binary sequences for encoding data locally by the client before storing in the Cloud. The first method reviewed investigated evolutionary computing software which generated noise-producing functions from natural noise, a highly-speculative novel idea since noise is stochastic. Nevertheless, a function was created which generated noise to seed chaos oscillators which produced random binary sequences and this research led to a circuit-based one-time pad key chaos encoder for encrypting data. Circuit-based delay chaos oscillators, initialised with sampled electronic noise, were simulated in a linear circuit simulator called PSpice. Many simulation problems were encountered because of the nonlinear nature of chaos but were solved by creating new simulation parts, tools and simulation paradigms. Simulation data from a range of chaos sources was exported and analysed using Lyapunov analysis and identified two sources which produced one-time pad sequences with maximum entropy. This led to an encoding system which generated unlimited, infinitely-long period, unique random one-time pad encryption keys for plaintext data length matching. The keys were studied for maximum entropy and passed a suite of stringent internationally-accepted statistical tests for randomness. A prototype containing two delay chaos sources initialised by electronic noise was produced on a double-sided printed circuit board and produced more than 200 Mbits of OTPs. According to Vladimir Kotelnikov in 1941 and Claude Shannon in 1945, one-time pad sequences are theoretically-perfect and unbreakable, provided specific rules are adhered to. Two other techniques for generating random binary sequences were researched; a new circuit element, memristance was incorporated in a Chua chaos oscillator, and a fractional-order Lorenz chaos system with order less than three. Quantum computing will present many problems to cryptographic system security when existing systems are upgraded in the near future. The only existing encoding system that will resist cryptanalysis by this system is the unconditionally-secure one-time pad encryption

Analysis and Design Security Primitives Based on Chaotic Systems for eCommerce

Security is considered the most important requirement for the success of electronic commerce, which is built based on the security of hash functions, encryption algorithms and pseudorandom number generators. Chaotic systems and security algorithms have similar properties including sensitivity to any change or changes in the initial parameters, unpredictability, deterministic nature and random-like behaviour. Several security algorithms based on chaotic systems have been proposed; unfortunately some of them were found to be insecure and/or slow. In view of this, designing new secure and fast security algorithms based on chaotic systems which guarantee integrity, authentication and confidentiality is essential for electronic commerce development. In this thesis, we comprehensively explore the analysis and design of security primitives based on chaotic systems for electronic commerce: hash functions, encryption algorithms and pseudorandom number generators. Novel hash functions, encryption algorithms and pseudorandom number generators based on chaotic systems for electronic commerce are proposed. The securities of the proposed algorithms are analyzed based on some well-know statistical tests in this filed. In addition, a new one-dimensional triangle-chaotic map (TCM) with perfect chaotic behaviour is presented. We have compared the proposed chaos-based hash functions, block cipher and pseudorandom number generator with well-know algorithms. The comparison results show that the proposed algorithms are better than some other existing algorithms. Several analyses and computer simulations are performed on the proposed algorithms to verify their characteristics, confirming that these proposed algorithms satisfy the characteristics and conditions of security algorithms. The proposed algorithms in this thesis are high-potential for adoption in e-commerce applications and protocols

Biological Networks

Networks of coordinated interactions among biological entities govern a myriad of biological functions that span a wide range of both length and time scales—from ecosystems to individual cells and from years to milliseconds. For these networks, the concept “the whole is greater than the sum of its parts” applies as a norm rather than an exception. Meanwhile, continued advances in molecular biology and high-throughput technology have enabled a broad and systematic interrogation of whole-cell networks, allowing the investigation of biological processes and functions at unprecedented breadth and resolution—even down to the single-cell level. The explosion of biological data, especially molecular-level intracellular data, necessitates new paradigms for unraveling the complexity of biological networks and for understanding how biological functions emerge from such networks. These paradigms introduce new challenges related to the analysis of networks in which quantitative approaches such as machine learning and mathematical modeling play an indispensable role. The Special Issue on “Biological Networks” showcases advances in the development and application of in silico network modeling and analysis of biological systems

Long-Term Quantitative Microscopy: From Microbial Population Dynamics to Growth of Plant Roots

Quantitative optical measurements at the micron scale have been crucial to the study of multiple biological processes, including bacterial chemotaxis, eukaryotic gene expression and y development. Extending measurements to long time scales allows complete observation of processes that are otherwise studied piecemeal, such as development and evolution. This thesis describes the development of two types of microscope for making long term, quantitative measurements, and the tools for image analysis. The rst device is a digital holographic microscope for measuring microbial population dynamics. It allows three dimensional localization of hundreds of cells within a mm3 sized volume, at micron resolution and an acquisition period of minutes. The technique is simple and inexpensive, which enabled us to construct ten replicate devices for parallel measurements. Each device incorporates precise and programmable control of light and temperature for the microbial ecosystem. Experiments were performed with the green algae Chlamydomonas reinhardtii and the ciliate Tetrahymena reinhardtii, both together and in isolation, and continued for as long as 90 days. The population dynamics exhibited a striking degree of repeatability, despite the presence of added noise in the illumination, spatial gradients of cell density, convection currents and phenotypic changes of both species. The second device is a thin light sheet fluorescence microscope for tracking nuclei in growing roots of the flowering plant Arabidopsis thaliana. The device incorporates a chamber designed to maintain optical quality while providing conditions for root growth. Optical feedback to a translation stage is used to maintain the root tip in the fi eld of view as the root grows by centimeters over several days. Data from a three day experiment is presented to demonstrate the technique. Over 1,000 nuclei were tracked simultaneously, and hundreds of cell divisions were automatically identif ed. The device was also used to image the regeneration of a root tip after surgical excision. The data corroborate earlier investigations at a more detailed level than was previously possible

CIRA annual report FY 2016/2017

Reporting period April 1, 2016-March 31, 2017