On Generalized Feistel Networks
- 1 January 2010
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2010, 613-630
- https://doi.org/10.1007/978-3-642-14623-7_33
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Format-Preserving EncryptionLecture Notes in Computer Science, 2009
- Indistinguishability AmplificationPublished by Springer Science and Business Media LLC ,2007
- The Security of Many-Round Luby-Rackoff Pseudo-Random PermutationsLecture Notes in Computer Science, 2003
- Ciphers with Arbitrary Finite DomainsLecture Notes in Computer Science, 2002
- A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation GeneratorsPublished by Springer Science and Business Media LLC ,2001
- How to Construct Pseudo-random Permutations from Pseudo-random FunctionsPublished by Springer Science and Business Media LLC ,2000
- Generalized birthday attacks on unbalanced Feistel networksPublished by Springer Science and Business Media LLC ,1998
- Faster Luby-Rackoff ciphersLecture Notes in Computer Science, 1996
- Two practical and provably secure block ciphers: BEAR and LIONLecture Notes in Computer Science, 1996
- Some cryptographic techniques for machine-to-machine data communicationsProceedings of the IEEE, 1975