Muhammad Rezal Kamel Ariffin

Can complexity decrease in congestive heart failure

The complexity of a signal can be measured by the Recurrence period density entropy (RPDE) from the reconstructed phase space. We have chosen a window based RPDE method for the classification of signals, as RPDE is an average entropic measure of the whole phase space. We have observed the changes in the complexity in cardiac signals of normal healthy person (NHP) and congestive heart failure patients (CHFP). The results show that the cardiac dynamics of a healthy subject is more complex and random compare to the same for a heart failure patient, whose dynamics is more deterministic. We have constructed a general threshold to distinguish the border line between a healthy and a congestive heart failure dynamics. The results may be useful for wide range for physiological and biomedical analysis.

Passive video forgery detection techniques: A survey

Technological advancement of various video and image processing tools has made tempering of digital video easy and faster. This review paper focuses on passive techniques that are employed for detecting forgeries in a digital video. Passive forgery detection techniques are methods used for detecting the authenticity of a video without depending on pre-embedded information. The techniques exploit the use of statistical or mathematical properties that are distorted as a result of video tempering for forgery detection. Passive video forgery detection approach has a great prospect in multimedia security, information security and pattern recognition. In this paper, we divide passive techniques for video forensics into three categories; Statistical correlation of video features, frame-based for detecting statistical anomalies, and the inconsistency features of different digital equipment. The discussion also covers the trends, limitations and idea for improvements of passive forgery detection techniques.

Complexity in congestive heart failure: A time-frequency approach

Reconstruction of phase space is an effective method to quantify the dynamics of a signal or a time series. Various phase space reconstruction techniques have been investigated. However, there are some issues on the optimal reconstructions and the best possible choice of the reconstruction parameters. This research introduces the idea of gradient cross recurrence (GCR) and mean gradient cross recurrence density which shows that reconstructions in time frequency domain preserve more information about the dynamics than the optimal reconstructions in time domain. This analysis is further extended to ECG signals of normal and congestive heart failure patients. By using another newly introduced measure-gradient cross recurrence period density entropy, two classes of aforesaid ECG signals can be classified with a proper threshold. This analysis can be applied to quantifying and distinguishing biomedical and other nonlinear signals.

Symmetric Encryption Algorithm Inspired by Randomness and Non-Linearity of Immune Systems

In data encryption, the security of the algorithm is measured based on Shannon’s confusion and diffusion properties. This paper identifies the correspondences and highlights the essential computation elements on the basis of randomness and non-linearity of immune systems. These systems can be applied in symmetric encryption algorithm that satisfies the properties in designing a new symmetric encryption block cipher. The proposed symmetric encryption block cipher called the 3D-AES uses components of the Advanced Encryption Standard (AES) symmetric encryption block cipher and the new core components based on immune systems approaches. To ensure adequate high security of the systems in the world of information technology, the laboratory experiment results are presented and analyzed. They show that the randomness and non-linearity of the output in the 3D-AES symmetric encryption block cipher are comparable to the AES symmetric encryption block cipher.

Immune Systems Approaches for Cryptographic Algorithm

This paper proposed immune-inspired approaches in designing a new function for cryptographic algorithm named as 3D-AES. The immune systems approaches were selected on the basis of complex features that are desirable for substitution and permutation process to ensure adequate security and confidentiality of the systems in the world of information technology. This paper will identify the correspondences and highlight essential computation elements that can be applied in cryptographic algorithm that satisfies with Shannons confusion and diffusion properties. The 3D-AES uses components in Advanced Encryption Standard(AES) algorithm and new core components based on immune systems approaches. Cryptographic strength in the context of this paper is related to the ability of the algorithm to produce a random output. The empirical findings are presented and identified that the randomness of the output in the 3D-AES algorithm are comparable with AES algorithm.

New attacks on RSA with modulus N = p2q using continued fractions

In this paper, we propose two new attacks on RSA with modulus N = p2q using continued fractions. Our first attack is based on the RSA key equation ed – (N)k = 1 where (N) = p(p – 1)(q – 1). Assuming that and , we show that can be recovered among the convergents of the continued fraction expansion of . Our second attack is based on the equation eX – (N – (ap2 + bq2)) Y = Z where a,b are positive integers satisfying gcd(a,b) = 1, |ap2 – bq2| < N1/2 and ap2 + bq2 = N2/3+α with 0 < α < 1/3. Given the conditions , we show that one can factor N = p2q in polynomial time.

Computing two dimensional Poincar maps for hyperchaotic dynamics

Poincar map (PM) is one of the felicitous discrete approximation of the continuous dynamics. To compute PM, the discrete relation(s) between the successive point of interactions of the trajectories on the suitable Poincar section (PS) are found out. These discrete relations act as an amanuensis of the nature of the continuous dynamics. In this article, we propose a computational scheme to find a hyperchaotic PM (HPM) from an equivalent three dimensional (3D) subsystem of a 4D (or higher) hyperchaotic model. For the experimental purpose, a standard four dimensional (4D) hyperchaotic Lorenz-Stenflo system (HLSS) and a five dimensional (5D) hyperchaotic laser model (HLM) is considered. Equivalent 3D subsystem is obtained by comparing the movements of the trajectories of the original hyperchaotic systems with all of their 3D subsystems. The quantitative measurement of this comparison is made promising by recurrence quantification analysis (RQA). Various two dimensional (2D) Poincar mas are computed for several suitable Poincar sections for both the systems. But, only some of them are hyperchaotic in nature. The hyperchaotic behavior is verified by positive values of both one dimensional (1D) Lyapunov Exponent (LE-I) and 2D Lyapunov Exponent (LE-II). At the end, similarity of the dynamics between the hyperchaotic systems and their 2D hyperchaotic Poincar maps (HPM) has been established through mean recurrence time (MRT) statistics for both of 4D HLSS and 5D HLM and the best approximated discrete dynamics for both the hyperchaotic systems are found out.

New Attacks on the RSA Cryptosystem

This paper presents three new attacks on the RSA cryptosystem. The first two attacks work when k RSA public keys (N i ,e i ) are such that there exist k relations of the shape e i x − y i φ(N i ) = z i or of the shape e i x i − yφ(N i ) = z i where N i = p i q i , φ(N i ) = (p i − 1)(q i − 1) and the parameters x, x i , y, y i , z i are suitably small in terms of the prime factors of the moduli. We show that our attacks enable us to simultaneously factor the k RSA moduli N i . The third attack works when the prime factors p and q of the modulus N = pq share an amount of their least significant bits (LSBs) in the presence of two decryption exponents d 1 and d 2 sharing an amount of their most significant bits (MSBs). The three attacks improve the bounds of some former attacks that make RSA insecure.

Phase synchronization of instrumental music signals

Abstract Signal analysis is one of the finest scientific techniques in communication theory. Some quantitative and qualitative measures describe the pattern of a music signal, vary from one to another. Same musical recital, when played by different instrumentalists, generates different types of music patterns. The reason behind various patterns is the psycho-acoustic measures – Dynamics, Timber, Tonality and Rhythm, varies in each time. However, the psycho-acoustic study of the music signals does not reveal any idea about the similarity between the signals. For such cases, study of synchronization of long-term nonlinear dynamics may provide effective results. In this context, phase synchronization (PS) is one of the measures to show synchronization between two non-identical signals. In fact, it is very critical to investigate any other kind of synchronization for experimental condition, because those are completely non identical signals. Also, there exists equivalence between the phases and the distances of the diagonal line in Recurrence plot (RP) of the signals, which is quantifiable by the recurrence quantification measure τ-recurrence rate. This paper considers two nonlinear music signals based on same raga played by two eminent sitar instrumentalists as two non-identical sources. The psycho-acoustic study shows how the Dynamics, Timber, Tonality and Rhythm vary for the two music signals. Then, long term analysis in the form of phase space reconstruction is performed, which reveals the chaotic phase spaces for both the signals. From the RP of both the phase spaces, τ-recurrence rate is calculated. Finally by the correlation of normalized tau-recurrence rate of their 3D phase spaces and the PS of the two music signals has been established. The numerical results well support the analysis.

A New Direction in Utilization of Chaotic Fractal Functions for Cryptosystems

Ever since Baptista in 1998 introduced his cryptographic scheme utilizing the only in online version. ergodic property of chaotic maps which is able to produce different cipher values for the same plaintext within the same message, intense scrutiny has been given upon the design. The capability to do the above mentioned output is akin to the Vigenere cipher and thus has the capacity to render an attacker with infinitely many choices (theoretically speaking) or in cryptographic terms would render an attacker to have a set off possible ciphertexts that could all have the possibility to just be mapped to a unique plaintext. This makes it computationally infeasible for the attacker to re-construct the correct plaintext. The Baptista design has been attacked and repaired many times. Alvarez noticed the characteristic of the cryptosystem that generates a sequence which can be exploited by an attacker. The attack which is dubbed the one-time pad attack is akin to an attack upon a One-Time-Pad (OTP) cryptosystem that reuses its key. Since then, attempts were made to redefine the cryptosystem such that it would be resistant towards the attack. Most of the attempts failed due to either the repaired cryptosystem still generates an exploitable sequence or it is not invertible. In this work we pair the Baptista design with a concept taken from the Iterated Function Systems (IFS). Although we did not encompass the whole concept of iterating the IFS, it could be seen that this could be easily done with the same desirable results. Four main outcomes are discussed. Beginning with the discussion on the infeasibility of Alvarez’s one-time pad attack on the design, we then discuss the quantitative properties of the design in discussing its cryptographic properties namely the Maximum Deviation Factor (MDF), Correlation Coefficient Factor (CCF) and the Strict Avalanche Criterion (SAC). Each experimental result shows promising results for this new design.