Partage de Secrets Cryptographiques en Utilisant les Courbes Elliptiques

Abstract

In distributed systems as in any network architecture, cryptography plays a critical role in communications security, where sharing secrets using elliptic curves is a big leap for a multitude of applications that require a higher level of security, such as online voting, missile launching, bank account access, etc. In this work, we study the prerequisites of such a cryptosystem with different mathematical and cryptographic bases, we also analyze some approaches that adopt secret sharing based on the elliptic curve discrete logarithm problem, where we learn the existence of different protocols designed. By exploiting the studied notions, we were able to answer several questions, by proposing a method of multi secret sharing of a given image taken in input as a matrix that could subsequently be reconstructed without loss by a qualified access structure on a Client-Server network, while allowing each client to check the share assigned to it.