Diffusion analysis af a scalable fiestel network
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/3256/ http://dblp.dagstuhl.de/db/conf/wec/wec2005i.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1845470856934850560 |
|---|---|
| author | Ibrahim, Subariah Maarof, Mohd. Aizaini |
| author_facet | Ibrahim, Subariah Maarof, Mohd. Aizaini |
| author_sort | Ibrahim, Subariah |
| building | UTM Library |
| collection | Institutional Repository |
| content_provider | Universiti Teknologi Malaysia |
| content_source | UTM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | 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. |
| format | Conference or Workshop Item |
| id | my.utm.eprints-3256 |
| institution | Universiti Teknologi Malaysia |
| publishDate | 2005 |
| record_format | eprints |
| spelling | my.utm.eprints-32562017-08-30T08:14:46Z http://eprints.utm.my/3256/ Diffusion analysis af a scalable fiestel network Ibrahim, Subariah Maarof, Mohd. Aizaini QA75 Electronic computers. Computer science 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. 2005-04 Conference or Workshop Item PeerReviewed 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. http://dblp.dagstuhl.de/db/conf/wec/wec2005i.html |
| spellingShingle | QA75 Electronic computers. Computer science Ibrahim, Subariah Maarof, Mohd. Aizaini Diffusion analysis af a scalable fiestel network |
| title | Diffusion analysis af a scalable fiestel network |
| title_full | Diffusion analysis af a scalable fiestel network |
| title_fullStr | Diffusion analysis af a scalable fiestel network |
| title_full_unstemmed | Diffusion analysis af a scalable fiestel network |
| title_short | Diffusion analysis af a scalable fiestel network |
| title_sort | diffusion analysis af a scalable fiestel network |
| topic | QA75 Electronic computers. Computer science |
| url | http://eprints.utm.my/3256/ http://dblp.dagstuhl.de/db/conf/wec/wec2005i.html |
| url_provider | http://eprints.utm.my/ |