A Comparison of Secret Sharing Schemes Based on Latin Squares and RSA

Simple item page
dc.creatorWagner, Liam
dc.date2003-08-19
dc.date2004-10-16
dc.date.accessioned2026-07-07T03:20:14Z
dc.date.available2026-07-07T03:20:14Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0308027
dc.identifierhttp://arxiv.org/abs/cs/0308027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31754
dc.subjectCryptography and Security
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.subjectC.2.0; D.4.6; H.2.0;H.2.7
dc.titleA Comparison of Secret Sharing Schemes Based on Latin Squares and RSA
dc.typetext

Files

Collections

arXiv