Cryptography, Coding Theory, Post-quantum
Information set decoding in the sum-cover metric and density results
Due to the recent advances in quantum computers, the search for cryptosystems that survive quantum attacks is of great interest. There are many open questions and challenges.
Generalizing the paper https://arxiv.org/pdf/2205.12738.pdf we can consider the sum-cover metric and its applications to cryptography. More in detail, this would possibly contain:
- computing the Gilbert-Varshamov bound,
- how likely it is that codes attain the Gilbert-Varshamov bound,
- the Singleton bound,
- how likely it is that a code attains the Singleton bound,
- Information set decoding algorithms.
Security in communications and storage