Analysis of Edge Length Distribution of Crypto-Compressed 3D Objects
In order to remain format compliant, cryptocompression of 3D objects is a very smart solution to guarantee both a high compression rate and a very high level of security. In this article, we present the analysis of a crypto-compression method based on the Draco format proposed by Google. The proposed analysis consists to analyze the distribution of edge lengths of crypto-compressed 3D objects as a function of the number of bits encrypted for each vertex. Experimental results, based on the Kolmogorov-Smirnov test, show that 5-bit encryption per vertex coordinate achieves an optimal trade-off between security and compression efficiency.
Authors
- Jean-Pierre Pedeboy
- William Puech (ORCID: https://orcid.org/0000-0001-9383-2401)
- Khélian Larvet
Institutions
- Centre National de la Recherche Scientifique (FR)
- Université de Montpellier (FR)
- Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier (FR)
Publication Details
- Published
- 2025-10-13
- DOI
- https://doi.org/10.1109/euvip66349.2025.11238645
- Primary Topic
- Chaos-based Image/Signal Encryption
- Type
- article
- Field-Weighted Citation Impact
- 0.00