
doi: 10.1007/bfb0034838
A simple network of small s-boxes can be proven secure against differential and linear cryptanalysis. Upperbounds of the differential probabilities and the linear correlations are derived for a generalized Feistel network having 1, 2, 3 or 4 s-boxes in parallel per round. It is conjectured that the results hold in general.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 83 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
