Improved differential cryptanalysis on Generalized Feistel Schemes
Nachef et al. used differential cryptanalysis to study four types of Generalized Feistel Scheme (GFS). They gave the lower bound of maximum number of rounds that is indistinguishable from a random permutation. In this paper, we study the security of several types of GFS by exploiting the asymmetric...
Saved in:
Main Authors: | , , |
---|---|
其他作者: | |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2019
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/104475 http://hdl.handle.net/10220/49998 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|