Classification of 4-bit S-Boxes for BOGI Permutation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Seonggyeom | - |
dc.contributor.author | Hong, Deukjo | - |
dc.contributor.author | Sung, Jaechul | - |
dc.contributor.author | Hong, Seokhie | - |
dc.date.accessioned | 2021-08-31T16:09:28Z | - |
dc.date.available | 2021-08-31T16:09:28Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/59023 | - |
dc.description.abstract | Bad Output must go to Good Input (BOGI) is the primary design strategy of GIFT, a lightweight block cipher that was presented at CHES 2017. Because this strategy obviates the need to adhere to the required conditions of S-boxes when adopting bit-permutation, cryptographic designers have more S-box choices. In this paper, we classify all 4-bit S-boxes that support BOGI, called ``BOGI-applicable S-boxes,'' and evaluate them in terms of the cryptographic strength and efficiency. First, we exhaustively show that only 2413 Permutation-XOR-Equivalence (PXE) classes over 4-bit S-boxes are BOGI-applicable. After refining the PXE classes with respect to the differential uniformity (U) and linearity (L), we suggest 20 "Optimal BOGI-applicable'' PXE classes that provide the best (U, L). Our security evaluations revealed that all optimal BOGI-applicable S-boxes fulfill the security properties considered by the designers of GIFT and that the differences between them exist in the other properties. Moreover, we explore the resistance of GIFT variants against differential and linear cryptanalysis by replacing the existing S-box with other optimal BOGI-applicable S-boxes. Based on the results, we identify the best attainable resistance with the bitpermutation of GIFT-64. Lastly, we suggest notable S-boxes that support competitive performance, jointly considering the cryptographic strength and efficiency for GIFT-64 and GIFT-128 structures, respectively. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | NONLINEAR INVARIANT ATTACK | - |
dc.subject | LIGHTWEIGHT | - |
dc.subject | CRYPTANALYSIS | - |
dc.title | Classification of 4-bit S-Boxes for BOGI Permutation | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hong, Seokhie | - |
dc.identifier.doi | 10.1109/ACCESS.2020.3039273 | - |
dc.identifier.scopusid | 2-s2.0-85096822393 | - |
dc.identifier.wosid | 000595980800001 | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.8, pp.210935 - 210949 | - |
dc.relation.isPartOf | IEEE ACCESS | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 8 | - |
dc.citation.startPage | 210935 | - |
dc.citation.endPage | 210949 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | NONLINEAR INVARIANT ATTACK | - |
dc.subject.keywordPlus | LIGHTWEIGHT | - |
dc.subject.keywordPlus | CRYPTANALYSIS | - |
dc.subject.keywordAuthor | S-box | - |
dc.subject.keywordAuthor | lightweight implementation | - |
dc.subject.keywordAuthor | BOGI | - |
dc.subject.keywordAuthor | equivalence class | - |
dc.subject.keywordAuthor | cryptography | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
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.