A modified algorithm for peer-to-peer security
Articles > Article · 2007
Authors: Sedat Akleylek, Levent Emmungil, Urfat NURİYEV
APPLIED AND COMPUTATIONAL MATHEMATICS, Journal Indexed in SCI Expanded, International, 2007, vol 6, pp 258-264
Summary
In this paper we present the steganographic approach to peer-to-peer systems with a modified algorithm. This gives the user a very high level of protection against being compelled to disclose its contents. Even the realization of the quantum computer cannot solve NP-hard problem in a polynomial time, a modified algorithm with steganographic use depending on Knapsack problem may make peer-to-peer systems secure.