Parallelizing Shamir's Secret Sharing Algorithm

This paper describes how Shamir's secret sharing algorithm can be parallelized, decreasing the time required to generate key shares for secrets shared among a large group of participants. Using an open-source C implementation of Shamir's algorithm and the OpenMP multiprocessing programming interface, we parallelized regions of the algorithm and reduced execution time significantly. We were able to see near-linear speedup in both the key share generation phase and the re-combining phase. We also observed weak scaling when generating the key shares. Our work enables more efficient secret sharing using Shamir's algorithm.