FPGA Implementations of Espresso Stream Cipher

Gani Kumisbek, N. Anandakumar, Mohammad S. Hashmi
{"title":"FPGA Implementations of Espresso Stream Cipher","authors":"Gani Kumisbek, N. Anandakumar, Mohammad S. Hashmi","doi":"10.1109/icecs53924.2021.9665568","DOIUrl":null,"url":null,"abstract":"Security of resource-constrained hardware devices, such as the devices in Internet of Things regime, must consider performance and area consumption metrics. One of the viable options for designing lightweight cryptography could be stream cipher. The stream ciphers are symmetric ciphers designed for resource-limited devices. In this paper, we implemented the Espresso stream cipher on the Xilinx Spartan-7 FPGA device. During our implementation, we considered four cases: basic implementation with a full-width input, serial implementation with an unpipelined (basic) algorithm, serial implementation with a pipelined algorithm, and parallel cases. According to the results received, the parallel version reached a throughput of 1778 Mbps and consumed 113 slices. The serial version with an unpipelined output had the least area consumption of 68 slices to achieve a throughput of 511 Mbps. Results of implemented design are then compared with other stream cipher implementations, namely, Grain, Trivium, and MICKEY. It is identified that, despite limited parallelization, the Espresso stream cipher has one of the lowest area consumption compared to other stream cipher implementations.","PeriodicalId":448558,"journal":{"name":"2021 28th IEEE International Conference on Electronics, Circuits, and Systems (ICECS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 28th IEEE International Conference on Electronics, Circuits, and Systems (ICECS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icecs53924.2021.9665568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Security of resource-constrained hardware devices, such as the devices in Internet of Things regime, must consider performance and area consumption metrics. One of the viable options for designing lightweight cryptography could be stream cipher. The stream ciphers are symmetric ciphers designed for resource-limited devices. In this paper, we implemented the Espresso stream cipher on the Xilinx Spartan-7 FPGA device. During our implementation, we considered four cases: basic implementation with a full-width input, serial implementation with an unpipelined (basic) algorithm, serial implementation with a pipelined algorithm, and parallel cases. According to the results received, the parallel version reached a throughput of 1778 Mbps and consumed 113 slices. The serial version with an unpipelined output had the least area consumption of 68 slices to achieve a throughput of 511 Mbps. Results of implemented design are then compared with other stream cipher implementations, namely, Grain, Trivium, and MICKEY. It is identified that, despite limited parallelization, the Espresso stream cipher has one of the lowest area consumption compared to other stream cipher implementations.
Espresso流密码的FPGA实现
资源受限硬件设备(如物联网设备)的安全性必须考虑性能和面积消耗指标。设计轻量级加密的可行选择之一可能是流密码。流密码是为资源有限的设备设计的对称密码。本文在Xilinx Spartan-7 FPGA器件上实现了Espresso流密码。在我们的实现过程中,我们考虑了四种情况:具有全宽输入的基本实现、具有非流水线(基本)算法的串行实现、具有流水线算法的串行实现以及并行情况。根据收到的结果,并行版本达到了1778 Mbps的吞吐量,并消耗了113片。具有非流水线输出的串行版本的面积消耗最少,为68片,实现了511 Mbps的吞吐量。然后将实现的设计结果与其他流密码实现进行比较,即Grain, Trivium和MICKEY。可以确定的是,尽管并行化有限,但与其他流密码实现相比,Espresso流密码具有最低的区域消耗之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信