Partage de Secret en Utilisant des Métaheuristiques Bionispirées
No Thumbnail Available
Date
2024
Authors
ZENDER Rouia
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Technology has progressed a lot in recent decades, especially in terms of computing power
and will probably continue to do so in the future, Moore's law is there to support it. This had
disastrous repercussions on the information security; although cryptography has also evolved
a lot in terms of encryption algorithms, recent supercomputers are capable of overcoming
some cryptosystems. This has led researchers in this field to investigate new avenues, such as
secret sharing, which over time has proven to be the most secure solution currently used for
protecting its secret.
The main axis around which revolves the subject of this thesis is precisely this secret sharing
paradigm, requiring cooperation and collaboration on the part of secret keepers based on
distributed trust and jointly managed control of the security situation.During these last years,
various sharing algorithms have been proposed. Indeed, security in the field of IT in general
and computer systems in particular have contributed a lot in the evolution of this discipline
which belongs to cryptography and which is based on strong theoretical pillars such as:
modular arithmetic and coding theory.
Contribution in this research work consists of the proposal of a new secret sharing scheme
based on bioinspired hexagonal structure and integer decomposition. As a metaheuristic
inspiration, hexagonal structure was inspired from nature where it’s common in constructs
made by biological systems and the intelligent behaviours of a bee swarm.
For integer decomposition, it is known that the oldest method is Fermat’s factorization, which
is based on the representation of an odd integer as the difference of two squares, while for the
proposed decomposition every positive integer has a unique factorization into two factors.
To check functionality and efficiency of the proposed scheme, it was applied to digital images
processing domain where it has exhibited good properties: it is lossless and ideal, its
flexibility allows many extensions to handle additional situations, it can add new or delete an
old participant and it can detect and identify cheater. Aside these interesting features,
experimental results demonstrate that this scheme has a good security level.