Dynamic block encryption with self-authenticating key exchange

One of the greatest challenges facing cryptographers is the mechanism used for key exchange. When secret data is transmitted, the chances are that there may be an attacker who will try to intercept and decrypt the message. Having done so, he/she might just gain advantage over the information obtained, or attempt to tamper with the message, and thus, misguiding the recipient. Both cases are equally fatal and may cause great harm as a consequence. In cryptography, there are two commonly used methods of exchanging secret keys between parties. In the first method, symmetric cryptography, the key is sent in advance, over some secure channel, which only the intended recipient can read. The second method of key sharing is by using a public key exchange method, where each party has a private and public key, a public key is shared and a private key is kept locally. In both cases, keys are exchanged between two parties. In this thesis, we propose a method whereby the risk of exchanging keys is minimised. The key is embedded in the encrypted text using a process that we call `chirp coding', and recovered by the recipient using a process that is based on correlation. The `chirp coding parameters' are exchanged between users by employing a USB flash memory retained by each user. If the keys are compromised they are still not usable because an attacker can only have access to part of the key. Alternatively, the software can be configured to operate in a one time parameter mode, in this mode, the parameters are agreed upon in advance. There is no parameter exchange during file transmission, except, of course, the key embedded in ciphertext. The thesis also introduces a method of encryption which utilises dynamic blocks, where the block size is different for each block. Prime numbers are used to drive two random number generators: a Linear Congruential Generator (LCG) which takes in the seed and initialises the system and a Blum-Blum Shum (BBS) generator which is used to generate random streams to encrypt messages, images or video clips for example. In each case, the key created is text dependent and therefore will change as each message is sent. The scheme presented in this research is composed of five basic modules. The first module is the key generation module, where the key to be generated is message dependent. The second module, encryption module, performs data encryption. The third module, key exchange module, embeds the key into the encrypted text. Once this is done, the message is transmitted and the recipient uses the key extraction module to retrieve the key and finally the decryption module is executed to decrypt the message and authenticate it. In addition, the message may be compressed before encryption and decompressed by the recipient after decryption using standard compression tools

Cognitive computation of compressed sensing for watermark signal measurement

As an important tool for protecting multimedia contents, scrambling and randomizing of original messages is used in generating digital watermark for satisfying security requirements. Based on the neural perception of high-dimensional data, compressed sensing (CS) is proposed as a new technique in watermarking for improved security and reduced computational complexity. In our proposed methodology, watermark signal is extracted from the CS of the Hadamard measurement matrix. Through construction of the scrambled block Hadamard matrix utilizing a cryptographic key, encrypting the watermark signal in CS domain is achieved without any additional computation required. The extensive experiments have shown that the neural inspired CS mechanism can generate watermark signal of higher security, yet it still maintains a better trade-off between transparency and robustness

Digital watermarking methods for data security and authentication

Philosophiae Doctor - PhDCryptology is the study of systems that typically originate from a consideration of the ideal circumstances under which secure information exchange is to take place. It involves the study of cryptographic and other processes that might be introduced for breaking the output of such systems - cryptanalysis. This includes the introduction of formal mathematical methods for the design of a cryptosystem and for estimating its theoretical level of securit

Symmetry-Adapted Machine Learning for Information Security

Symmetry-adapted machine learning has shown encouraging ability to mitigate the security risks in information and communication technology (ICT) systems. It is a subset of artificial intelligence (AI) that relies on the principles of processing future events by learning past events or historical data. The autonomous nature of symmetry-adapted machine learning supports effective data processing and analysis for security detection in ICT systems without the interference of human authorities. Many industries are developing machine-learning-adapted solutions to support security for smart hardware, distributed computing, and the cloud. In our Special Issue book, we focus on the deployment of symmetry-adapted machine learning for information security in various application areas. This security approach can support effective methods to handle the dynamic nature of security attacks by extraction and analysis of data to identify hidden patterns of data. The main topics of this Issue include malware classification, an intrusion detection system, image watermarking, color image watermarking, battlefield target aggregation behavior recognition model, IP camera, Internet of Things (IoT) security, service function chain, indoor positioning system, and crypto-analysis

Data Hiding and Its Applications

