1

Slide 1: Introduction to Information Security

Bissmi allah erahmani erahim

Assalam alaikum evry one
Esteemed members of examination committee, dear parents , dear assistence it’s with proufound
gratitude I welcome you to this accadimic jurney thank you for your presence. In this significant
occasion I will introduce my research defense entitled : implimentation and development of
advanced algorithms dedicated to security and identification by the supervisory of profs ziet
lehcen and bekkouche tawfik so

Slide 2: overview

In this presentation I will first introduce my work presenting the challenges in securing data
specialy images . followed by the basic of classical security systems and their limitations with
complex and sensitive data like high resolutions image and biometric templates, wich studied
and solved in my key contributions including the the integration of biometric based encryption
for retinal images than the improved composite chaotic map for images encryption sheme and
their results. to finished with conclusion and proposed future works.

Slide 3: Problem statement

I will start by asking the most important questions that this reaserch have been ensewered it later:
what is security system, why we need these systems in our modern digital life?, how we can
build it to be robust and efficiency

Slide 4: what?
Security system is a protocol or thechnique designed to protect sensitive data, ensuring
confidentiality, integrity, availability, and authentication. It is essential in various sectors,
including communication, identification, healthcare, and cloud data management.

Slide 5: why?
With the rise in cyberattacks like phishing, ransomware, and identity theft, sensitive biometric
and medical data are increasingly at risk. Traditional encryption methods face challenges in
efficiently securing this data, and emerging threats like AI and quantum computing require new,
more robust encryption systems
Slide 6: how ?
To build a robust and scalable encryption system, we need to combine two powerful
components: chaotic systems and biometric key generation. These elements enhance key
sensitivity and provide greater unpredictability, ensuring better resilience against cryptographic
attacks

Slide 7: objectives
The main objectives of this research include:
Generating biometric-based encryption keys for secure image encryption.
Developing the Improved Composite Chaotic Map (ICCM).
2

Integrating optical transforms such as FrFT and DRPE with chaotic systems.
to enhance key sensitivity and resilience against modern attacks.
Thefore Preserve data integrity post-decryption

Slide 8: Preliminaries on Image Security Systems

Before diving into the core contributions, let’s explore the basics of image security
systems. This includes biometric security systems that verify identity using unique
physical traits such as fingerprints or retinal scans, and the role of cryptographic
systems in protecting sensitive information.

Slide 9: Classical cryptographic systems

Classical cryptographic systems Include methods like symmetric encryption (e.g.,
AES), asymmetric encryption (e.g., RSA), the hybrid encryption systems and hashing
encryption . These methods have been foundational in information security, but they
face limitations when applied to nowdays securty systen such as biometric data and
high-resolution images.

Slide 10: Challenges with Image Encryption

Encrypting images introduces specific challenges, including redundancy and high
dimensionality. Traditional systems like AES struggle with large image data, failing
to account for pixel correlations and image patterns, which remain visible in
encrypted images.
Slide 11: Chaos-Based Cryptography
Chaos-based cryptography leverages the unpredictable nature of chaotic systems. These systems
exhibit sensitive dependence on initial conditions, making them ideal for generating
unpredictable encryption keys and enhancing the security of sensitive data like biometric images.
Slide 12: Chaos-Based Cryptography
Chaotic Maps for Encryption : Common chaotic maps used in cryptography include the logistic
tent, Henon map, , and Lorenz system.These maps generate highly sensitive outputs, making
them ideal for encryption systems that need high unpredictability and resilience to attacks

Slide 13: Encryption Techniques (DRPE/FrFT)

Fractional Fourier Transform (FrFT) and Double Random Phase Encoding (DRPE) are optical
encryption techniques used to further enhance image security. These techniques add multi-
domain scrambling, making it harder for attackers to decrypt the data.

Slide 14: Nonlinear Functions for Image Processing

Nonlinear functions are key in enhancing encryption security. Functions like Sigmoid,
Hyperbolic Tangent, and Piecewise Linear Chaotic Maps (PWLCM) ensure that small changes
in the input cause large, unpredictable changes in the output, adding complexity to the
encryption.
Slide 15: Biometric Key Generation
3

Biometric key generation plays a pivotal role in this work. By using features extracted from
biometric data, we generate encryption keys that are unique to the individual. This approach
ensures strong identity binding, making it harder for unauthorized users to break the encryption.

Slide 16: introduction

Where We are about creating ……..
**The proposed study was in the process of enhancing …..
1**therfore Non-linear Chaotic functions introduce a higher level of conplexity and confusion
….
2Sensitivity
3So in strengthan the data security

Slide 17: proposed algorthm

This pocess applied to facilitate treatment of image retina .
The seconds phase of the schem present the advanced algorithm where the segmented image
was the input data of the hyperbolic tengent with two chaos generated by the logistic map than
we introduce the biometric finger print template and an other chaos as keis of the permutation
diffusion architecture the obtained image called encrypted image can be recover by aplyn the
inverse of each step
Slide 18: obtined results
•This result was obtained by the running of matlab 2016 version in personal laptop both
encryption/decryption and tests codes so,
•We took five samples randomly from ….
•Than by ……. Forme of wight noise .The figure bellow illustrate result obtined.

Slide 19: wrong finger print

In ordre to verifite the effectivenesse of our proposed algorithm, the decryption operation is done
, the figure a rpresent ……. Will figure b
Slide 20: sensitivity + keyspace

1 To conduct the sensitivity analysis, we introduce slight variations in one element of the
encryption key while keeping the others constant.
2 Based on the sensitivity analysis results obtained ..
Notably, this value surpasses the encryption requirement of
which confirmed the robustness of the encryption system against potential attacks.
Slide 21: evaluation metrics

This subsection evaluates the proposed algorithm using key metrics: correlation rate, PSNR, and
MSE. Table 1 presented provides a summary of all the results obtained. The comparison between
the proposed method and the method referenced in [120] in terms of CORR, PSNR, and MSE
metrics across 5 retinal images offers insights into the effectiveness of the proposed Chaotic
Retinal Image Encryption Pre-processing Based on Biometric Key.

Slide 22: Conclusion of Retinal Cryptosystem

4

In conclusion, the retinal cryptosystem we developed offers a secure and efficient

method for encrypting sensitive medical data. It is highly resistant to cryptographic
attacks, ensuring patient privacy and the confidentiality of medical images.
Slide 23: Improved Chaos for Image Encryption
Our second contribution introduces the Improved Composite Chaotic Map (ICCM), which
enhances key sensitivity and resilience against modern cryptanalytic attacks, offering a robust
solution for encrypting biometric images and medical data
Slide 24: Key Contributions vs Existing Schemes
When compared to existing encryption schemes, our ICCM-based system offers expanded
chaotic ranges, higher key sensitivity, and resistance to statistical attacks, setting it apart as a
more secure and efficient approach.
Slide 25: ICCM Chaotic Behavior Evaluation
1- Mathematicaly the ICCM is the composite of quadratic and cubic chaotic maps ,
2- We evaluate the chaotic behavior of this improved map through bifurcation diagrams,
Lyapunov exponents, and Kolmogorov entropy,

3- The bifurcation diagram highlights regions of high density, while showing an absence
of shallow areas and indicating chaotic behaviour across the entire interval. This confirms
the map's suitability for secure cryptographic applications, outperforming classical
methods.
4- A system is considered chaotic if it exhibits at least one positive Lyapunov Exponent
(LE). This exponent quantifies the average rate of divergence or convergence of nearby
trajectories in the system
5- A higher Kolmogorov entropy value signifies increased unpredictability, meaning that
even slight variations in the initial state lead to exponensially divergening trajectories.
6- Figure bellow presente the Kolmogorov entropy visualizations illustrating the
increased entropy and complexity of ICCM in comparison to conventional chaotic
functions
7- demonstrating that ICCM provides a full-range chaotic behavior with enhanced
instability .

Slide 28: Randomness Test Results

To further validate the randomness of our encryption scheme , we applied NIST tests. The results
in the table show that our ICCM-based encryption produces highly random output, while pass all
the nist test .
Slide 29: The ICCM Encryption Scheme
The ICCM-based encryption scheme applies multi-domain scrambling for enhanced security. We
test the system with images of different sizes and types, demonstrating its effectiveness in
producing secure and efficient encrypted images."
Slide 30: Performance Metrics
Using metrics like corr PSNR, and MSE, we evaluate the performance of the ICCM-based
system while the ideal value of correlation is zero, psnr < 10 and MSE > 10^4 the tables results
show its superior performance compared to existing encryption methods.

Slide 31: Histogram Analysis Results

5

Also the Histogram analysis confirms that the ICCM-based encryption produces uniformly
distributed encrypted images, preventing pattern leakage and ensuring a high level of security.
Slide 32: Loss Data Test Results
The loss data tests show that even with up to 50% loss in the encrypted image, the decrypted
image retains enough quality to ensure secure communication, further proving the system’s
robustness
Slide 33: Sensitivity Analysis Results
Sensitivity tests confirm that small changes in the initial chaotic parameters lead to significant
differences in the decrypted image, demonstrating the high sensitivity and chaotic nature of
ICCM based encryption system.

Slide 34: key space test

A large key space is one of our key contributions. This test represents the obtained result in the
context of keyspace compared to the literature method, a high key space value indicates the
complexity and the robustness of the proposed system

Slide 36: efficiency test results

In this test we are about evaluating npcr and uaci percentage of different images types and sizes
the table ullistrate that our algorithm is efficient.

Slide 37: : efficiency test results

Time process is so importante in developing security systems. In this test we presente the time
encryption of images with different size compared by the referenced method our scheme take
less time in the encryption phase .