Non-commutative finite groups as primitive of public key cryptosystems

Moldovyan Dmitriy

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

1020

Ultima descărcare din IBN:
2023-09-16 13:38

SM ISO690:2012

MOLDOVYAN, Dmitriy. Non-commutative finite groups as primitive of public key cryptosystems. In: Quasigroups and Related Systems, 2010, vol. 18, nr. 2(24), pp. 165-176. ISSN 1561-2848.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Quasigroups and Related Systems

Volumul 18, Numărul 2(24) / 2010 / ISSN 1561-2848

Non-commutative finite groups as primitive of public key cryptosystems

Pag. 165-176

Moldovyan Dmitriy

Russian Academy of Sciences

Disponibil în IBN: 16 decembrie 2013

Descarcă PDF

Rezumat

A new computationally dicult problem dene over non-commutative nite groups is proposed as cryptographic primitive. Finite non-commutative rings of the four-dimension vectors over the ground eld are dened with the vector multiplication operations of dierent types. Non-commutative multiplicative groups of the rings are applied to design public key cryptoschemes based on the proposed dicult problem.

Cuvinte-cheie
dificult problem, non-commutative group, public key distribution,

automorphism, finite group

DataCite XML Export

<?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>Moldovyan, D.N.</creatorName>
<affiliation>Academia de Ştiinţe a Federaţiei Ruse, Rusia</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Non-commutative finite groups as primitive of public key cryptosystems</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2010</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-2848</relatedIdentifier>
<subjects>
<subject>dificult problem</subject>
<subject>automorphism</subject>
<subject>non-commutative group</subject>
<subject>finite group</subject>
<subject>public key distribution</subject>
</subjects>
<dates>
<date dateType='Issued'>2010-08-03</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>A new computationally dicult problem dene over non-commutative
nite groups is proposed as cryptographic primitive. Finite non-commutative rings of the four-dimension vectors over the ground eld are dened with the vector multiplication operations of dierent types. Non-commutative multiplicative groups of the rings are
applied to design public key cryptoschemes based on the proposed dicult problem.</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>