Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions
From MaRDI portal
Publication:832348
DOI10.1007/978-3-030-81652-0_11zbMATH Open1485.94119OpenAlexW3089783068MaRDI QIDQ832348FDOQ832348
Authors: Arnab Roy, Jan Ferdinand Sauer, E. A. Andreeva 
Publication date: 25 March 2022
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000124048/88892811
Recommendations
- Improved interpolation attacks on cryptographic primitives of low algebraic degree
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- Attacks on block ciphers of low algebraic degree
- The interpolation attack on block ciphers
- Unbalanced Feistel networks and block cipher design
Cites Work
- Modern computer algebra
- Roots of random polynomials over a finite field
- The interpolation attack on block ciphers
- Ciphers for MPC and FHE
- The complexity of evaluating interpolation polynomials
- Improved interpolation attacks on cryptographic primitives of low algebraic degree
- 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
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- New Cryptanalysis of Block Ciphers with Low Algebraic Degree
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
Cited In (3)
Uses Software
This page was built for publication: Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832348)
