Information Security

Software Algorithms and Hardware Implementations of Information Security Using Number Theory and Chaotic Systems

The project aims at proposing novel software algorithms for information security and their hardware implementations. The algorithms will utilize different methods based on number theory and chaos theory. Cryptography and information hiding systems will be developed for different media data types such as text, image, audio and video. The project will investigate different classes of symmetric/asymmetric and stream/block ciphers. In addition, it will explore both steganography and watermarking in spatial and frequency domains. The proposed information security solutions will be evaluated using standard performance measures. The project targets achieving technical outcomes that include hardware prototypes and a website.

Objective/Contributions:

Use chaos theory to design new information security techniques that extend on the previously developed research in different directions.
Use number theory in the design of new information security techniques.
Develop a hardware prototype that includes realizations of some of the information security techniques designed in objectives 1 and 2.
Develop a website that includes implementations of the designed information security techniques.
Publications, Master degrees, conferences and community services.

Outcomes

Design and implementation of a Multi-Visual Cryptography (MVC) system for sharing two color images using the generalized Tent map as a source of randomness, and a modified weighted average filter to significantly improve the recovered images quality.
Design and implementation of a progressive Multi-Secret Image Sharing (MSIS) system using the Lorenz chaotic system, where the number of used shares in the recovery process defines the quality of the recovered secrets.
Design and implementation of a (n, n)-Multi-Secret Image Sharing (MSIS) system for colored images using the fractional-order Rossler system.

Outcomes Highlights

The following videos showcase the output predictions using a simplified H.264 system integration. These videos offer a clear summary of the tested video sequences, with different QP values used to assess the system's performance. They not only compare the first frame of each sequence before and after processing but also provide links to the full output videos, displaying all 300 decoded frames. This analysis highlights the system’s robustness in preserving visual quality while achieving efficient video compression, affirming its suitability for applications requiring both high efficiency and quality retention. Moreover, the videos demonstrate minimal quality loss throughout the encoding and decoding processes, emphasizing the effectiveness of the simplified H.264 system.

The output prediction video of “Foreman” using simplified H.264 system integration.

The output prediction video of “News” using simplified H.264 system integration.

The output prediction video of “Akiyo” using simplified H.264 system integration.

The output prediction video of “Container” using simplified H.264 system integration.

The output prediction video of “Carohone” using simplified H.264 system integration.

This video demonstrates the use of elliptic curves in designing a PRNG and shows the execution steps in MATLAB for an image encryption system that utilizes the designed PRNG-based-EC. In the beginning, the input image is shown and different parts of the MATLAB GUI are described. Then the histogram analysis is shown, followed by image pixel correlation in the horizontal, vertical, and diagonal directions. Finally, the differential attacks are performed and the results are printed in the MATLAB window.

Image encryption system using elliptic curve based PRNG implementation in MATLAB

The video shows a working example where analysis results are shown in MATLAB output windows.

This video shows the encrypted Foreman sequence using the Selective Encryption System. The SES is integrated inside the H.264 video compression where important syntax elements are selected for encryption such as the Intra Prediction Mode (IPM), Non Zero Quantized Coefficients (NZ QC), and the Motion Vector Difference (MVD). The video shows the encryption result using Test Case 7 which represents IPM, Sign of NZ-QC, and Sign of MVD.

Encrypted Foreman Sequence

Encryption using Test Case 7, where Intra prediction mode, Sign of non-zero quantized coefficients, and Sign of motion vector difference syntaxes are selected for encryption.

Journal Papers

Analysis and Guidelines for Different Designs of Pseudo Random Number Generators

Analysis and Guidelines for Different Designs of Pseudo Random Number Generators The design of an efficient Pseudo Random Number Generator (PRNG) with good randomness properties is an important research topic because it is a core component in many applications. Based on an extensive study of most

An Efficient Multi-Secret Image Sharing System Based on Chinese Remainder Theorem and Its FPGA Realization

An Efficient Multi-Secret Image Sharing System Based on Chinese Remainder Theorem and Its FPGA Realization Multi-Secret Image Sharing (MSIS) is important in information security when multiple images are shared in an unintelligible form to different participants, where the images can only be

A generalized framework for elliptic curves based PRNG and its utilization in image encryption

A generalized framework for elliptic curves based PRNG and its utilization in image encryption In the last decade, Elliptic Curves (ECs) have shown their efficacy as a safe fundamental component in encryption systems, mainly when used in Pseudorandom Number Generator (PRNG) design. This paper

Secure blind watermarking using Fractional-Order Lorenz system in the frequency domain

Secure blind watermarking using Fractional-Order Lorenz system in the frequency domain This paper investigates two different blind watermarking systems in the frequency domain with the development of a Pseudo Random Number Generator (PRNG), based on a fractional-order chaotic system, for watermark

