{"title":"关于基于代码的签名方案的说明","authors":"Giuseppe D'Alconzo","doi":"10.1142/S0129054123500132","DOIUrl":null,"url":null,"abstract":"This paper analyzes two schemes from a 2019 work by Liu, Yang, Han and Wang, namely, adapting the McEliece cryptosystem to obtain a new public-key encryption scheme, and designing an efficient CFS-like digital signature. It is shown that the new encryption scheme based on McEliece, even if it has longer public keys, is not more secure than the standard one. The security gap between the original scheme and its modification is presented. Moreover, while the proposed parameters for the digital signature scheme lead to a significant performance improvement, however, they introduce a vulnerability in the protocol. A key-forgery attack using the Support Splitting Algorithm as a subroutine is described, with a study of the computational cost of retrieving the secret key from the public one.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"abs/2206.14560 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on a Code-Based Signature Scheme\",\"authors\":\"Giuseppe D'Alconzo\",\"doi\":\"10.1142/S0129054123500132\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper analyzes two schemes from a 2019 work by Liu, Yang, Han and Wang, namely, adapting the McEliece cryptosystem to obtain a new public-key encryption scheme, and designing an efficient CFS-like digital signature. It is shown that the new encryption scheme based on McEliece, even if it has longer public keys, is not more secure than the standard one. The security gap between the original scheme and its modification is presented. Moreover, while the proposed parameters for the digital signature scheme lead to a significant performance improvement, however, they introduce a vulnerability in the protocol. A key-forgery attack using the Support Splitting Algorithm as a subroutine is described, with a study of the computational cost of retrieving the secret key from the public one.\",\"PeriodicalId\":50323,\"journal\":{\"name\":\"International Journal of Foundations of Computer Science\",\"volume\":\"abs/2206.14560 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Foundations of Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1142/S0129054123500132\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1142/S0129054123500132","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
This paper analyzes two schemes from a 2019 work by Liu, Yang, Han and Wang, namely, adapting the McEliece cryptosystem to obtain a new public-key encryption scheme, and designing an efficient CFS-like digital signature. It is shown that the new encryption scheme based on McEliece, even if it has longer public keys, is not more secure than the standard one. The security gap between the original scheme and its modification is presented. Moreover, while the proposed parameters for the digital signature scheme lead to a significant performance improvement, however, they introduce a vulnerability in the protocol. A key-forgery attack using the Support Splitting Algorithm as a subroutine is described, with a study of the computational cost of retrieving the secret key from the public one.
期刊介绍:
The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include:
- Algebraic theory of computing and formal systems
- Algorithm and system implementation issues
- Approximation, probabilistic, and randomized algorithms
- Automata and formal languages
- Automated deduction
- Combinatorics and graph theory
- Complexity theory
- Computational biology and bioinformatics
- Cryptography
- Database theory
- Data structures
- Design and analysis of algorithms
- DNA computing
- Foundations of computer security
- Foundations of high-performance computing