Metraipolis › archive › dc_fcd1a53cf2f0

A Content-Aware Pure Permutation with Intrinsic Avalanche Effect: Breaking the Diffusion-Permutation Dichotomy — arXiv:2608.09452

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09452
License (as archived)
CC0-1.0
Archived
2026-10-19T08:58:34.823Z
SHA-256 of the archived text
ec93b3796195700cd6ec89df3be06433fdfbcad9acd952393ccc6d2b4802256f
Stable URL of this page
https://metraipolis.com/documento/dc_fcd1a53cf2f0

How to cite

A Content-Aware Pure Permutation with Intrinsic Avalanche Effect: Breaking the Diffusion-Permutation Dichotomy — arXiv:2608.09452 — arXiv (en), https://arxiv.org/abs/2608.09452 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fcd1a53cf2f0 (Metraipolis archive dc_fcd1a53cf2f0, sha256 ec93b3796195700cd6ec89df3be06433fdfbcad9acd952393ccc6d2b4802256f)
BibTeX
@misc{dcfcd1a53cf2f0,
  title = {A Content-Aware Pure Permutation with Intrinsic Avalanche Effect: Breaking the Diffusion-Permutation Dichotomy — arXiv:2608.09452},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09452},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fcd1a53cf2f0; sha256 ec93b3796195700cd6ec89df3be06433fdfbcad9acd952393ccc6d2b4802256f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09452. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Pixel permutation is a fundamental tool in image processing, image encryption, and data hiding (including watermarking and steganography) that rearranges pixels without changing their values. A common assumption in the literature is that permutation alone cannot create differential sensitivity; changing one pixel merely relocates that pixel in the output, producing no avalanche effect. This paper challenges this by introducing the Triangular Content-Aware Permutation (TCA) algorithm. The method extracts edge points using Canny and applies Delaunay Triangulation to edges and corners, creating a unique partition. Since triangulation is highly sensitive to image geometry, changing a single pixel alters the edge map, resulting in a completely different triangulation and global permutation pattern. Unlike classical dimension-based permutations and advanced content-aware methods (2025-2026), which lack differential sensitivity, TCA increases NPCR from near-zero to 97.10% solely through pixel relocation. Experiments on 50 images show that TCA, with an average of 14.81 iterations, achieves NPCR = 97.10% and UACI = 20.06%, proving pure permutation can create significant differential sensitivity. Conventional methods maintain near-zero NPCR. The iteration threshold varies from 6.4 to 30.7 based on content complexity. Low PSNR (11.93 dB) and near-zero correlation (~10^-3) confirm superior statistical performance. Although slower than classical methods due to triangulation, this is a deliberate trade-off for stronger security. Given the non-analytic, content-dependent nature of the pattern, TCA is ideal for reference-based encryption, fragile watermarking, and non-blind steganography.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-11 in cs.CR).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2608.09452 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T08:54:25.001Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).