Skip to main content

Charifa Hanin

Followers

17

Following

11

Public Views

Alaa Eddine Belfedhal

Universiti Tenaga Nasional

Universiti Sains Malaysia

SASTRA University

Kamel Mohamed Faraoun

Djillali Liabes University

Rei Safavi-naini

National Institute of Technology, Calicut

Interests

Uploads

Papers by Charifa Hanin

HCAHF: A New Family of CA-based Hash Functions

International Journal of Advanced Computer Science and Applications, 2019

Cryptographic hash functions (CHF) represent a core cryptographic primitive. They have applicatio... more Cryptographic hash functions (CHF) represent a core cryptographic primitive. They have application in digital signature and message authentication protocols. Their main building block are Boolean functions. Those functions provide pseudo-randomness and sensitivity to the input. They also help prevent and lower the risk of attacks targeted at CHF. Cellular automata (CA) are a class of Boolean functions that exhibit good cryptographic properties and display a chaotic behavior. In this article, a new hash function based on CA is proposed. A description of the algorithm and the security measures to increase the robustness of the construction are presented. A security analysis against generic and dedicated attacks is included. It shows that the hashing algorithm has good security features and meet the security requirements of a good hashing scheme. The results of the tests and the properties of the CA used demonstrate the good statistical and cryptographic properties of the hash function.

Keyed-CAHASH : a New Fast Keyed Hash Function based on Cellular Automata for Authentication

Private data transmission over arbitrary canal is considered very risky. Hence, the need for desi... more Private data transmission over arbitrary canal is considered very risky. Hence, the need for designing robust cryptographic solutions ensuring both data integrity and authentication is very attempting. Therefore, Message Authentication Code (MAC) is one of the most provably secure algorithms that ensure integrity and authentication. Using a shared secret key, the receiver checks if an alteration has happened during transmission. This MAC may be derived from hash functions using a secret key. Since it is also easily implemented, this paper concerns the design of a new keyed hash function based on cellular automata. Our suggested MAC process provides a high efficiency and robustness against MAC forgery and key recovery attacks comparing to well-known HMACs standards. Further, the obtained results show that it satisfies data integrity and authentication requirement.

LCAHASH-MAC: A new lightweight message authentication code using cellular automata for RFID

2017 International Conference on Wireless Networks and Mobile Communications (WINCOM), 2017

Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Int... more Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Internet of Things (IoT). It is an automatic identification technology, without contact, aiming to identify the tag signal, in order to collect and send data instructions to the controller. Nevertheless, security is a very crucial issue for these RFID tags, since they suffer from a large number of threats such as snooping, replay attack, relay attack, counterfeiting etc. Thus, to bypass potential attacks, authentication can deny access to malicious tags. However, the existent heavy duty cryptography is unadaptable for these RFID tags security context, since they have weak computational power. To adjust the authentication security requirements, the current proposed work, a new lightweight message authentication code mechanism based on L-CAHASH, is the extension of our previously presented work, ‘L-CAHASH’ a lightweight hash function based on cellular automata for RFID. The performance of our new proposed message authentication code scheme was analyzed and the obtained results show that it meets the security demands in RFID tags, comparing to well-known hash based message authentication codes.

SPF-CA-1.2: an enhanced version of cellular automata-based block cipher system

International Journal of Computer Mathematics: Computer Systems Theory, 2021

In this article, an enhanced version of SPF is presented. SPF is a previously developed cellular ... more In this article, an enhanced version of SPF is presented. SPF is a previously developed cellular automata-based block cipher that combines Substitution-Permutation Networks (SPN) with a Feistel scheme using key-dependent S-boxes. SPF system has satisfying cryptographic properties against attacks. However, the rule 30 used in the Feistel round function was subject to an attack by Meier and Staffelbach (MS-attack). In order to avoid this attack, a new construction of SPF, namely SPF-CA 1.2, is proposed using a new ruleset combining linear and non-linear rules. In addition, a robust and fast key scheduling algorithm is employed to improve key efficiency. Moreover, the number of rounds has been reduced while conserving the high confusion and diffusion properties of the previous version. A thorough security analysis reveals the efficiency and robustness of the proposed construction.