Data hiding techniques have been widely used to provide copyright protection, data integrity, covert communication, non-repudiation, and authentication, among other applications. In the context of the increased dissemination and distribution of multimedia content over the internet, data hiding methods, such as digital watermarking and steganography, are becoming increasingly relevant in providing multimedia security. The goal of this book is to focus on the improvement of data hiding algorithms and their different applications (both traditional and emerging), bringing together researchers and practitioners from different research fields, including data hiding, signal processing, cryptography, and information theory, among others

Digital Image Processing

Newspapers and the popular scientific press today publish many examples of highly impressive images. These images range, for example, from those showing regions of star birth in the distant Universe to the extent of the stratospheric ozone depletion over Antarctica in springtime, and to those regions of the human brain affected by Alzheimer’s disease. Processed digitally to generate spectacular images, often in false colour, they all make an immediate and deep impact on the viewer’s imagination and understanding. Professor Jonathan Blackledge’s erudite but very useful new treatise Digital Image Processing: Mathematical and Computational Methods explains both the underlying theory and the techniques used to produce such images in considerable detail. It also provides many valuable example problems - and their solutions - so that the reader can test his/her grasp of the physical, mathematical and numerical aspects of the particular topics and methods discussed. As such, this magnum opus complements the author’s earlier work Digital Signal Processing. Both books are a wonderful resource for students who wish to make their careers in this fascinating and rapidly developing field which has an ever increasing number of areas of application. The strengths of this large book lie in: • excellent explanatory introduction to the subject; • thorough treatment of the theoretical foundations, dealing with both electromagnetic and acoustic wave scattering and allied techniques; • comprehensive discussion of all the basic principles, the mathematical transforms (e.g. the Fourier and Radon transforms), their interrelationships and, in particular, Born scattering theory and its application to imaging systems modelling; discussion in detail - including the assumptions and limitations - of optical imaging, seismic imaging, medical imaging (using ultrasound), X-ray computer aided tomography, tomography when the wavelength of the probing radiation is of the same order as the dimensions of the scatterer, Synthetic Aperture Radar (airborne or spaceborne), digital watermarking and holography; detail devoted to the methods of implementation of the analytical schemes in various case studies and also as numerical packages (especially in C/C++); • coverage of deconvolution, de-blurring (or sharpening) an image, maximum entropy techniques, Bayesian estimators, techniques for enhancing the dynamic range of an image, methods of filtering images and techniques for noise reduction; • discussion of thresholding, techniques for detecting edges in an image and for contrast stretching, stochastic scattering (random walk models) and models for characterizing an image statistically; • investigation of fractal images, fractal dimension segmentation, image texture, the coding and storing of large quantities of data, and image compression such as JPEG; • valuable summary of the important results obtained in each Chapter given at its end; • suggestions for further reading at the end of each Chapter. I warmly commend this text to all readers, and trust that they will find it to be invaluable. Professor Michael J Rycroft Visiting Professor at the International Space University, Strasbourg, France, and at Cranfield University, England

Advanced signal processing tools for ballistic missile defence and space situational awareness

