UCSY's Research Repository

Comparing Cryptographic Algorithms in Scalable Feistel Networks

Show simple item record

dc.contributor.author Myo, Khin Yupar
dc.date.accessioned 2019-07-12T03:51:46Z
dc.date.available 2019-07-12T03:51:46Z
dc.date.issued 2010-12-16
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/808
dc.description.abstract Scalability of symmetric cipher is still not as natural as for public-key cryptosystems. Most of the current block ciphers do not support freely variable block and key lengths. A generalization of the concepts of Feistel Networks (FN), known as Extended Feistel Network (EFN), that splits the input blocks into n>2 sub-blocks. EFN consists of a series of rounds whereby at least one sub-block is subjected to an F function. The aim of this system compares the performance of scalable Extended Feistel Network by using a variety of file sizes. This is done by compare RC6 that uses EFN-Type II and MARS that uses EFN-Type III encryption algorithms. en_US
dc.language.iso en en_US
dc.publisher Fifth Local Conference on Parallel and Soft Computing en_US
dc.title Comparing Cryptographic Algorithms in Scalable Feistel Networks en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account