Abstract | ||
---|---|---|
We show the first positive results for the indifferentiability security of the confusion-diffusion networks which are extensively used in the design of block ciphers and hash functions. In particular, our result shows that a constant number of confusion-diffusion rounds is sufficient to extend the domain of a public random permutation. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/978-3-662-49896-5_24 | IACR Cryptology ePrint Archive |
DocType | Volume | ISSN |
Journal | 2015 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yevgeniy Dodis | 1 | 5843 | 277.49 |
Tianren Liu | 2 | 20 | 4.08 |
Martijn Stam | 3 | 1659 | 67.36 |
John P. Steinberger | 4 | 329 | 18.30 |