Abstract: The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. Since there is no known polynomial-time algorithm for solving large ...
Abstract: In this paper we study the possibilities and advantages of replacing basic operators such as XOR into more complex table functions inside encryption algorithm. We define the E# and RTGE# ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results