{"title":"McEliece/Niederreiter PKC:故障注入的敏感性","authors":"Pierre-Louis Cayrel, P. Dusart","doi":"10.1109/FUTURETECH.2010.5482663","DOIUrl":null,"url":null,"abstract":"The McEliece and Niederreiter public key cryptosystems (PKC) are presumed secure in a post quantum world because there is no efficient quantum algorithm that solves the hard problems upon which these cryptosystems are built. The present article indicates, however, a different type of vulnerability for such cryptosystems, namely fault injection. We present the injection fault in the McEliece scheme using Goppa codes and in two variants using quasi-cyclic alternant and quasi-dyadic codes, and describe the main difference of those constructions in this context.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"McEliece/Niederreiter PKC: Sensitivity to Fault Injection\",\"authors\":\"Pierre-Louis Cayrel, P. Dusart\",\"doi\":\"10.1109/FUTURETECH.2010.5482663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The McEliece and Niederreiter public key cryptosystems (PKC) are presumed secure in a post quantum world because there is no efficient quantum algorithm that solves the hard problems upon which these cryptosystems are built. The present article indicates, however, a different type of vulnerability for such cryptosystems, namely fault injection. We present the injection fault in the McEliece scheme using Goppa codes and in two variants using quasi-cyclic alternant and quasi-dyadic codes, and describe the main difference of those constructions in this context.\",\"PeriodicalId\":380192,\"journal\":{\"name\":\"2010 5th International Conference on Future Information Technology\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 5th International Conference on Future Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FUTURETECH.2010.5482663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International Conference on Future Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUTURETECH.2010.5482663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
McEliece/Niederreiter PKC: Sensitivity to Fault Injection
The McEliece and Niederreiter public key cryptosystems (PKC) are presumed secure in a post quantum world because there is no efficient quantum algorithm that solves the hard problems upon which these cryptosystems are built. The present article indicates, however, a different type of vulnerability for such cryptosystems, namely fault injection. We present the injection fault in the McEliece scheme using Goppa codes and in two variants using quasi-cyclic alternant and quasi-dyadic codes, and describe the main difference of those constructions in this context.