A GPU implementation of secret sharing scheme based on cellular automata

Secret sharing (SS) schemes based on cellular automata (CA) are considered as secure encrypting algorithms, where several secret data can be shared among some persons. Recently the SS schemes can be applied to solve real-world problems, such as security in cloud computing. The principal obstacle of use of the SS scheme is its considerably high computational cost; especially if a large amount of secret data must be encrypted and shared. In this work, we propose a parallel CA-based SS scheme suitable for any kinds of digital data in the graphic processing unit using compute unified device architecture technology. The uses of global memory and shared memory are analyzed from computational effectiveness and security points of view. The experimental results show the proposed parallel implementation provides a speedup rate more than 18-fold compared with its sequential implementation. Also we show the increase of the security level of the parallel implementation with respect to the sequential implementation.