An efficient implementation of the Shamir secret sharing scheme
Information Theory
2021-08-16 v1 Cryptography and Security
math.IT
Abstract
The Shamir secret sharing scheme requires a Maximum Distance Separable (MDS) code, and in its most common implementation, a Reed-Solomon (RS) code is used. In this paper, we observe that the encoding procedure can be made simpler and faster by dropping the MDS condition and specifying the possible symbols that can be shared. In particular, the process can be made even faster by using array codes based on XOR operations instead of RS codes.
Keywords
Cite
@article{arxiv.2108.05982,
title = {An efficient implementation of the Shamir secret sharing scheme},
author = {Allyson Hineman and Mario Blaum},
journal= {arXiv preprint arXiv:2108.05982},
year = {2021}
}