Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions
From MaRDI portal
Publication:832348
DOI10.1007/978-3-030-81652-0_11zbMath1485.94119OpenAlexW3089783068MaRDI QIDQ832348
Arnab Roy, Jan Ferdinand Sauer, Elena Andreeva
Publication date: 25 March 2022
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000124048/88892811
Uses Software
Cites Work
- Improved interpolation attacks on cryptographic primitives of low algebraic degree
- Roots of random polynomials over a finite field
- The complexity of evaluating interpolation polynomials
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Feistel structures for MPC, and more
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- Modern Computer Algebra
- Ciphers for MPC and FHE
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
- New Cryptanalysis of Block Ciphers with Low Algebraic Degree
- The interpolation attack on block ciphers
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
This page was built for publication: Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions
