Skip to main content
. 2025 Dec 12;16:2489. doi: 10.1038/s41598-025-32227-z

Fig. 3.

Fig. 3

Scalability analysis of the RSA–Hilbert block secret-sharing encryption. Encryption time increases linearly with block size, confirming the parallelizable design. Higher Hilbert orders show moderately higher computation cost due to matrix inversion complexity.