Answers are grounded in this paper and cite their sources.
It turned out that in addition to problems with classical asymmetric cryptography in the post-quantum period, there are certain doubts about the strength of symmetric cryptographic schemes. This paper demonstrates that on Type III Generalized Feistel Scheme (GFS), by selectively fixing specific parts of the plaintext at the input to the GFS, it is possible to reduce the problem of distinguishing between random text and encrypted output of the same GFS to the Simon problem through different approaches.
No takes yet. Share an insight, caveat, or question.
Fesenko et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: