TSAFACK Nestor

Ms. TSAFACK Nestor

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2020 in Information Sciences
Verified
Journal Article
Closed access
TNTSAFACK Nestor
TSAFACK Nestor
JKJacques Kengne
Jacques Kengne
Bassem Abd-El-AttyBassem Abd-El-Atty
Bassem Abd-El-Atty
Abdullah Iliyasu (aka Abdul M. Elias)Abdullah Iliyasu (aka Abdul M. Elias)
Abdullah Iliyasu (aka Abdul M. Elias)
KHKaoru Hirota
Kaoru Hirota
AEAhmed A. Abd El-Latif
Ahmed A. Abd El-Latif

21 July 2020 in IEEE Access
Verified
Journal Article
Open access
TNTSAFACK Nestor
TSAFACK Nestor
Syam SankarSyam Sankar
Syam Sankar
Bassem Abd-El-AttyBassem Abd-El-Atty
Bassem Abd-El-Atty
JKJacques Kengne
Jacques Kengne
JCJithin K. C.
Jithin K. C.
AEAhmed Abd El-Latif
Ahmed Abd El-Latif
In this paper, we report an effective cryptosystem aimed at securing the transmission of medical images in an Internet of Healthcare Things (IoHT) environment. This contribution investigates the dynamics of a 2-D trigonometric map designed using some well-known maps: Logistic-sine-cosine maps. Stability analysis reveals that the map has an infinite number of solutions. Lyapunov exponent, bifurcation diagram, and phase portrait are used to demonstrate the complex dynamic of the map. The sequences of the map are utilized to construct a robust cryptosystem. First, three sets of key streams are generated from the newly designed trigonometric map and are used jointly with the image components (R, G, B) for hamming distance calculation. The output distance-vector, corresponding to each component, is then Bit-XORed with each of the key streams. The output is saved for further processing. The decomposed components are again Bit-XORed with key streams to produce an output, which is then fed into the conditional shift algorithm. The Mandelbrot Set is used as the input to the conditional shift algorithm so that the algorithm efficiently applies confusion operation (complete shuffling of pixels). The resultant shuffled vectors are then Bit-XORed (Diffusion) with the saved outputs from the early stage, and eventually, the image vectors are combined to produce the encrypted image. Performance analyses of the proposed cryptosystem indicate high security and can be effectively incorporated in an IoHT framework for secure medical image transmission.

1 February 2018 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
QLQiang Lai
Qiang Lai
TNTSAFACK Nestor
TSAFACK Nestor
JKJacques Kengne
Jacques Kengne
XZXiao-Wen Zhao
Xiao-Wen Zhao

21 December 2019 in Sensors
Verified
Journal Article
Open access
PDF file
TNTSAFACK Nestor
TSAFACK Nestor
NDNkapkop Jean De Dieu
Nkapkop Jean De Dieu
KJKengne Jacques
Kengne Jacques
EYEFFA Joseph Yves
EFFA Joseph Yves
Abdullah Iliyasu (aka Abdul M. Elias)Abdullah Iliyasu (aka Abdul M. Elias)
Abdullah Iliyasu (aka Abdul M. Elias)
AEAhmed A. Abd El-Latif
Ahmed A. Abd El-Latif
A lightweight image encryption algorithm is presented based on chaos induction via a 5-dimensional hyperjerk oscillator (5DHO) network. First, the dynamics of our 5DHO network is investigated and shown to exhibit up to five coexisting hidden attractors in the state space that depend exclusively on the system’s initial values. Further, a simple implementation of the circuit was used to validate its ability to exhibit chaotic dynamical properties. Second, an Arduino UNO platform is used to confirm the usability of our oscillator in embedded system implementation. Finally, an efficient image encryption application is executed using the proposed chaotic networks based on the use of permutation-substitution sequences. The superior qualities of the proposed strategy are traced to the dynamic set of keys used in the substitution process which heralds the generation of the final ciphered image. Based on the average results obtained from the entropy analysis (7.9976), NPCR values (99.62), UACI tests (33.69) and encryption execution time for 512 × 512 images (0.1141 s), the proposed algorithm is adjudged to be fast and robust to differential and statistical attacks relative to similar approaches.

