Accelerated Multisecret Sharing Scheme Using Fast Matrix Spectral Factorization

In this paper, we propose a novel multisecret sharing (MSS) scheme that integrates a recently developed exponential-speedup matrix spectral factorization algorithm into the construction of paraunitary matrices over finite fields. By exploiting the block-matrix generalization of the Janashia-Lagvilava method, we significantly enhance the efficiency and scalability of the MSS scheme. The proposed method ensures perfect secrecy, collusion resistance, and efficient reconstruction, while enabling practical deployment in large-scale distributed systems such as secure cloud storage, IoT networks, and blockchain authentication. Security and performance analyses demonstrate the superiority of the new approach over existing MSS schemes.