The research presented in this Thesis deals with signal processing algorithms for the classification of sensitive targets for defence applications and with novel solutions for the detection of space objects. These novel tools include classification algorithms for Ballistic Targets (BTs) from both micro-Doppler (mD) and High Resolution Range Profiles (HRRPs) of a target, and a space-borne Passive Bistatic Radar (PBR) designed for exploiting the advantages guaranteed by the Forward Scattering (FS) configuration for the detection and identification of targets orbiting around the Earth.;Nowadays the challenge of the identification of Ballistic Missile (BM) warheads in a cloud of decoys and debris is essential in order to optimize the use of ammunition resources. In this Thesis, two different and efficient robust frameworks are presented. Both the frameworks exploit in different fashions the effect in the radar return of micro-motions exhibited by the target during its flight.;The first algorithm analyses the radar echo from the target in the time-frequency domain, with the aim to extract the mD information. Specifically, the Cadence Velocity Diagram (CVD) from the received signal is evaluated as mD profile of the target, where the mD components composing the radar echo and their repetition rates are shown.;Different feature extraction approaches are proposed based on the estimation of statistical indices from the 1-Dimensional (1D) Averaged CVD (ACVD), on the evaluation of pseudo-Zerike (pZ) and Krawtchouk (Kr) image moments and on the use of 2-Dimensional (2D) Gabor filter, considering the CVD as 2D image. The reliability of the proposed feature extraction approaches is tested on both simulated and real data, demonstrating the adaptivity of the framework to different radar scenarios and to different amount of available resources.;The real data are realized in laboratory, conducting an experiment for simulating the mD signature of a BT by using scaled replicas of the targets, a robotic manipulator for the micro-motions simulation and a Continuous Waveform (CW) radar for the radar measurements.;The second algorithm is based on the computation of the Inverse Radon Transform (IRT) of the target signature, represented by a HRRP frame acquired within an entire period of the main rotating motion of the target, which are precession for warheads and tumbling for decoys. Following, pZ moments of the resulting transformation are evaluated as final feature vector for the classifier. The features guarantee robustness against the target dimensions and the initial phase and the angular velocity of its motion.;The classification results on simulated data are shown for different polarization of the ElectroMagnetic (EM) radar waveform and for various operational conditions, confirming the the validity of the algorithm.The knowledge of space debris population is of fundamental importance for the safety of both the existing and new space missions. In this Thesis, a low budget solution to detect and possibly track space debris and satellites in Low Earth Orbit (LEO) is proposed.;The concept consists in a space-borne PBR installed on a CubeSaT flying at low altitude and detecting the occultations of radio signals coming from existing satellites flying at higher altitudes. The feasibility of such a PBR system is conducted, with key performance such as metrics the minimumsize of detectable objects, taking into account visibility and frequency constraints on existing radio sources, the receiver size and the compatibility with current CubeSaT's technology.;Different illuminator types and receiver altitudes are considered under the assumption that all illuminators and receivers are on circular orbits. Finally, the designed system can represent a possible solution to the the demand for Ballistic Missile Defence (BMD) systems able to provide early warning and classification and its potential has been assessed also for this purpose.The research presented in this Thesis deals with signal processing algorithms for the classification of sensitive targets for defence applications and with novel solutions for the detection of space objects. These novel tools include classification algorithms for Ballistic Targets (BTs) from both micro-Doppler (mD) and High Resolution Range Profiles (HRRPs) of a target, and a space-borne Passive Bistatic Radar (PBR) designed for exploiting the advantages guaranteed by the Forward Scattering (FS) configuration for the detection and identification of targets orbiting around the Earth.;Nowadays the challenge of the identification of Ballistic Missile (BM) warheads in a cloud of decoys and debris is essential in order to optimize the use of ammunition resources. In this Thesis, two different and efficient robust frameworks are presented. Both the frameworks exploit in different fashions the effect in the radar return of micro-motions exhibited by the target during its flight.;The first algorithm analyses the radar echo from the target in the time-frequency domain, with the aim to extract the mD information. Specifically, the Cadence Velocity Diagram (CVD) from the received signal is evaluated as mD profile of the target, where the mD components composing the radar echo and their repetition rates are shown.;Different feature extraction approaches are proposed based on the estimation of statistical indices from the 1-Dimensional (1D) Averaged CVD (ACVD), on the evaluation of pseudo-Zerike (pZ) and Krawtchouk (Kr) image moments and on the use of 2-Dimensional (2D) Gabor filter, considering the CVD as 2D image. The reliability of the proposed feature extraction approaches is tested on both simulated and real data, demonstrating the adaptivity of the framework to different radar scenarios and to different amount of available resources.;The real data are realized in laboratory, conducting an experiment for simulating the mD signature of a BT by using scaled replicas of the targets, a robotic manipulator for the micro-motions simulation and a Continuous Waveform (CW) radar for the radar measurements.;The second algorithm is based on the computation of the Inverse Radon Transform (IRT) of the target signature, represented by a HRRP frame acquired within an entire period of the main rotating motion of the target, which are precession for warheads and tumbling for decoys. Following, pZ moments of the resulting transformation are evaluated as final feature vector for the classifier. The features guarantee robustness against the target dimensions and the initial phase and the angular velocity of its motion.;The classification results on simulated data are shown for different polarization of the ElectroMagnetic (EM) radar waveform and for various operational conditions, confirming the the validity of the algorithm.The knowledge of space debris population is of fundamental importance for the safety of both the existing and new space missions. In this Thesis, a low budget solution to detect and possibly track space debris and satellites in Low Earth Orbit (LEO) is proposed.;The concept consists in a space-borne PBR installed on a CubeSaT flying at low altitude and detecting the occultations of radio signals coming from existing satellites flying at higher altitudes. The feasibility of such a PBR system is conducted, with key performance such as metrics the minimumsize of detectable objects, taking into account visibility and frequency constraints on existing radio sources, the receiver size and the compatibility with current CubeSaT's technology.;Different illuminator types and receiver altitudes are considered under the assumption that all illuminators and receivers are on circular orbits. Finally, the designed system can represent a possible solution to the the demand for Ballistic Missile Defence (BMD) systems able to provide early warning and classification and its potential has been assessed also for this purpose

