Una evidencia robusta de que el algoritmo DES fortalecido con una permutación inicial variable es eficiente

Rolando Flores Carapia; Víctor Manuel Silva García; Cornelio Yáñez Márquez; Oscar Camacho Nieto

Una evidencia robusta de que el algoritmo DES fortalecido con una permutación inicial variable es eficiente

Rolando Flores Carapia, Víctor Manuel Silva García, Cornelio Yáñez Márquez, Oscar Camacho Nieto

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

Resumen

By using the JV Theorem, it is possible to associate a number of size 10⁸⁹ to a 64 position permutation in 63 steps. This result has been applied to strengthening the DES algorithm by using a variable initial permutation, increasing the computational complexity of the algorithm, given that each permutation works as a key. However, it still remains to be seen how the variable initial permutation and the 56 bit key work regarding the computational complexity of the algorithm. In the current work, the former question is addressed by proposing a Monte Carlo scheme using the Birthday model for the probability calculation.

Título traducido de la contribución	A robust evidence of the des algorithm strengthened by a variable initial permutation being efficient
Idioma original	Español
Páginas (desde-hasta)	249-254
Número de páginas	6
Publicación	Computacion y Sistemas
Volumen	16
N.º	2
Estado	Publicada - 2012

Palabras clave

Birthday model
DES
JV theorem
Monte Carlo decision model
Variable permutation

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

@article{9d0867b1e84d4dba84863f34cdd5438f,

title = "Una evidencia robusta de que el algoritmo DES fortalecido con una permutaci{\'o}n inicial variable es eficiente",

abstract = "By using the JV Theorem, it is possible to associate a number of size 1089 to a 64 position permutation in 63 steps. This result has been applied to strengthening the DES algorithm by using a variable initial permutation, increasing the computational complexity of the algorithm, given that each permutation works as a key. However, it still remains to be seen how the variable initial permutation and the 56 bit key work regarding the computational complexity of the algorithm. In the current work, the former question is addressed by proposing a Monte Carlo scheme using the Birthday model for the probability calculation.",

keywords = "Birthday model, DES, JV theorem, Monte Carlo decision model, Variable permutation",

author = "Carapia, {Rolando Flores} and Garc{\'i}a, {V{\'i}ctor Manuel Silva} and M{\'a}rquez, {Cornelio Y{\'a}{\~n}ez} and Nieto, {Oscar Camacho}",

year = "2012",

language = "Espa{\~n}ol",

volume = "16",

pages = "249--254",

journal = "Computacion y Sistemas",

issn = "1405-5546",

number = "2",

}

TY - JOUR

T1 - Una evidencia robusta de que el algoritmo DES fortalecido con una permutación inicial variable es eficiente

AU - Carapia, Rolando Flores

AU - García, Víctor Manuel Silva

AU - Márquez, Cornelio Yáñez

AU - Nieto, Oscar Camacho

PY - 2012

Y1 - 2012

N2 - By using the JV Theorem, it is possible to associate a number of size 1089 to a 64 position permutation in 63 steps. This result has been applied to strengthening the DES algorithm by using a variable initial permutation, increasing the computational complexity of the algorithm, given that each permutation works as a key. However, it still remains to be seen how the variable initial permutation and the 56 bit key work regarding the computational complexity of the algorithm. In the current work, the former question is addressed by proposing a Monte Carlo scheme using the Birthday model for the probability calculation.

AB - By using the JV Theorem, it is possible to associate a number of size 1089 to a 64 position permutation in 63 steps. This result has been applied to strengthening the DES algorithm by using a variable initial permutation, increasing the computational complexity of the algorithm, given that each permutation works as a key. However, it still remains to be seen how the variable initial permutation and the 56 bit key work regarding the computational complexity of the algorithm. In the current work, the former question is addressed by proposing a Monte Carlo scheme using the Birthday model for the probability calculation.

KW - Birthday model

KW - DES

KW - JV theorem

KW - Monte Carlo decision model

KW - Variable permutation

UR - http://www.scopus.com/inward/record.url?scp=84871346703&partnerID=8YFLogxK

M3 - Artículo

AN - SCOPUS:84871346703

SN - 1405-5546

VL - 16

SP - 249

EP - 254

JO - Computacion y Sistemas

JF - Computacion y Sistemas

IS - 2

ER -

Una evidencia robusta de que el algoritmo DES fortalecido con una permutación inicial variable es eficiente

Resumen

Palabras clave

Otros archivos y enlaces

Huella

Citar esto