On Application of Discrete Logarithms in Information - Hiding and Knapsack Problem with New Properties of Sk - Sets

Discrete logarithms are applied in many cryptographic problems . For instance , in public key , and for construction of sets with distinct sums of k-elcments. The purpose of this paper is to modify the method of information-hiding using discrete logarithms , introduce new properties of Sk - sets , usedthe direct product of groups to construct cyclic group and finally, present modified method for knapsack problem using each of discrete logarithms and Sk -sets.