Digital Signal Processing (Second Edition)

This book provides an account of the mathematical background, computational methods and software engineering associated with digital signal processing. The aim has been to provide the reader with the mathematical methods required for signal analysis which are then used to develop models and algorithms for processing digital signals and finally to encourage the reader to design software solutions for Digital Signal Processing (DSP). In this way, the reader is invited to develop a small DSP library that can then be expanded further with a focus on his/her research interests and applications. There are of course many excellent books and software systems available on this subject area. However, in many of these publications, the relationship between the mathematical methods associated with signal analysis and the software available for processing data is not always clear. Either the publications concentrate on mathematical aspects that are not focused on practical programming solutions or elaborate on the software development of solutions in terms of working ‘black-boxes’ without covering the mathematical background and analysis associated with the design of these software solutions. Thus, this book has been written with the aim of giving the reader a technical overview of the mathematics and software associated with the ‘art’ of developing numerical algorithms and designing software solutions for DSP, all of which is built on firm mathematical foundations. For this reason, the work is, by necessity, rather lengthy and covers a wide range of subjects compounded in four principal parts. Part I provides the mathematical background for the analysis of signals, Part II considers the computational techniques (principally those associated with linear algebra and the linear eigenvalue problem) required for array processing and associated analysis (error analysis for example). Part III introduces the reader to the essential elements of software engineering using the C programming language, tailored to those features that are used for developing C functions or modules for building a DSP library. The material associated with parts I, II and III is then used to build up a DSP system by defining a number of ‘problems’ and then addressing the solutions in terms of presenting an appropriate mathematical model, undertaking the necessary analysis, developing an appropriate algorithm and then coding the solution in C. This material forms the basis for part IV of this work. In most chapters, a series of tutorial problems is given for the reader to attempt with answers provided in Appendix A. These problems include theoretical, computational and programming exercises. Part II of this work is relatively long and arguably contains too much material on the computational methods for linear algebra. However, this material and the complementary material on vector and matrix norms forms the computational basis for many methods of digital signal processing. Moreover, this important and widely researched subject area forms the foundations, not only of digital signal processing and control engineering for example, but also of numerical analysis in general. The material presented in this book is based on the lecture notes and supplementary material developed by the author for an advanced Masters course ‘Digital Signal Processing’ which was first established at Cranfield University, Bedford in 1990 and modified when the author moved to De Montfort University, Leicester in 1994. The programmes are still operating at these universities and the material has been used by some 700++ graduates since its establishment and development in the early 1990s. The material was enhanced and developed further when the author moved to the Department of Electronic and Electrical Engineering at Loughborough University in 2003 and now forms part of the Department’s post-graduate programmes in Communication Systems Engineering. The original Masters programme included a taught component covering a period of six months based on two semesters, each Semester being composed of four modules. The material in this work covers the first Semester and its four parts reflect the four modules delivered. The material delivered in the second Semester is published as a companion volume to this work entitled Digital Image Processing, Horwood Publishing, 2005 which covers the mathematical modelling of imaging systems and the techniques that have been developed to process and analyse the data such systems provide. Since the publication of the first edition of this work in 2003, a number of minor changes and some additions have been made. The material on programming and software engineering in Chapters 11 and 12 has been extended. This includes some additions and further solved and supplementary questions which are included throughout the text. Nevertheless, it is worth pointing out, that while every effort has been made by the author and publisher to provide a work that is error free, it is inevitable that typing errors and various ‘bugs’ will occur. If so, and in particular, if the reader starts to suffer from a lack of comprehension over certain aspects of the material (due to errors or otherwise) then he/she should not assume that there is something wrong with themselves, but with the author