Multiple Subset Problem as an encryption scheme for communication

Using well-known mathematical problems for encryption is a widely used technique because they are computationally hard and provide security against potential attacks on the encryption method. The subset sum problem (SSP) can be defined as finding a subset of integers from a given set, whose sum is e...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-01
Hauptverfasser:	Zadok, Yair, Voloch, Nadav, Voloch-Bloch, Noa, Maor, Meir Hajaj
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Integers Sums
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!