Sadek Bouroubi | Université des Sciences et Technologie Houari Boumediene (USTHB) (original) (raw)
Papers by Sadek Bouroubi
RAIRO. Recherche opérationnelle/RAIRO. Recherche opérationnelle, Jun 13, 2024
arXiv (Cornell University), Nov 13, 2017
In 1976, Whitfield Diffie and Martin Hellman introduced the public key cryptography or asymmetric... more In 1976, Whitfield Diffie and Martin Hellman introduced the public key cryptography or asymmetric cryptography standards. Two years later, an asymmetric cryptosystem was published by Ralph Merkle and Martin Hellman called MH, based on a variant of knapsack problem known as the subset-sum problem which is proven to be NP-hard. Furthermore, over the last four decades, Metaheuristics have achieved a remarkable progress in solving NP-hard optimization problems. However, the conception of these methods raises several challenges, mainly the adaptation and the parameters setting. In this paper, we propose a Parallel Genetic Algorithm (PGA) adapted to explore effectively the search space of considerable size in order to break the MH cipher. Experimental study is included, showing the performance of the proposed attacking scheme and finally concluding with a comparison with the LLL algorithm attack.
International Journal of Computational Intelligence Research, 2007
Studia Informatica Universalis, 2011
ArXiv, 2020
One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme... more One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only predefined subsets of participants can recover the secret after collaborating with their secret shares. The construction of secret sharing schemes has received a considerable attention of many searchers whose main goal was to improve the information rate. In this paper, we propose a novel construction of a secret sharing scheme which is based on the hierarchical concept of companies illustrated through its organization chart and represented by a tree. We proof that the proposed scheme is ideal by showing that the information rate equals 1. In order to show the efficiency of the proposed scheme, we discuss all possible kinds of attacks and proof that the security in ensured. Finally, we include a detailed didactic example for a small company organization ch...
2020 4th International Symposium on Informatics and its Applications (ISIA), 2020
Predicting the 3D native structure of proteins using their amino acid sequences. The aim of PFP i... more Predicting the 3D native structure of proteins using their amino acid sequences. The aim of PFP is to predict the best conformation of a given amino acid sequence that has the lowest free energy. Because of its complexity, this problem has been widely studied under the HP simplified model with a different type of lattice as a conformational representation. Many algorithms have been proposed for solving the PFP problem using a set of benchmark instances. In this work, we propose an efficient scatter search algorithm (SS) for the PFP problem in 3D cubic lattice.
International Journal of Applied Metaheuristic Computing, 2020
The authors propose a computing approach for solving a multiobjective problem in the telecommunic... more The authors propose a computing approach for solving a multiobjective problem in the telecommunication network field, suggested by an Algerian industrial company. The principal goal is in developing a palliative solution to overcome some generated problems existing in the current management system. A mathematical operational model has been established. The exact algorithms that solve multiobjective optimization problems are not appropriate for large scale problems. However, the application of metaheuristics approach leads perfectly to approximate the Pareto optimal set. In this paper, the authors apply a well-known multiobjective evolutionary algorithm, the Non-dominated Sorting Genetic Algorithm (NSGA-II), compare the obtained results with those generated by the Strength Pareto Evolutionary Algorithm-II (SPEA2) and propose a way to help the decision maker, who is often confronted with the choice of a final solution, to make his preferences afterward using a utility function based o...
Quaestiones Mathematicae, 2017
Let n, a and b be positive integers. The pair (a, b) is called an integer partition of n into Dio... more Let n, a and b be positive integers. The pair (a, b) is called an integer partition of n into Diophantine pair if n = a + b, ab + 1 is a perfect square and a > b. In this paper we give, for any positive integer n, a closed formula for the number of integer partitions into Diophantine pairs.
The contamination game of a grid graph G(n,m) is a dynamic variant of the domination, similar to ... more The contamination game of a grid graph G(n,m) is a dynamic variant of the domination, similar to the power domination. This standard is introduced by Haynes, Hedetniemi and Henning in 2002, which is initially defined as a basic domination for a set of vertices S in a graph G, and then a propagation of this domination in all vertices of G, while starting with S. On the other hand, the contamination phenomena in G(n,m) is interpreted by an evolutionary automaton cellular, which aims to propagate viruses according to a given propagation rules. In this paper, we define a mathematical self-playing game called a contamination game based on the power domination, in which, we identify the minimum number of contaminant cells for G(n,m), called the contamination number and denoted γ(G(n,m)).
The notions of dominating sets of graphs began almost 400 years ago with the game of chess, which... more The notions of dominating sets of graphs began almost 400 years ago with the game of chess, which sparked the analysis of dominating sets of graphs, at first relatively loosely until the beginnings of the 1960s, when the issue was given mathematical description. It's among the most important problems in graph theory, as well as an NP-Complete problem that can't be solved in polynomial time. As a result, we describe a new hybrid cuckoo search technique to tackle the MDS problem in this work. Cuckoo search is a well-known metaheuristic famed for its capacity for exploring a large area of the search space, making it useful for diversification. However, to enhance performance, we incorporated intensification techniques in addition to the genetic crossover operator in the suggested approach. The comparison of our method with the corresponding state-of-the-art techniques from the literature is presented in an exhaustive experimental test. The suggested algorithm outperforms the present state of the art, according to the obtained results.
日本レジャー・レクリエーション学会, Dec 1, 2017
[
The American Historical Review, 1955
Applied Soft Computing, 2022
Using an explicit computable expression of ordinary multinomials, we establish three remarkable c... more Using an explicit computable expression of ordinary multinomials, we establish three remarkable connections, with the q-generalized Fibonacci sequence, the exponential partial Bell partition polynomials and the density of convolution powers of the discrete uniform distribution. Identities and various combinatorial relations are derived.
TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
The flawless functioning of a protein is essentially linked to its own threedimensional structure... more The flawless functioning of a protein is essentially linked to its own threedimensional structure. Therefore, the prediction of a protein structure from its amino acid sequence is a fundamental problem in many fields that draws researchers attention. This problem can be formulated as a combinatorial optimization problem based on simplified lattice models such as the hydrophobic-polar model. In this paper, we propose a new hybrid algorithm combining three different well-known heuristic algorithms: genetic algorithm, tabu search strategy and local search algorithm in order to solve the PSP problem. Regarding the assessment of suggested algorithm, an experimental study is included, where we considered the quality of the produced solution as the main quality criterion. Furthermore, we compared the suggested algorithm with state-of-the-art algorithms using a selection of well-studied benchmark instances.
RAIRO. Recherche opérationnelle/RAIRO. Recherche opérationnelle, Jun 13, 2024
arXiv (Cornell University), Nov 13, 2017
In 1976, Whitfield Diffie and Martin Hellman introduced the public key cryptography or asymmetric... more In 1976, Whitfield Diffie and Martin Hellman introduced the public key cryptography or asymmetric cryptography standards. Two years later, an asymmetric cryptosystem was published by Ralph Merkle and Martin Hellman called MH, based on a variant of knapsack problem known as the subset-sum problem which is proven to be NP-hard. Furthermore, over the last four decades, Metaheuristics have achieved a remarkable progress in solving NP-hard optimization problems. However, the conception of these methods raises several challenges, mainly the adaptation and the parameters setting. In this paper, we propose a Parallel Genetic Algorithm (PGA) adapted to explore effectively the search space of considerable size in order to break the MH cipher. Experimental study is included, showing the performance of the proposed attacking scheme and finally concluding with a comparison with the LLL algorithm attack.
International Journal of Computational Intelligence Research, 2007
Studia Informatica Universalis, 2011
ArXiv, 2020
One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme... more One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only predefined subsets of participants can recover the secret after collaborating with their secret shares. The construction of secret sharing schemes has received a considerable attention of many searchers whose main goal was to improve the information rate. In this paper, we propose a novel construction of a secret sharing scheme which is based on the hierarchical concept of companies illustrated through its organization chart and represented by a tree. We proof that the proposed scheme is ideal by showing that the information rate equals 1. In order to show the efficiency of the proposed scheme, we discuss all possible kinds of attacks and proof that the security in ensured. Finally, we include a detailed didactic example for a small company organization ch...
2020 4th International Symposium on Informatics and its Applications (ISIA), 2020
Predicting the 3D native structure of proteins using their amino acid sequences. The aim of PFP i... more Predicting the 3D native structure of proteins using their amino acid sequences. The aim of PFP is to predict the best conformation of a given amino acid sequence that has the lowest free energy. Because of its complexity, this problem has been widely studied under the HP simplified model with a different type of lattice as a conformational representation. Many algorithms have been proposed for solving the PFP problem using a set of benchmark instances. In this work, we propose an efficient scatter search algorithm (SS) for the PFP problem in 3D cubic lattice.
International Journal of Applied Metaheuristic Computing, 2020
The authors propose a computing approach for solving a multiobjective problem in the telecommunic... more The authors propose a computing approach for solving a multiobjective problem in the telecommunication network field, suggested by an Algerian industrial company. The principal goal is in developing a palliative solution to overcome some generated problems existing in the current management system. A mathematical operational model has been established. The exact algorithms that solve multiobjective optimization problems are not appropriate for large scale problems. However, the application of metaheuristics approach leads perfectly to approximate the Pareto optimal set. In this paper, the authors apply a well-known multiobjective evolutionary algorithm, the Non-dominated Sorting Genetic Algorithm (NSGA-II), compare the obtained results with those generated by the Strength Pareto Evolutionary Algorithm-II (SPEA2) and propose a way to help the decision maker, who is often confronted with the choice of a final solution, to make his preferences afterward using a utility function based o...
Quaestiones Mathematicae, 2017
Let n, a and b be positive integers. The pair (a, b) is called an integer partition of n into Dio... more Let n, a and b be positive integers. The pair (a, b) is called an integer partition of n into Diophantine pair if n = a + b, ab + 1 is a perfect square and a > b. In this paper we give, for any positive integer n, a closed formula for the number of integer partitions into Diophantine pairs.
The contamination game of a grid graph G(n,m) is a dynamic variant of the domination, similar to ... more The contamination game of a grid graph G(n,m) is a dynamic variant of the domination, similar to the power domination. This standard is introduced by Haynes, Hedetniemi and Henning in 2002, which is initially defined as a basic domination for a set of vertices S in a graph G, and then a propagation of this domination in all vertices of G, while starting with S. On the other hand, the contamination phenomena in G(n,m) is interpreted by an evolutionary automaton cellular, which aims to propagate viruses according to a given propagation rules. In this paper, we define a mathematical self-playing game called a contamination game based on the power domination, in which, we identify the minimum number of contaminant cells for G(n,m), called the contamination number and denoted γ(G(n,m)).
The notions of dominating sets of graphs began almost 400 years ago with the game of chess, which... more The notions of dominating sets of graphs began almost 400 years ago with the game of chess, which sparked the analysis of dominating sets of graphs, at first relatively loosely until the beginnings of the 1960s, when the issue was given mathematical description. It's among the most important problems in graph theory, as well as an NP-Complete problem that can't be solved in polynomial time. As a result, we describe a new hybrid cuckoo search technique to tackle the MDS problem in this work. Cuckoo search is a well-known metaheuristic famed for its capacity for exploring a large area of the search space, making it useful for diversification. However, to enhance performance, we incorporated intensification techniques in addition to the genetic crossover operator in the suggested approach. The comparison of our method with the corresponding state-of-the-art techniques from the literature is presented in an exhaustive experimental test. The suggested algorithm outperforms the present state of the art, according to the obtained results.
日本レジャー・レクリエーション学会, Dec 1, 2017
[
The American Historical Review, 1955
Applied Soft Computing, 2022
Using an explicit computable expression of ordinary multinomials, we establish three remarkable c... more Using an explicit computable expression of ordinary multinomials, we establish three remarkable connections, with the q-generalized Fibonacci sequence, the exponential partial Bell partition polynomials and the density of convolution powers of the discrete uniform distribution. Identities and various combinatorial relations are derived.
TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
The flawless functioning of a protein is essentially linked to its own threedimensional structure... more The flawless functioning of a protein is essentially linked to its own threedimensional structure. Therefore, the prediction of a protein structure from its amino acid sequence is a fundamental problem in many fields that draws researchers attention. This problem can be formulated as a combinatorial optimization problem based on simplified lattice models such as the hydrophobic-polar model. In this paper, we propose a new hybrid algorithm combining three different well-known heuristic algorithms: genetic algorithm, tabu search strategy and local search algorithm in order to solve the PSP problem. Regarding the assessment of suggested algorithm, an experimental study is included, where we considered the quality of the produced solution as the main quality criterion. Furthermore, we compared the suggested algorithm with state-of-the-art algorithms using a selection of well-studied benchmark instances.