Please use this identifier to cite or link to this item: http://dspace.univ-temouchent.edu.dz/handle/123456789/2583
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIkni, Hind-
dc.date.accessioned2024-02-25T09:09:25Z-
dc.date.available2024-02-25T09:09:25Z-
dc.date.issued2018-
dc.identifier.citationhttps://theses.univ-temouchent.edu.dz/opac_css/doc_num.php?explnum_id=1644en_US
dc.identifier.urihttp://dspace.univ-temouchent.edu.dz/handle/123456789/2583-
dc.description.abstractIn 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.en_US
dc.subjectVerifiable secret sharing, elliptic curves, elliptic curve discrete logarithme problemen_US
dc.titlePartage de Secrets Cryptographiques en Utilisant les Courbes Elliptiquesen_US
Appears in Collections:Informatique

Files in This Item:
File Description SizeFormat 
partage de secret cryptographique en utilisant les courbes elliptiques.pdf2,67 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.