CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms

Dalton Chichester, W. Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, C. Meadows, P. Narendran, V. Ravishankar, Luis Rovira, Brandon Rozek
{"title":"CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms","authors":"Dalton Chichester, W. Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, C. Meadows, P. Narendran, V. Ravishankar, Luis Rovira, Brandon Rozek","doi":"10.4204/EPTCS.370.10","DOIUrl":null,"url":null,"abstract":"Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable proofs of soundness/completeness, can be used both to identify insecure cryptosystems and prove sound ones secure. But although a number of such symbolic algorithms have been developed and implemented, they remain scattered throughout the literature. In this paper, we present a tool, CryptoSolve, which provides a common basis for specification and implementation of these algorithms, CryptoSolve includes libraries that provide the term algebras used to express symbolic cryptographic systems, as well as implementations of useful algorithms, such as unification and variant generation. In its current initial iteration, it features several algorithms for the generation and analysis of cryptographic modes of operation, which allow one to use block ciphers to encrypt messages more than one block long. The goal of our work is to continue expanding the tool in order to consider additional cryptosystems and security questions, as well as extend the symbolic libraries to increase their applicability.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Games, Automata, Logics and Formal Verification","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.370.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable proofs of soundness/completeness, can be used both to identify insecure cryptosystems and prove sound ones secure. But although a number of such symbolic algorithms have been developed and implemented, they remain scattered throughout the literature. In this paper, we present a tool, CryptoSolve, which provides a common basis for specification and implementation of these algorithms, CryptoSolve includes libraries that provide the term algebras used to express symbolic cryptographic systems, as well as implementations of useful algorithms, such as unification and variant generation. In its current initial iteration, it features several algorithms for the generation and analysis of cryptographic modes of operation, which allow one to use block ciphers to encrypt messages more than one block long. The goal of our work is to continue expanding the tool in order to consider additional cryptosystems and security questions, as well as extend the symbolic libraries to increase their applicability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CryptoSolve:迈向加密算法符号分析的工具
最近,人们对符号技术在密码系统规范和分析中的应用产生了兴趣。当伴随着适当的可靠性/完整性证明时,这些技术既可以用来识别不安全的密码系统,也可以用来证明可靠的密码系统是安全的。但是,尽管许多这样的符号算法已经被开发和实现,它们仍然分散在整个文献中。在本文中,我们提出了一个工具,CryptoSolve,它为这些算法的规范和实现提供了一个共同的基础,CryptoSolve包括提供用于表示符号密码系统的术语代数的库,以及有用的算法的实现,如统一和变体生成。在当前的初始迭代中,它具有用于生成和分析加密操作模式的几种算法,这些算法允许使用块密码对超过一个块长的消息进行加密。我们工作的目标是继续扩展该工具,以便考虑其他密码系统和安全问题,以及扩展符号库以增加其适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Complexity through Translations for Modal Logic with Recursion Capturing Bisimulation-Invariant Exponential-Time Complexity Classes Schema-Based Automata Determinization Parametric Interval Temporal Logic over Infinite Words Characterizing the Decidability of Finite State Automata Team Games with Communication
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1