Workload characterization of elliptic curve cryptography and other network security algorithms for constrained environments

Murat Fiskiran, Lee
{"title":"Workload characterization of elliptic curve cryptography and other network security algorithms for constrained environments","authors":"Murat Fiskiran, Lee","doi":"10.1109/WWC.2002.1226501","DOIUrl":null,"url":null,"abstract":"In recent years, some cryptographic algorithms have gained popularity due to properties that make them suitable for use in constrained environments like mobile information appliances, where computing resources and power availability are limited. In this paper, we select a set of public-key, symmetric-key and hash algorithms suitable for such environments and study their workload characteristics. In particular, we study elliptic-curve versions of public-key cryptography algorithms, which allow fast software implementations while reducing the key size needed for a desired level of security compared to previous integer-based public-key algorithms. We characterize the operations needed by elliptic-curve analogs of Diffie-Hellman key exchange, ElGamal and the Digital Signature Algorithm for public-key cryptography, for different key sizes and different levels of software optimization. We also include characterizations for the Advanced Encryption Standard (AES) for symmetric-key cryptography, and SHA as a hash algorithm. We show that all these algorithms can be implemented efficiently with a very simple processor.","PeriodicalId":320576,"journal":{"name":"2002 IEEE International Workshop on Workload Characterization","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE International Workshop on Workload Characterization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WWC.2002.1226501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 55

Abstract

In recent years, some cryptographic algorithms have gained popularity due to properties that make them suitable for use in constrained environments like mobile information appliances, where computing resources and power availability are limited. In this paper, we select a set of public-key, symmetric-key and hash algorithms suitable for such environments and study their workload characteristics. In particular, we study elliptic-curve versions of public-key cryptography algorithms, which allow fast software implementations while reducing the key size needed for a desired level of security compared to previous integer-based public-key algorithms. We characterize the operations needed by elliptic-curve analogs of Diffie-Hellman key exchange, ElGamal and the Digital Signature Algorithm for public-key cryptography, for different key sizes and different levels of software optimization. We also include characterizations for the Advanced Encryption Standard (AES) for symmetric-key cryptography, and SHA as a hash algorithm. We show that all these algorithms can be implemented efficiently with a very simple processor.
约束环境下椭圆曲线密码和其他网络安全算法的工作负载表征
近年来,一些加密算法因其适合在计算资源和可用性有限的移动信息设备等受限环境中使用的特性而受到欢迎。本文选择了一组适合这种环境的公钥、对称密钥和哈希算法,并研究了它们的工作负载特征。特别是,我们研究了椭圆曲线版本的公钥加密算法,与以前基于整数的公钥算法相比,它允许快速的软件实现,同时减少了所需的安全级别所需的密钥大小。我们描述了用于公钥加密的Diffie-Hellman密钥交换、ElGamal和数字签名算法的椭圆曲线类似物在不同密钥大小和不同级别的软件优化下所需的操作。我们还包括用于对称密钥加密的高级加密标准(AES)的特征描述,以及作为散列算法的SHA。我们证明了所有这些算法都可以用一个非常简单的处理器有效地实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信