Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorJohnson, Laura M.
dc.contributor.authorPerkins, Stephanie
dc.date.accessioned2021-02-01T11:30:07Z
dc.date.available2021-02-01T11:30:07Z
dc.date.issued2021-01-31
dc.identifier.citationJohnson , L M & Perkins , S 2021 , ' A discussion of a cryptographical scheme based in F -critical sets of a Latin square ' , Mathematics , vol. 9 , no. 3 , 285 . https://doi.org/10.3390/math9030285en
dc.identifier.issn2227-7390
dc.identifier.otherPURE: 272643413
dc.identifier.otherPURE UUID: 0c784c97-f72d-4474-93e7-7ca8dc5686a8
dc.identifier.otherBibtex: math9030285
dc.identifier.otherScopus: 85100496452
dc.identifier.otherWOS: 000615414500001
dc.identifier.otherORCID: /0000-0001-8696-4801/work/107287343
dc.identifier.urihttps://hdl.handle.net/10023/21352
dc.description.abstractThis communication provides a discussion of a scheme originally proposed by Falcón in a paper entitled “Latin squares associated to principal autotopisms of long cycles. Applications in cryptography”. Falcón outlines the protocol for a cryptographical scheme that uses the F-critical sets associated with a particular Latin square to generate access levels for participants of the scheme. Accompanying the scheme is an example, which applies the protocol to a particular Latin square of order six. Exploration of the example itself, revealed some interesting observations about both the structure of the Latin square itself and the autotopisms associated with the Latin square. These observations give rise to necessary conditions for the generation of the F-critical sets associated with certain autotopisms of the given Latin square. The communication culminates with a table which outlines the various access levels for the given Latin square in accordance with the scheme detailed by Falcón.
dc.language.isoeng
dc.relation.ispartofMathematicsen
dc.rightsCopyright:© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and con-ditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).en
dc.subjectF-critical setsen
dc.subjectLatin squaresen
dc.subjectLatin subsquareen
dc.subjectIntercalateen
dc.subjectSecret sharing schemeen
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subjectNISen
dc.subject.lccQAen
dc.titleA discussion of a cryptographical scheme based in F-critical sets of a Latin squareen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.identifier.doihttps://doi.org/10.3390/math9030285
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record