{"title":"非交换代数上的后量子盲签名协议","authors":"Minh N.H, Moldovyan D.N, et al.","doi":"10.15625/1813-9663/37/4/16023","DOIUrl":null,"url":null,"abstract":"A method for constructing a blind signature scheme based on a hidden discrete logarithm problem defined in finite non-commutative associative algebras is proposed. Blind signature protocols are constructed using four-dimensional and six-dimensional algebras defined over a ground finite field GF(p) and containing a global two-sided unit as an algebraic support. The basic properties of the used algebra, which determine the choice of protocol parameters, are described.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"81 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"POST-QUANTUM BLIND SIGNATURE PROTOCOL ON NON-COMMUTATIVE ALGEBRAS\",\"authors\":\"Minh N.H, Moldovyan D.N, et al.\",\"doi\":\"10.15625/1813-9663/37/4/16023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for constructing a blind signature scheme based on a hidden discrete logarithm problem defined in finite non-commutative associative algebras is proposed. Blind signature protocols are constructed using four-dimensional and six-dimensional algebras defined over a ground finite field GF(p) and containing a global two-sided unit as an algebraic support. The basic properties of the used algebra, which determine the choice of protocol parameters, are described.\",\"PeriodicalId\":15444,\"journal\":{\"name\":\"Journal of Computer Science and Cybernetics\",\"volume\":\"81 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer Science and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15625/1813-9663/37/4/16023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Science and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15625/1813-9663/37/4/16023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
POST-QUANTUM BLIND SIGNATURE PROTOCOL ON NON-COMMUTATIVE ALGEBRAS
A method for constructing a blind signature scheme based on a hidden discrete logarithm problem defined in finite non-commutative associative algebras is proposed. Blind signature protocols are constructed using four-dimensional and six-dimensional algebras defined over a ground finite field GF(p) and containing a global two-sided unit as an algebraic support. The basic properties of the used algebra, which determine the choice of protocol parameters, are described.