CFA: A New Family of Hybrid CA-Based PRNGs

Security and Communication Networks, 2021

In this article, a new Pseudorandom Number Generator (PRNG) construction is proposed. It is based... more In this article, a new Pseudorandom Number Generator (PRNG) construction is proposed. It is based on cellular automata (CAs) and comprises other cryptographic primitives organized as blocks. Each of these blocks has a purpose and serves toward obtaining a higher level of randomness. The construction described is modular, and each of its blocks can be replaced, modified, or adapted according to the user, the application, or the level of randomness required. The authors first describe a general structure and the design principles behind each of the components. Next, a concrete example using the SHA-3 hash function, a hybrid cellular automaton, and the AES block cipher is provided. Then, the security analysis and the statistical properties for this specific instance of the scheme are presented.

CASC 3N vs. 4N: Effect of Increasing Cellular Automata Neighborhood Size on Cryptographic Strength

International Journal of Advanced Computer Science and Applications, 2020

Stream ciphers are symmetric cryptosystems that rely on pseudorandom number generators (PRNGs) as... more Stream ciphers are symmetric cryptosystems that rely on pseudorandom number generators (PRNGs) as a primary building block to generate a keystream. Stream ciphers have been extensively studied and many designs were proposed throughout the years. One of the popular designs used is the combination of linear feedback shift registers (LFSRs) and nonlinear feedback shift registers (NFSRs). Although this design is suitable for both software and hardware implementation and provides a good randomness behavior, it is still subject to attacks such as fault attacks and correlations attacks. Cellular automata (CAs) based stream ciphers are another design class that has been proposed. CAs display good cryptographic properties as well as a good randomness behavior, also high computational speed and a higher level of security. The use of CAs as cryptographic primitives is not recent and has been thoroughly investigated, especially the use of three-neighborhood onedimensional cellular automata. In this article, the authors investigate the impact of increasing the neighborhood size of CAs on the security level and the cryptographic properties provided. Thereafter, four-neighborhood one-dimensional CAs are studied and a stream cipher algorithm is proposed. The security of the proposed algorithm is demonstrated by using the results of standard tests (i.e. NIST Test Suite and Dieharder Battery of Tests), particularly by computing the cryptographic properties of the used CAs and by showing the resistance of the suggested algorithm to mostly known attacks.

CA-PCS: A Cellular Automata based Partition Ciphering System

International Journal of Advanced Computer Science and Applications, 2020

In this paper, the authors present a modified version of the Partition Ciphering System (PCS) enc... more In this paper, the authors present a modified version of the Partition Ciphering System (PCS) encryption system previously proposed. The previously developed encryption system PCS uses the partition problem to encrypt a message. The goals of newly developed system are avoiding statistical and frequency attacks, by providing a balance between 0s and 1s, ensuring a good level of entropy and achieving confidentiality through encryption. One of the novelties of the new design compared to its predecessor is the use of cellular automata (CAs) during the encryption. The use of CAs is justified by their good cryptographic properties that provide a level of security against attacks, and better confusion and diffusion properties. The new design is first presented with details of the encryption and decryption mechanisms. Then, the results of the DIEHARDER battery of tests, the results of the avalanche test, a security analysis and the performance of the system are outlined. Finally, a comparison between CA-PCS and PCS as well as the AES encryption system is provided. The paper shows that the modified version of PCS displays a better performance as well as a good level of security against attacks.

LCAHASH-1.1: A New Design of the LCAHASH System for IoT

International Journal of Advanced Computer Science and Applications, 2019

The present paper represents an extension of LCAHASH system. LCAHASH is a previously developed li... more The present paper represents an extension of LCAHASH system. LCAHASH is a previously developed lightweight hash algorithm. It is based on cellular automata. It was developed as an alternative to existing hash functions to ensure data integrity and to meet the security requirements of the Internet of Things devices. Due to the limited amount of storage and the limited computation capabilities of these devices, the algorithms used by these devices should be as efficient and as robust as possible. In this contribution, we propose an enhanced version of the original LCAHASH algorithm to improve its efficiency and its robustness. A description of the system proposed along with a security analysis and the results of a statistical battery of tests (Dieharder) are included. These results show that the system proposed exhibits good statistical and cryptographic features.

