Steganographic information hiding via symmetric numerical semigroups
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915772943564800 |
|---|---|
| author | Pain, Jean-Christophe |
| author_facet | Pain, Jean-Christophe |
| contents | We introduce a steganographic information hiding scheme based on structural properties of numerical semigroups arising from the Frobenius coin problem. Instead of encoding data through representable integers, the proposed protocol embeds information into the gap structure of carefully chosen symmetric numerical semigroups. Symmetry guarantees a balanced gap density, ensuring that encoded values are statistically indistinguishable from uniform numerical noise to an observer lacking the private generating set. The security of the scheme relies on the assumed average-case hardness of numerical semigroup membership inference for hidden generators, offering a novel number-theoretic primitive for covert communication and post-quantum resilient information hiding. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_04052 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Steganographic information hiding via symmetric numerical semigroups Pain, Jean-Christophe Combinatorics Number Theory We introduce a steganographic information hiding scheme based on structural properties of numerical semigroups arising from the Frobenius coin problem. Instead of encoding data through representable integers, the proposed protocol embeds information into the gap structure of carefully chosen symmetric numerical semigroups. Symmetry guarantees a balanced gap density, ensuring that encoded values are statistically indistinguishable from uniform numerical noise to an observer lacking the private generating set. The security of the scheme relies on the assumed average-case hardness of numerical semigroup membership inference for hidden generators, offering a novel number-theoretic primitive for covert communication and post-quantum resilient information hiding. |
| title | Steganographic information hiding via symmetric numerical semigroups |
| topic | Combinatorics Number Theory |
| url | https://arxiv.org/abs/2602.04052 |