Software and Hardware Realizations for Different Designs of Chaos-Based Secret Image Sharing Systems

Software and Hardware Realizations for Different Designs of Chaos-Based Secret Image Sharing Systems Secret image sharing (SIS) conveys a secret image to mutually suspicious receivers by sending meaningless shares to the participants, and all shares must be present to recover the secret. This paper

DISH: Digital image steganography using stochastic-computing with high-capacity

DISH: Digital image steganography using stochastic-computing with high-capacity Stochastic computing is a relatively new approach to computing that has gained interest in recent years due to its potential for low-power and high-noise environments. It is a method of computing that uses probability to

Conference Papers

Registerless Multiplierless YCoCg-R and YCoCg Color Space Converters Hardware Implementation

Registerless Multiplierless YCoCg-R and YCoCg Color Space Converters Hardware Implementation Multimedia data, e.g., images and videos, are widely used over the internet and on computers. Image processing applications require color space conversion to be able to deal with these types of data more

Recently, number theory has proved its importance in cryptography because of its well-known hard problems. For instance, a primitive root for a prime number shows a special property of uniqueness when raised to different powers mod the prime number. In this paper, a Pseudorandom Number Generator (PRNG) is designed based on this property using a prime number and some of its primitive roots. The PRNG is, first, validated for utilization in cryptography applications using histograms, correlation coefficients,

PRNG Using Primitive Roots of Primes and its Utilization in Chess-based Image Encryption

PRNG Using Primitive Roots of Primes and its Utilization in Chess-based Image Encryption Recently, number theory has proved its importance in cryptography because of its well-known hard problems. For instance, a primitive root for a prime number shows a special property of uniqueness when raised to

Progressive Multi-Secret Sharing of Color Images Using Lorenz Chaotic System

Progressive Multi-Secret Sharing of Color Images Using Lorenz Chaotic System Multi-Secret Image Sharing (MSIS) systems share multiple images to multiple participants in unintelligible forms that can be recovered using all the shares. This paper employs the concept of progressive secret sharing with

Pixel-based Visual Secret Sharing Using Lorenz System

Pixel-based Visual Secret Sharing Using Lorenz System Visual Secret Sharing (VSS) allows a user to send an image in the form of shares to different participants. Every share can not reveal the secret alone, and only all shares together can reveal the secret with fast recovery. This paper proposes a

Double Fractional-order Masks Image Enhancement

Double Fractional-order Masks Image Enhancement Image enhancement is better achieved when fractional-order masks are used rather than integer-order ones, this is due to the flexibility offractional-order parameters control. This paper proposes a combination of fractional-order masks to be used in

Blind Watermarking Using DCT and Fractional-Order Lorenz System

Blind Watermarking Using DCT and Fractional-Order Lorenz System This paper presents a new blind watermarking system based on the Discrete Cosine Transform (DCT). The system's security is increased by encrypting the watermark image using the fractional-order Lorenz system. After converting the cover

A Unified System for Encryption and Multi-Secret Image Sharing Using S-box and CRT

A Unified System for Encryption and Multi-Secret Image Sharing Using S-box and CRT Multi-Secret Image Sharing (MSIS) is used when multiple images need to be shared to multiple participants, but the images can not be recovered without the presence of all shares. In this paper, a unified system for

A Secured Lossless Visual Secret Sharing for Color Images Using Arnold Transform

A Secured Lossless Visual Secret Sharing for Color Images Using Arnold Transform Nowadays, with the rapid growth in information, a fast and secure method is eagerly needed to share images. (n, n)-Visual Secret Sharing (VSS) is used to share a secret image into n shares, where the secret can only be

Novel Fast Prediction Algorithm for Advanced and High Efficiency Video Coding

Novel Fast Prediction Algorithm for Advanced and High Efficiency Video Coding This paper introduces an efficient prediction algorithm tailored for advanced and high efficiency video coding, encompassing both H.264 and H.265. The proposed approach aims at replacing the standard intra prediction

Information Security

Software Algorithms and Hardware Implementations of sing Number Theory and Chaotic Systems.

Funded by: Science, Technology & Innovation Funding Authority (STIFA) Grant #45631.


Prof. Ahmed G. Radwan PI	Prof. Salwa K. Abd-El-Hafiz Co-PI	Dr. Lobna A. Said Researcher	Dr. Wafaa S. Sayed Researcher

Eng. Sherif H. AbdElHaleem Researcher	Bishoy K. Sharobim Researcher	Muhammad Hosam Reasearcher	Anas Mohamed Reasearcher

Abdelrahman Mohamed Researcher	Abdallah Salahelden Researcher	Adham Magdy Researcher