2003/08/19 by Liam Wagner, Wagner, Liam
Computer Science · Mathematics · #C.2.0 #Chaos-based Image/Signal Encryption #Cloud Data Security Solutions #Combinatorics (math.CO) #Cryptography and Data Security #Cryptography and Security (cs.CR) #D.4.6 #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #H.2.0 #H.2.7 #cs.CR #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.cs/0308027
openalex publication_date 2003/08/19 · arxiv created 2004/10/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In recent years there has been a great deal of work done on secret sharing scehemes. Secret Sharing Schemes allow for the division of keys so that an authorised set of users may access information. In this paper we wish to present a critical comparison of two of these schemes based on Latin Squares, [Cooper et., al.] and RSA [Shoup]. These two protocols will be examined in terms of their positive and negative aspects of their secuirty.