使用sat求解器的代数攻击

Groups Complex. Cryptol. Pub Date : 1900-01-01 DOI:10.1515/gcc.2010.016

Philipp Jovanovic, M. Kreuzer

{"title":"使用sat求解器的代数攻击","authors":"Philipp Jovanovic, M. Kreuzer","doi":"10.1515/gcc.2010.016","DOIUrl":null,"url":null,"abstract":"Abstract Algebraic attacks lead to the task of solving polynomial systems over 𝔽2. We study recent suggestions of using SAT-solvers for this task. In particular, we develop several strategies for converting the polynomial system to a set of CNF clauses. This generalizes the approach in [Bard, Courtois, Jefferson, Cryptology ePrint Archive 2007, 2007]. Moreover, we provide a novel way of transforming a system over 𝔽2 e to a (larger) system over 𝔽2. Finally, the efficiency of these methods is examined using standard examples such as CTC, DES, and Small Scale AES.","PeriodicalId":119576,"journal":{"name":"Groups Complex. Cryptol.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Algebraic attacks using SAT-solvers\",\"authors\":\"Philipp Jovanovic, M. Kreuzer\",\"doi\":\"10.1515/gcc.2010.016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Algebraic attacks lead to the task of solving polynomial systems over 𝔽2. We study recent suggestions of using SAT-solvers for this task. In particular, we develop several strategies for converting the polynomial system to a set of CNF clauses. This generalizes the approach in [Bard, Courtois, Jefferson, Cryptology ePrint Archive 2007, 2007]. Moreover, we provide a novel way of transforming a system over 𝔽2 e to a (larger) system over 𝔽2. Finally, the efficiency of these methods is examined using standard examples such as CTC, DES, and Small Scale AES.\",\"PeriodicalId\":119576,\"journal\":{\"name\":\"Groups Complex. Cryptol.\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complex. Cryptol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc.2010.016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complex. Cryptol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc.2010.016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 35

摘要

代数攻击导致求解𝔽2上的多项式系统的任务。我们研究了最近使用sat求解器来完成这项任务的建议。特别是，我们开发了几种将多项式系统转换为CNF子句集的策略。这概括了[Bard, Courtois, Jefferson, crypology ePrint Archive 2007,2007]中的方法。此外，我们提供了一种将𝔽2 e上的系统转换为𝔽2上的(更大的)系统的新方法。最后，用CTC、DES和小规模AES等标准实例验证了这些方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Algebraic attacks using SAT-solvers

Abstract Algebraic attacks lead to the task of solving polynomial systems over 𝔽2. We study recent suggestions of using SAT-solvers for this task. In particular, we develop several strategies for converting the polynomial system to a set of CNF clauses. This generalizes the approach in [Bard, Courtois, Jefferson, Cryptology ePrint Archive 2007, 2007]. Moreover, we provide a novel way of transforming a system over 𝔽2 e to a (larger) system over 𝔽2. Finally, the efficiency of these methods is examined using standard examples such as CTC, DES, and Small Scale AES.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Groups Complex. Cryptol.

自引率

0.00%

发文量