An Effective Group Key-based Secure Data Transfer in IoMT using Rossler Hyper Chaotic System with Modified Polar Bear Optimization

Abstract

Objectives: The main objective of this study is to improve the security of data transfer in Internet of Medical Things (IoMT) and also to minimize the processing time and memory size.

Methods: The group key, generated by dual encryption scheme(using AES and RSA algorithms), is optimized by proposed Modified Polar Bear Optimization (MPBO) algorithm and then it is used in Rossler Hyper Chaotic System (RHCS) method for medical data encryption and decryption in IoMT. Findings: The total processing times of an image and a signal for their secure transfer by using the proposed Modified Polar Bear Optimization-Rossler Hyper Chaotic System (MPBO-RHCS) are 16.717ms and 6.6593ms respectively. In this case, the memory size of an image and a signal, occupied during their secure transfer are 2.0586 x 10⁰⁷ bytes and 5.7639 x 10⁰⁷ bytes respectively. They are the least values of total processing time and memory size of an image when they are compared to other existing optimization algorithms viz. Arithmetic Optimization Algorithm (17.518ms, 3.8851 x 10⁰⁷bytes), Tunicate Swarm Algorithm (17.72ms, 3.0118 x 10⁰⁷bytes), Harris Hawks Optimizer (17.004ms, 2.5395 x 10⁰⁷bytes) and Polar Bear Optimization (17.297ms, 2.3478 x 10⁰⁷bytes). Similarly, total processing time and memory size of a signal for its secure transfer by using the proposed MPBO-RHCS method are the least values when they are compared to other existing optimization algorithms viz. Arithmetic Optimization Algorithm (7.5129ms, 9.7243 x 10⁰⁷bytes), Tunicate Swarm Algorithm (7.6142ms, 6.5892 x 10⁰⁷bytes), Harris Hawks Optimizer (6.9031ms, 6.1497 x 10⁰⁷bytes) and Polar Bear Optimization (7.0785ms, 6.2333 x 10⁰⁷bytes).

The total processing time and memory size of an image for its secure transfer by using the proposed MPBO-RHCS method have the least values (16.717ms, 2.0586 x 10⁰⁷bytes) when they are compared to other existing chaotic methods viz. Henon chaotic map (18.466ms, 2.8851 x 10⁰⁷bytes), Logistic chaotic map (17.693ms, 2.7210 x 10⁰⁷bytes), Arnold cat chaotic map (17.848ms, 3.0051 x 10⁰⁷bytes) and RHCS (17.97ms, 3.9003 x 10⁰⁷bytes). The total processing time and memory size of a signal for its secure transfer by using the proposed MPBO-RHCS method have the least values (6.6593ms, 5.7639 x 10⁰⁷bytes) when they are compared to other existing chaotic methods viz. Henon chaotic map (9.1488ms, 8.7243 x 10⁰⁷bytes), Logistic chaotic map (7.9677ms, 6.7639 x 10⁰⁷bytes), Arnold cat chaotic map (7.6088ms, 7.1497 x 10⁰⁷bytes) and RHCS (8.3185ms, 9.8333 x 10⁰⁷bytes).

Novelty: In the existing Polar Bear Optimization (PBO) algorithm, α is a random number in the interval [0, 1]. In the proposed MPBO, the random number α is modified by, where, β is a random number in the range [0, 1].  λ is a random value in the range [0, ω]. Here, ω is the distance between the two spatial coordinates, measured in Euclidean metric. The group key is optimized by using proposed MPBO. The initial parameters (x₀,y₀,z₀), generated after optimization are fed into the Rossler hyper chaotic system for encryption.