dc.contributor.author | Aragona, Riccardo | |
dc.contributor.author | Calderini, Marco | |
dc.contributor.author | Civino, Roberto | |
dc.date.accessioned | 2021-05-25T11:22:42Z | |
dc.date.available | 2021-05-25T11:22:42Z | |
dc.date.created | 2021-01-10T15:17:29Z | |
dc.date.issued | 2020 | |
dc.identifier.issn | 1930-5346 | |
dc.identifier.uri | https://hdl.handle.net/11250/2756273 | |
dc.description.abstract | The study of the trapdoors that can be hidden in a block cipher is and has always been a high-interest topic in symmetric cryptography. In this paper we focus on Feistel-network-like ciphers in a classical long-key scenario and we investigate some conditions which make such a construction immune to the partition-based attack introduced recently by Bannier et al. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | AIMS | en_US |
dc.title | Some group-theoretical results on Feistel Networks in a long-key scenario | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2020 AIMS | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |
dc.identifier.doi | http://dx.doi.org/10.3934/amc.2020093 | |
dc.identifier.cristin | 1868339 | |
dc.source.journal | Advances in Mathematics of Communications | en_US |
dc.source.pagenumber | 727-743 | en_US |
dc.identifier.citation | Advances in Mathematics of Communications. 2020, 14(4): 727-743 | en_US |
dc.source.volume | 14 | en_US |
dc.source.issue | 4 | en_US |