Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
830 2 |
Ultima descărcare din IBN: 2018-04-23 17:01 |
Căutarea după subiecte similare conform CZU |
004.056.55+517.958+530.145 (1) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4283) |
Ecuații diferențiale. Ecuații integrale. Alte ecuații funcționale. Diferențe finite. Calculul variațional. Analiză funcțională (243) |
Fizică (1749) |
SM ISO690:2012 MOLDOVYAN, Nikolay, MOLDOVYAN, Alexandr, SHCHERBACOV, Victor. Post-quantum No-key Protocol. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2017, nr. 3(85), pp. 115-119. ISSN 1024-7696. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | ||||||
Numărul 3(85) / 2017 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
CZU: 004.056.55+517.958+530.145 | ||||||
MSC 2010: 94A60, 11S05. | ||||||
Pag. 115-119 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
There is proposed three-pass no-key protocol that is secure to hypothetic attacks based on computations with using quantum computers. The main operations are multiplication and exponentiation in finite ground field GF(p). Sender and receiver of secret message also use representation of some value c ∈ GF(p) as product of two other values R1 ∈ GF(p) and R2 ∈ GF(p) one of which is selected at random. Then the values R1 and R2 are encrypted using different local keys. |
||||||
Cuvinte-cheie Post-quantum cryptography, computationally difficult problem, discrete logarithm, commutative encryption, conjugacy search problem, nokey protocol. |
||||||
|
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, N.A.</creatorName> <affiliation>St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, Rusia</affiliation> </creator> <creator> <creatorName>Moldovyan, A.A.</creatorName> <affiliation>ITMO University, Rusia</affiliation> </creator> <creator> <creatorName>Şcerbacov, V.A.</creatorName> <affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Post-quantum No-key Protocol</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2017</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier> <subjects> <subject>Post-quantum cryptography</subject> <subject>computationally difficult problem</subject> <subject>conjugacy search problem</subject> <subject>discrete logarithm</subject> <subject>commutative encryption</subject> <subject>nokey protocol.</subject> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>004.056.55+517.958+530.145</subject> </subjects> <dates> <date dateType='Issued'>2017-12-30</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><p>There is proposed three-pass no-key protocol that is secure to hypothetic attacks based on computations with using quantum computers. The main operations are multiplication and exponentiation in finite ground field GF(p). Sender and receiver of secret message also use representation of some value c ∈ GF(p) as product of two other values R1 ∈ GF(p) and R2 ∈ GF(p) one of which is selected at random. Then the values R1 and R2 are encrypted using different local keys.</p></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>