HomeIssuesAbout a Feistel block cipher generalization

About a Feistel block cipher generalization | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2012. № 3(17).

Generalized Feistel Networks based on shift registers are investigated.The involutivity criterion is proved for the encryption algorithms in this class. The mixingproperties of concerned algorithms are researched using a graph-theoretical approach. Theupper bounds for the diameter and for the exponent of the mixing graph of the appropriatedround function are given.
Download file
Counter downloads: 156
  • Title About a Feistel block cipher generalization
  • Headline About a Feistel block cipher generalization
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 3(17)
  • Date:
  • DOI
Keywords
exponent of a graph, diameter of a graph, mixing graph (matrix) of a transformation, involutivity, Feistel block cipher, экспонент графа, диаметр графа, перемешивающий граф (матрица) преобразования, инволютивность алгоритма шифрования, блочный шифр Фейстеля
Authors
References
Фомичев В. М. Оценки экспонентов примитивных графов / / Прикладная дискретная математика. 2011. №2(12). C. 101-112.
Сачков В. Н., Тараканов В. Е. Комбинаторика неотрицательных матриц. М.: ТВП, 2000. 448 с.
Фомичёв В. М. Методы дискретной математики в криптологии. М.: ДИАЛОГ-МИФИ, 2010. 424 с.
About a Feistel block cipher generalization | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2012. № 3(17).
About a Feistel block cipher generalization | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2012. № 3(17).
Download full-text version
Counter downloads: 247
Download file