Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
![]() |
![]() ![]() |
Ultima descărcare din IBN: 2021-05-24 17:48 |
Căutarea după subiecte similare conform CZU |
512.552.18+512.548.7+512.624.95 (1) |
Алгебра (413) |
![]() MOLDOVYAN, Nikolay. Signature Schemes on Algebras, Satisfying Enhanced Criterion of Post-quantum Security. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2020, nr. 2(93), pp. 62-67. ISSN 1024-7696. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | ||||||
Numărul 2(93) / 2020 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
CZU: 512.552.18+512.548.7+512.624.95 | ||||||
MSC 2010: 94A60, 16Z05, 14G50, 11T71, 16S50. | ||||||
Pag. 62-67 | ||||||
|
||||||
![]() |
||||||
Rezumat | ||||||
The paper introduces an enhanced criterion of the post-quantum security for designing post-quantum digital signature schemes based on the hidden discrete logarithm problem. The proposed criterion requires that it is computationally impossible to construct a periodic function containing a period whose length depends on the value of a discrete logarithm in a hidden cyclic group when using public parameters of the signature scheme. A practical post-quantum signature scheme which satisfies the criterion is proposed. |
||||||
Cuvinte-cheie finite associative algebra, non-commutative algebra, discrete logarithm problem, hidden logarithm problem, Post-quantum cryptography, Digital signature |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-110205</cfResPublId> <cfResPublDate>2020-09-18</cfResPublDate> <cfVol>93</cfVol> <cfIssue>2</cfIssue> <cfStartPage>62</cfStartPage> <cfISSN>1024-7696</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/110205</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Signature Schemes on Algebras, Satisfying Enhanced Criterion of Post-quantum Security</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>finite associative algebra; non-commutative algebra; discrete logarithm problem; hidden logarithm problem; Post-quantum cryptography; Digital signature</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>The paper introduces an enhanced criterion of the post-quantum security for designing post-quantum digital signature schemes based on the hidden discrete logarithm problem. The proposed criterion requires that it is computationally impossible to construct a periodic function containing a period whose length depends on the value of a discrete logarithm in a hidden cyclic group when using public parameters of the signature scheme. A practical post-quantum signature scheme which satisfies the criterion is proposed.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2020-09-18T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2020-09-18T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-29438</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2020-09-18T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-29438</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-29438-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2020-09-18T24:00:00</cfStartDate> <cfFamilyNames>Moldovyan</cfFamilyNames> <cfFirstNames>Nikolay</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>