摘要: An exact value of round functions collision probability for 3-round Feistel network is derived. The upper bound of algorithm execution complexity for distinguishing Feistel network from a random permutation is given.
| 作者 | Oliynykov, Roman Gorbenko, Ivan Dolgov, Victor Kaidalov, Dmytro | ||
|---|---|---|---|
| 作者单位 | |||
| 文集名称 | Proceedings of the 2011 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems : Technology and Applications | ||
| 出版年 | 2011 | ||
| 页码 | p.743-746 | 开始页/总页数 | 00000743 / 4 |
| 会议日期/会议地点 | c2011 / Prague(CS) | 会议年/会议届次 | 2011 / 6th |
| 中图分类号 | TP3 | ||
| 关键词 | Feistel network cryptography random permutation symmetric block cipher | ||
| 馆藏号 | IEL16503 (6072809) | ||
