JP Journal of Algebra, Number Theory and Applications
Volume 16, Issue 2, Pages 161 - 172
(March 2010)
|
|
REDUCING COMPUTATIONAL COMPLEXITY FOR 192 BITS SPN ENCRYPTION ALGORITHMS WITH VARIABLE PERMUTATION
V. M. Silva-Garc�a, R. Flores-Carapia, I. L�pez-Y��ez and C. Renter�a-M�rquez
|
Abstract: Accordingtothe JV theorem, a permutation can be associated to a positive integer. In particular, in order to obtain a permutation on the positions of a 192 bits string, we usually work on numbers of roughly �However, in this work, the Factorial theorem � which states that any permutation of length L can be built from 3 permutations on strings of length �where L is a multiple of 3 � is presented and proved. This results in a reduction of numbers, for 192 bits strings from �to roughly �This implies savings on time and computational resources. |
Keywords and phrases: JV theorem, factorial theorem, SPN criptosystem, 192-criptosystem, variable permutation. |
|
Number of Downloads: 407 | Number of Views: 945 |
|