{"title":"基于ocdm的加密对键搜索攻击的安全性研究","authors":"G. Di Crescenzo, R. Menendez, S. Etemad","doi":"10.1109/LEOSST.2009.5226242","DOIUrl":null,"url":null,"abstract":"Monte-Carlo simulations of the effectiveness of key-search attacks on OCDM-based encryption reveal that proper code scrambling can result in codes that obscure one another and are resilient against iteratively improving an attacker's key guesses.","PeriodicalId":308737,"journal":{"name":"2009 IEEE/LEOS Summer Topical Meeting","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the security of OCDM-based encryption against key-search attacks\",\"authors\":\"G. Di Crescenzo, R. Menendez, S. Etemad\",\"doi\":\"10.1109/LEOSST.2009.5226242\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Monte-Carlo simulations of the effectiveness of key-search attacks on OCDM-based encryption reveal that proper code scrambling can result in codes that obscure one another and are resilient against iteratively improving an attacker's key guesses.\",\"PeriodicalId\":308737,\"journal\":{\"name\":\"2009 IEEE/LEOS Summer Topical Meeting\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE/LEOS Summer Topical Meeting\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LEOSST.2009.5226242\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE/LEOS Summer Topical Meeting","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LEOSST.2009.5226242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the security of OCDM-based encryption against key-search attacks
Monte-Carlo simulations of the effectiveness of key-search attacks on OCDM-based encryption reveal that proper code scrambling can result in codes that obscure one another and are resilient against iteratively improving an attacker's key guesses.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
