2021/08/12 by Allyson Hineman, Mario Blaum, Hineman, Allyson +1
Computer Science · Mathematics · #Advanced Data Storage Technologies #Chaos-based Image/Signal Encryption #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.CR #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.2108.05982
arxiv created 2021/08/12 · openalex publication_date 2021/08/12 · arxiv updated 2021/08/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.