<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Belyavskaya, G.B.</creatorName>
</creator>
</creators>
<titles>
<title xml:lang='ro'>Secret-sharing schemes and orthogonal systems of k-ary operations</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2009</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-2848</relatedIdentifier>
<dates>
<date dateType='Issued'>2009-07-01</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>We suggest a general method of the construction of secret-sharing schemesbased on orthogonal systems of partial (in particular, everywhere determined) k-ary operations which generalizes some known methods of the construction of such schemes by a nite elds and point the orthogonal systems of k-ary operations respecting to these known schemes. The dierent transformations of orthogonal systems of k-ary operations are reformulated and applied to orthogonal systems of polynomial k-ary operations over nite elds, in particular, to orthogonal systems corresponding to some known schemes.</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>