A New Block Cipher System Using Cellular Automata and Ant Colony Optimization (BC-CaACO)

International Journal of Information Security and Privacy, 2018

The communication of private information is very dangerous, since unauthorized entities can inter... more The communication of private information is very dangerous, since unauthorized entities can intercept it. Thus, encryption is one of the principal information security solutions that helps keep information confidentiality. This latter can be satisfied by the use of various encryption techniques, namely block cipher. In this paper, the authors propose a novel block cipher using reversible and irreversible one-dimensional cellular automata (CA) with an ant colony optimization (ACO)-based S-box in order to establish more confusion. The obtained experimental results confirm that the designed cipher resists against statistical attacks, and it has both good confusion and diffusion comparing to the existent classical symmetric cryptosystems.

Design of New Pseudo-Random Number Generator Based on Non-Uniform Cellular Automata

International Journal of Security and Its Applications, 2016

The random numbers are needed in variety fields of applications in particular cryptography. They ... more The random numbers are needed in variety fields of applications in particular cryptography. They can be constructed by using several methods such as cellular Automata (CA). This later cannot produce a long random numbers sequence, supplementary the quality of random numbers depends especially on applied CA rules. For this reason, the modified binary particle swarm optimization (MBPSO) is used to discover a new rules set for CA. Rules of radius r=1 and periodic boundary conditions are considered for a non-uniform one-dimensional CA. Our contribution consists to combine this CA with MBPSO for satisfying the pseudo random number generator (PRNG) characteristics, called "PSOCA". Thus, different tests were applied to our PSOCA algorithm to prove its generated sequences quality, such as Diehard, Nist and other statistical tests, which have been successfully passed. Moreover, the comparison with other systems ensure the highlight randomness quality of our proposal system.

L-CAHASH: A Novel Lightweight Hash Function Based on Cellular Automata for RFID

Ubiquitous Networking, 2017

