首页|New Symmetric Cryptology Research from University of Rennes Described (Equivalen ce of Generalised Feistel Networks)
New Symmetric Cryptology Research from University of Rennes Described (Equivalen ce of Generalised Feistel Networks)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News Daily News – Investigators publish new report on sy mmetric cryptology. According to news reporting out of Rennes, France, by NewsRx editors, research stated, “This paper focuses on equivalences between Generalis ed Feistel Networks (GFN) of type-II.” Our news correspondents obtained a quote from the research from University of Re nnes: “We introduce a new definition of equivalence which captures the concept t hat two GFNs are identical up to re-labelling of the inputs/outputs, and give a procedure to test this equivalence relation. Such two GFNs are therefore cryptog raphically equivalent for several classes of attacks. It induces a reduction o t he space of possible GFNs: the set of the (k!)2 possible even-odd GFNs with 2k b ranches can be partitioned into k! different classes. This result can be very us eful when looking for an optimal GFN regarding specific computationally intensiv e properties, such as the minimal number of active S-boxes in a differential tra il. We also show that in several previous papers, many GFN candidates are redund ant as they belong to only a few classes. Because of this reduction of candidate s, we are also able to suggest better permutations than the one of WARP: they re ach 64 active S-boxes in one round less and still have the same diffusion round that WARP.”
University of RennesRennesFranceEu ropeMachine LearningSymmetric Cryptology
NETL
NSTL
