A modified algorithm for peer-to-peer security
Makaleler > Tam Makale · 2007
Yazarlar: Sedat Akleylek, Levent Emmungil, Urfat NURİYEV
APPLIED AND COMPUTATIONAL MATHEMATICS, SCI Expanded İndekslerine Giren Dergi, Uluslararası, 2007, cilt 6, ss 258-264
Özet
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.