Some group-theoretical results on Feistel Networks in a long-key scenario

December 14, 2019 · Declared Dead · 🏛 Advances in Mathematics of Communications

👻 CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Riccardo Aragona, Marco Calderini, Roberto Civino arXiv ID 1912.06751 Category math.GR Cross-listed cs.CR Citations 4 Venue Advances in Mathematics of Communications Last Checked 1 month ago
Abstract
The study of the trapdoors that can be hidden in a block cipher is and has always been a high-interest topic in symmetric cryptography. In this paper we focus on Feistel-network-like ciphers in a classical long-key scenario and we investigate some conditions which make such a construction immune to the partition-based attack introduced recently by Bannier et al.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — math.GR

Died the same way — 👻 Ghosted