A novel Double Tier Cryptographic System (nDTCS) to Reinforce Patients’ Privacy in Contemporary COVID-19 Telemedicine

In this modern COVID-19 telemedicine industry, privacy and security of patients’ information is the most open challenge to keep it intact. Considering the current legal regulations, every hospital must impose a prominent security technique to maintain a secure electronic health records system. The realization of telemedicine is another notable advancement in the field of medical sciences. The healthcare services have increased its throughput with the help of Internet based computing. Recently, security flaws on patient’s information have become a more significant challenge in electronic healthcare system. Electronics health record i.e. collection of health related patients’ information are extremely sensitive in nature. So, it is very relevant to impose an advanced security techniques in such systems. Here, we have focused on security issues likes of technical safeguards. A novel Double Tier Cryptographic System (nDTCS) have been proposed here. We had proposed a modified logistic map and linear congruence based security model for the secured telemedicine transactions with an authentication technique. For encryption and decryption purpose, two keys have been used which were intermediate key, and session key. The modified logistic map and secret sharing were the backbone of the proposed technique. This new approach of key generation provides newness as well as extra robustness in our proposed technique. The chaotic sequences in the ranges of I and n on the initial values , and t respectively were noted under this technique test. 264, 2256, 21024, 24096, 216384hand 265536 were the possibilities of combined key space volumes. The different types of mathematical experiments like randomness test, brute force, histogram analysis and their obtained results have guided that it is very secured and efficient for patients’ data transmission in health sectors.

A Two-Parameter Modified Logistic Map and Its Application to Random Bit Generation

This work proposes a modified logistic map based on the system previously proposed by Han in 2019. The constructed map exhibits interesting chaos related phenomena like antimonotonicity, crisis, and coexisting attractors. In addition, the Lyapunov exponent of the map can achieve higher values, so the behavior of the proposed map is overall more complex compared to the original. The map is then successfully applied to the problem of random bit generation using techniques like the comparison between maps, X O R , and bit reversal. The proposed algorithm passes all the NIST tests, shows good correlation characteristics, and has a high key space.

An Inverse Pheromone Approach in a Chaotic Mobile Robot’s Path Planning Based on a Modified Logistic Map

One major topic in the research of path planning of autonomous mobile robots is the fast and efficient coverage of a given terrain. For this purpose, an efficient method for covering a given workspace is proposed, based on chaotic path planning. The method is based on a chaotic pseudo random bit generator that is generated using a modified logistic map, which is used to generate a chaotic motion pattern. This is then combined with an inverse pheromone approach in order to reduce the number of revisits in each cell. The simulated robot under study has the capability to move in four or eight directions. From extensive simulations performed in Matlab, it is derived that motion in eight directions gives superior results. Especially, with the inclusion of pheromone, the coverage percentage can significantly be increased, leading to better performance.

Efficient error correcting scheme for chaos shift keying signals

An effective error-correction scheme based on normalized correlation for a non coherent chaos communication system with no redundancy bits is proposed in this paper. A modified logistic map is used in the proposed scheme for generating two sequences, one for every data bit value, in a manner that the initial value of the next chaotic sequence is set by the second value of the present chaotic sequence of the similar symbol. This arrangement, thus, has the creation of successive chaotic sequences with identical chaotic dynamics for error correction purpose. The detection symbol is performed prior to correction, on the basis of the suboptimal receiver which anchors on the computation of the shortest distance existing between the received sequence and the modified logistic map’s chaotic trajectory. The results of the simulation reveal noticeable Eb/No improvement by the proposed scheme over the prior to the error- correcting scheme with the improvement increasing whenever there is increase in the number of sequence N. Prior to the error-correcting scheme when N=8, a gain of 1.3 dB is accomplished in E_b/N_o at 10^-3bit error probability. On the basis of normalized correlation, the most efficient point in our proposed error correction scheme is the absence of any redundant bits needed with minimum delay procedure, in contrast to earlier method that was based on suboptimal method detection and correction. Such performance would render the scheme good candidate for applications requiring high rates of data transmission.