Ibrahim, Subariah and Maarof, Mohd Aizaini
(2005)
*Diffusion analysis af a scalable fiestel network.*
In: 3rd World Enformatika Conference, April 27-29, 2005, Istanbul, Turkey.

Full text not available from this repository.

## Abstract

A generalization of the concepts of Feistel Networks (FN), known as Extended Feistel Network (EFN) is examined. EFN split the input blocks into n > 2 sub-blocks. Like conventional FN, EFN consists of a series of rounds whereby at least one sub-block is subjected to an F function. The function plays a key role in the diffusion process due to its completeness property. It is also important to note that in EFN the F-function is the most computationally expensive operation in a round. The aim of this paper is to determine a suitable type of EFN for a scalable cipher. This is done by analyzing the threshold number of rounds for different types of EFN to achieve the completeness property as well as the number of F-function required in the network. The work focuses on EFN-Type I, Type II and Type III only. In the analysis it is found that EFN-Type II and Type III diffuses at the same rate and both are faster than Type-I EFN. Since EFN-Type-II uses less F functions as compared to EFN-Type III, therefore Type II is the most suitable EFN for use in a scalable cipher.

Item Type: | Conference or Workshop Item (Paper) |
---|---|

Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |

Divisions: | Computer Science and Information System (Formerly known) |

ID Code: | 3256 |

Deposited By: | Subariah Ibrahim |

Deposited On: | 24 May 2007 08:15 |

Last Modified: | 24 May 2007 08:21 |

Repository Staff Only: item control page