18 November 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
ZNZeric Tabekoueng Njitacke
Zeric Tabekoueng Njitacke
Jean De Dieu NkapkopJean De Dieu Nkapkop
Jean De Dieu Nkapkop
VSVitrice Folifack Signing
Vitrice Folifack Signing
TNTSAFACK Nestor
TSAFACK Nestor
MSMichael Ekonde Sone
Michael Ekonde Sone
Jan AwrejcewiczJan Awrejcewicz
Jan Awrejcewicz
The complex dynamics of a simple memristive tabu learning neuron (MTLN) are considered in this article. The analysis of the stability of its equilibria revealed that it displays self-excited dynamics. The investigation of the dynamics of the considered model highlighted that it is extremely sensitive to the initial conditions. That sensitivity to the initial conditions is supported by the coexistence of an infinite number of stable states for the same set of system parameters but using different initial states. Among the infinity of coexisting stable states, there are periodic, quasiperiodic, and chaotic ones. The coexistence of an infinite number of chaotic attractors found in this work and not yet reported in such a model represents the first important contribution of this work. The circuit of the coupled neuron is also realized in the PSPICE simulation environment to further support the obtained result in extreme multistability. Therefore, the revealed chaotic dynamics of the MTLN is applied to compress and encrypt digital medical images. The compressed sensing (CS) approach is combined with deoxyribonucleic acid (DNA) coding/decoding to achieve high compression/encryption performances, including very low computational cost (encryption time t = 0.162 ms, encryption throughput ET = 1618.1 MB/s, number of CPU cycles NC = 1.8) useful for real-time compression. The compression/encryption method developed in this work represents the second main contribution based on the results of the analysis metrics.

25 January 2021 in IEEE Access
Verified
Journal Article
Open access
JTJharna Tamang
Jharna Tamang
Jean De Dieu NkapkopJean De Dieu Nkapkop
Jean De Dieu Nkapkop
MIMuhammad Fazal Ijaz
Muhammad Fazal Ijaz
PPPunam Kumari Prasad
Punam Kumari Prasad
TNTSAFACK Nestor
TSAFACK Nestor
Youngdoo SonYoungdoo Son
Youngdoo Son
The nonlinear ion-acoustic waves (IAWs) in a space plasma are capable of exhibiting chaotic dynamics which can be applied to cryptography. Dynamical properties of IAWs are examined using the direct method in plasmas composed of positive and negative ions and nonextensive distributed electrons. Applying the wave transformation, the governing equations are deduced into a dynamical system (DS). Supernonlinear and nonlinear periodic IAWs are presented through phase plane analysis. The analytical periodic wave solution for IAW is obtained. Under the influence of an external periodic force, the DS is transformed to a perturbed system. The perturbed DS describes multistability property of IAWs with change of initial conditions. The multistability behavior features coexisting trajectories such as, quasiperiodic, multiperiodic and chaotic trajectories of the perturbed DS. The chaotic feature in the perturbed DS is supported by Lyapunov exponents. This interesting behavior in the windows of chaotic dynamics is exploited to design efficient encryption algorithm. First SHA-512 is used to compute the hash digest of the plain image which is then used to update the initial seed of the chaotic IAWs system. Note that SHA-512 uses one-way function to map input data to the output, consequently it is quite impossible to break the proposed encryption technique. Second DNA coding is used to confuse and diffuse the DNA version of the plain image. The diffused image follows DNA decoding process leading to the cipher image. The security performance is evaluated using some well-known metrics and results indicate that the proposed cryptosystem can resist most of existing cryptanalysis techniques. In addition complexity analysis shows the possibility of practical implementation of the proposed algorithm.