Considered as the main element for building Internet of Things, Radio Frequency IDentification (R... more Considered as the main element for building Internet of Things, Radio Frequency IDentification (RFID) is a non-contact automatic identification technology that identifies the tag signal, in order to collect instructions that should be transmitted to the controller. However, it suffers from some threats (i.e. physical attacks, eavesdropping, cloning, tracking, etc.). Thus, ensuring data privacy becomes one of the paramount security interests. Hash functions are an essential mechanism in achieving data integrity. Nevertheless, the heavy duty classical existent hash functions are unsuitable for these RFID tags, since they require small amount of computation. Accordingly, in this paper, a new lightweight hash function based on cellular automata (L-CAHASH) is proposed. This approach gives a high randomness quality and fast software hashing comparing to well-known lightweight hash functions. The robustness and the efficiency of our new proposed hash function is analyzed and the obtained results show that this new hash function meets the RFID tags’ security requirement.

LCAHASH-MAC: A new lightweight message authentication code using cellular automata for RFID

2017 International Conference on Wireless Networks and Mobile Communications (WINCOM)

Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Int... more Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Internet of Things (IoT). It is an automatic identification technology, without contact, aiming to identify the tag signal, in order to collect and send data instructions to the controller. Nevertheless, security is a very crucial issue for these RFID tags, since they suffer from a large number of threats such as snooping, replay attack, relay attack, counterfeiting etc. Thus, to bypass potential attacks, authentication can deny access to malicious tags. However, the existent heavy duty cryptography is unadaptable for these RFID tags security context, since they have weak computational power. To adjust the authentication security requirements, the current proposed work, a new lightweight message authentication code mechanism based on L-CAHASH, is the extension of our previously presented work, ‘L-CAHASH’ a lightweight hash function based on cellular automata for RFID. The performance of our new proposed message authentication code scheme was analyzed and the obtained results show that it meets the security demands in RFID tags, comparing to well-known hash based message authentication codes.

SPF-CA: A new cellular automata based block cipher using key-dependent S-boxes

Journal of Discrete Mathematical Sciences and Cryptography

HCAHF: A New Family of CA-based Hash Functions

International Journal of Advanced Computer Science and Applications, 2019

Cryptographic hash functions (CHF) represent a core cryptographic primitive. They have applicatio... more Cryptographic hash functions (CHF) represent a core cryptographic primitive. They have application in digital signature and message authentication protocols. Their main building block are Boolean functions. Those functions provide pseudo-randomness and sensitivity to the input. They also help prevent and lower the risk of attacks targeted at CHF. Cellular automata (CA) are a class of Boolean functions that exhibit good cryptographic properties and display a chaotic behavior. In this article, a new hash function based on CA is proposed. A description of the algorithm and the security measures to increase the robustness of the construction are presented. A security analysis against generic and dedicated attacks is included. It shows that the hashing algorithm has good security features and meet the security requirements of a good hashing scheme. The results of the tests and the properties of the CA used demonstrate the good statistical and cryptographic properties of the hash function.

Keyed-CAHASH : a New Fast Keyed Hash Function based on Cellular Automata for Authentication

Private data transmission over arbitrary canal is considered very risky. Hence, the need for desi... more Private data transmission over arbitrary canal is considered very risky. Hence, the need for designing robust cryptographic solutions ensuring both data integrity and authentication is very attempting. Therefore, Message Authentication Code (MAC) is one of the most provably secure algorithms that ensure integrity and authentication. Using a shared secret key, the receiver checks if an alteration has happened during transmission. This MAC may be derived from hash functions using a secret key. Since it is also easily implemented, this paper concerns the design of a new keyed hash function based on cellular automata. Our suggested MAC process provides a high efficiency and robustness against MAC forgery and key recovery attacks comparing to well-known HMACs standards. Further, the obtained results show that it satisfies data integrity and authentication requirement.

LCAHASH-MAC: A new lightweight message authentication code using cellular automata for RFID

2017 International Conference on Wireless Networks and Mobile Communications (WINCOM), 2017

Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Int... more Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Internet of Things (IoT). It is an automatic identification technology, without contact, aiming to identify the tag signal, in order to collect and send data instructions to the controller. Nevertheless, security is a very crucial issue for these RFID tags, since they suffer from a large number of threats such as snooping, replay attack, relay attack, counterfeiting etc. Thus, to bypass potential attacks, authentication can deny access to malicious tags. However, the existent heavy duty cryptography is unadaptable for these RFID tags security context, since they have weak computational power. To adjust the authentication security requirements, the current proposed work, a new lightweight message authentication code mechanism based on L-CAHASH, is the extension of our previously presented work, ‘L-CAHASH’ a lightweight hash function based on cellular automata for RFID. The performance of our new proposed message authentication code scheme was analyzed and the obtained results show that it meets the security demands in RFID tags, comparing to well-known hash based message authentication codes.

SPF-CA-1.2: an enhanced version of cellular automata-based block cipher system

International Journal of Computer Mathematics: Computer Systems Theory, 2021

In this article, an enhanced version of SPF is presented. SPF is a previously developed cellular ... more In this article, an enhanced version of SPF is presented. SPF is a previously developed cellular automata-based block cipher that combines Substitution-Permutation Networks (SPN) with a Feistel scheme using key-dependent S-boxes. SPF system has satisfying cryptographic properties against attacks. However, the rule 30 used in the Feistel round function was subject to an attack by Meier and Staffelbach (MS-attack). In order to avoid this attack, a new construction of SPF, namely SPF-CA 1.2, is proposed using a new ruleset combining linear and non-linear rules. In addition, a robust and fast key scheduling algorithm is employed to improve key efficiency. Moreover, the number of rounds has been reduced while conserving the high confusion and diffusion properties of the previous version. A thorough security analysis reveals the efficiency and robustness of the proposed construction.

CFA: A New Family of Hybrid CA-Based PRNGs

Security and Communication Networks, 2021

In this article, a new Pseudorandom Number Generator (PRNG) construction is proposed. It is based... more In this article, a new Pseudorandom Number Generator (PRNG) construction is proposed. It is based on cellular automata (CAs) and comprises other cryptographic primitives organized as blocks. Each of these blocks has a purpose and serves toward obtaining a higher level of randomness. The construction described is modular, and each of its blocks can be replaced, modified, or adapted according to the user, the application, or the level of randomness required. The authors first describe a general structure and the design principles behind each of the components. Next, a concrete example using the SHA-3 hash function, a hybrid cellular automaton, and the AES block cipher is provided. Then, the security analysis and the statistical properties for this specific instance of the scheme are presented.

CASC 3N vs. 4N: Effect of Increasing Cellular Automata Neighborhood Size on Cryptographic Strength

International Journal of Advanced Computer Science and Applications, 2020

Stream ciphers are symmetric cryptosystems that rely on pseudorandom number generators (PRNGs) as... more Stream ciphers are symmetric cryptosystems that rely on pseudorandom number generators (PRNGs) as a primary building block to generate a keystream. Stream ciphers have been extensively studied and many designs were proposed throughout the years. One of the popular designs used is the combination of linear feedback shift registers (LFSRs) and nonlinear feedback shift registers (NFSRs). Although this design is suitable for both software and hardware implementation and provides a good randomness behavior, it is still subject to attacks such as fault attacks and correlations attacks. Cellular automata (CAs) based stream ciphers are another design class that has been proposed. CAs display good cryptographic properties as well as a good randomness behavior, also high computational speed and a higher level of security. The use of CAs as cryptographic primitives is not recent and has been thoroughly investigated, especially the use of three-neighborhood onedimensional cellular automata. In this article, the authors investigate the impact of increasing the neighborhood size of CAs on the security level and the cryptographic properties provided. Thereafter, four-neighborhood one-dimensional CAs are studied and a stream cipher algorithm is proposed. The security of the proposed algorithm is demonstrated by using the results of standard tests (i.e. NIST Test Suite and Dieharder Battery of Tests), particularly by computing the cryptographic properties of the used CAs and by showing the resistance of the suggested algorithm to mostly known attacks.

CA-PCS: A Cellular Automata based Partition Ciphering System

International Journal of Advanced Computer Science and Applications, 2020

In this paper, the authors present a modified version of the Partition Ciphering System (PCS) enc... more In this paper, the authors present a modified version of the Partition Ciphering System (PCS) encryption system previously proposed. The previously developed encryption system PCS uses the partition problem to encrypt a message. The goals of newly developed system are avoiding statistical and frequency attacks, by providing a balance between 0s and 1s, ensuring a good level of entropy and achieving confidentiality through encryption. One of the novelties of the new design compared to its predecessor is the use of cellular automata (CAs) during the encryption. The use of CAs is justified by their good cryptographic properties that provide a level of security against attacks, and better confusion and diffusion properties. The new design is first presented with details of the encryption and decryption mechanisms. Then, the results of the DIEHARDER battery of tests, the results of the avalanche test, a security analysis and the performance of the system are outlined. Finally, a comparison between CA-PCS and PCS as well as the AES encryption system is provided. The paper shows that the modified version of PCS displays a better performance as well as a good level of security against attacks.

LCAHASH-1.1: A New Design of the LCAHASH System for IoT

International Journal of Advanced Computer Science and Applications, 2019

The present paper represents an extension of LCAHASH system. LCAHASH is a previously developed li... more The present paper represents an extension of LCAHASH system. LCAHASH is a previously developed lightweight hash algorithm. It is based on cellular automata. It was developed as an alternative to existing hash functions to ensure data integrity and to meet the security requirements of the Internet of Things devices. Due to the limited amount of storage and the limited computation capabilities of these devices, the algorithms used by these devices should be as efficient and as robust as possible. In this contribution, we propose an enhanced version of the original LCAHASH algorithm to improve its efficiency and its robustness. A description of the system proposed along with a security analysis and the results of a statistical battery of tests (Dieharder) are included. These results show that the system proposed exhibits good statistical and cryptographic features.

A New Block Cipher System Using Cellular Automata and Ant Colony Optimization (BC-CaACO)

International Journal of Information Security and Privacy, 2018

The communication of private information is very dangerous, since unauthorized entities can inter... more The communication of private information is very dangerous, since unauthorized entities can intercept it. Thus, encryption is one of the principal information security solutions that helps keep information confidentiality. This latter can be satisfied by the use of various encryption techniques, namely block cipher. In this paper, the authors propose a novel block cipher using reversible and irreversible one-dimensional cellular automata (CA) with an ant colony optimization (ACO)-based S-box in order to establish more confusion. The obtained experimental results confirm that the designed cipher resists against statistical attacks, and it has both good confusion and diffusion comparing to the existent classical symmetric cryptosystems.

Design of New Pseudo-Random Number Generator Based on Non-Uniform Cellular Automata

International Journal of Security and Its Applications, 2016

The random numbers are needed in variety fields of applications in particular cryptography. They ... more The random numbers are needed in variety fields of applications in particular cryptography. They can be constructed by using several methods such as cellular Automata (CA). This later cannot produce a long random numbers sequence, supplementary the quality of random numbers depends especially on applied CA rules. For this reason, the modified binary particle swarm optimization (MBPSO) is used to discover a new rules set for CA. Rules of radius r=1 and periodic boundary conditions are considered for a non-uniform one-dimensional CA. Our contribution consists to combine this CA with MBPSO for satisfying the pseudo random number generator (PRNG) characteristics, called "PSOCA". Thus, different tests were applied to our PSOCA algorithm to prove its generated sequences quality, such as Diehard, Nist and other statistical tests, which have been successfully passed. Moreover, the comparison with other systems ensure the highlight randomness quality of our proposal system.

L-CAHASH: A Novel Lightweight Hash Function Based on Cellular Automata for RFID

Ubiquitous Networking, 2017

Considered as the main element for building Internet of Things, Radio Frequency IDentification (R... more Considered as the main element for building Internet of Things, Radio Frequency IDentification (RFID) is a non-contact automatic identification technology that identifies the tag signal, in order to collect instructions that should be transmitted to the controller. However, it suffers from some threats (i.e. physical attacks, eavesdropping, cloning, tracking, etc.). Thus, ensuring data privacy becomes one of the paramount security interests. Hash functions are an essential mechanism in achieving data integrity. Nevertheless, the heavy duty classical existent hash functions are unsuitable for these RFID tags, since they require small amount of computation. Accordingly, in this paper, a new lightweight hash function based on cellular automata (L-CAHASH) is proposed. This approach gives a high randomness quality and fast software hashing comparing to well-known lightweight hash functions. The robustness and the efficiency of our new proposed hash function is analyzed and the obtained results show that this new hash function meets the RFID tags’ security requirement.

LCAHASH-MAC: A new lightweight message authentication code using cellular automata for RFID

2017 International Conference on Wireless Networks and Mobile Communications (WINCOM)

Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Int... more Radio Frequency Identification (RFID) is one of the basic requirements for the realization of Internet of Things (IoT). It is an automatic identification technology, without contact, aiming to identify the tag signal, in order to collect and send data instructions to the controller. Nevertheless, security is a very crucial issue for these RFID tags, since they suffer from a large number of threats such as snooping, replay attack, relay attack, counterfeiting etc. Thus, to bypass potential attacks, authentication can deny access to malicious tags. However, the existent heavy duty cryptography is unadaptable for these RFID tags security context, since they have weak computational power. To adjust the authentication security requirements, the current proposed work, a new lightweight message authentication code mechanism based on L-CAHASH, is the extension of our previously presented work, ‘L-CAHASH’ a lightweight hash function based on cellular automata for RFID. The performance of our new proposed message authentication code scheme was analyzed and the obtained results show that it meets the security demands in RFID tags, comparing to well-known hash based message authentication codes.

SPF-CA: A new cellular automata based block cipher using key-dependent S-boxes

Journal of Discrete Mathematical Sciences and Cryptography