Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/7107
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFARAJ, SUFYAN T.-
dc.date.accessioned2022-10-27T06:47:43Z-
dc.date.available2022-10-27T06:47:43Z-
dc.date.issued2007-
dc.identifier.issn1991-8941-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/7107-
dc.description.abstractIn this work, we present some deeper insights in the state-of-the-art in block cipher design. This is mainly achieved by assessment of the evaluation process of the AES (Advanced Encryption Standard). We conclude (with may be a little bit surprising result) that the required security level, for a block cipher to be used for the present and foreseeable future, may be underestimated during AES evaluation. In accordance, we propose a new block cipher that we call Nahrainfish, which we believe that it offers the required security level without a big sacrifice in efficiency and other related criteria. Instead of building Nahrainfish totally from scratch, we have made a benefit mainly from some AES finalists to develop the new cipher by an overengineering approach leading to the required higher security level. Nahrainfish is a classical Feistel network based on a novel combination of both key-dependent S-boxes and data-dependent rotations. It operates on 128-bit blocks and accepts a variable key length up to 1024 bits. The paper also includes some important notes on the security and performance of the cipher.en_US
dc.language.isoenen_US
dc.publisherJ. of al-anbar university for pure scienceen_US
dc.relation.ispartofseries1;2-
dc.subjectAESen_US
dc.subjectBlock ciphersen_US
dc.subjectDESen_US
dc.subjectFeistel networksen_US
dc.subjectNahrainfishen_US
dc.titleA NEW BLOCK CIPHER (NAHRAINFISH) BASED ON SOME AES FINALISTSen_US
dc.typeArticleen_US
Appears in Collections:قسم نظم المعلومات

Files in This Item:
File Description SizeFormat 
1f936ea4abc07ba2.pdf223.76 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.