Cited 0 time in
On constructing of a 32 × 32 binary matrix as a diffusion layer for a 256-bit block cipher
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Koo, Bon Wook | - |
| dc.contributor.author | Jang, Hwan Seok | - |
| dc.contributor.author | Song, Jung Hwan | - |
| dc.date.accessioned | 2022-12-21T09:39:27Z | - |
| dc.date.available | 2022-12-21T09:39:27Z | - |
| dc.date.issued | 2006-12 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.issn | 1611-3349 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/180634 | - |
| dc.description.abstract | In this paper, we describe how to construct a 32 ×32 binary matrix of branch number 10, and use some mathematical techniques to find a form in product of matrices for increasing efficiency in software implementations of the binary matrix. We estimate a security against cryptanlysis when the binary matrix is used as a diffusion layer of a 256-bit SPN block cipher with an 8-bit s-box as a substitution layer in a round function. Also we describe the cryptanalytic properties such as the resistances to differential, linear, impossible differential, and truncated differential cryptanalysis. The number of operations to be required for implementing the binary matrix as a diffusion layer of a 256-bit SPN block cipher are given in this paper. We have a result that the binary matrix A is more efficient than the diffusion layer used Rijndael-256 on low bit platforms, such as 8-bit processors. | - |
| dc.format.extent | 14 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Springer Verlag | - |
| dc.title | On constructing of a 32 × 32 binary matrix as a diffusion layer for a 256-bit block cipher | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1007/11927587_7 | - |
| dc.identifier.scopusid | 2-s2.0-34547458718 | - |
| dc.identifier.bibliographicCitation | Lecture Notes in Computer Science, v.4296 LNCS, pp 51 - 64 | - |
| dc.citation.title | Lecture Notes in Computer Science | - |
| dc.citation.volume | 4296 LNCS | - |
| dc.citation.startPage | 51 | - |
| dc.citation.endPage | 64 | - |
| dc.type.docType | Conference Paper | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Computational complexity | - |
| dc.subject.keywordPlus | Number theory | - |
| dc.subject.keywordPlus | Public key cryptography | - |
| dc.subject.keywordPlus | Security of data | - |
| dc.subject.keywordPlus | Binary matrix | - |
| dc.subject.keywordPlus | Block cipher | - |
| dc.subject.keywordPlus | Diffusion layer | - |
| dc.subject.keywordPlus | Binary sequences | - |
| dc.subject.keywordAuthor | Block cipher | - |
| dc.subject.keywordAuthor | Diffusion layer | - |
| dc.subject.keywordAuthor | Hinary matrix | - |
| dc.subject.keywordAuthor | SPN | - |
| dc.identifier.url | https://link.springer.com/chapter/10.1007/11927587_7 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
