Small Footprint Mix-Column Serial for PHOTON and LED Lightweight Cryptography

Y. Abbas, R. Jidin, N. Jamil, M. Z’aba, Saad Al-Azawi
{"title":"Small Footprint Mix-Column Serial for PHOTON and LED Lightweight Cryptography","authors":"Y. Abbas, R. Jidin, N. Jamil, M. Z’aba, Saad Al-Azawi","doi":"10.1109/ICOASE.2018.8548802","DOIUrl":null,"url":null,"abstract":"Lightweight cryptography such as PHOTON or LED has a transform named as Mix-Column-Serial (MCS). Within the MCS, matrix manipulations use Galois polynomial multiplications that require lengthy steps of logical operations. This paper proposes the use of a look-up table with comparators to replace the lengthy steps. As PHOTON’s Galois matrix multiplication produces identical results for pairs of column-row and row-columns, with comparators, the table size is reduced to half. The tables and comparators have been implemented on FPGAs. FPGA’s synthesized results of the newly proposed MCS in the form table with comparators are superior in terms of throughput and area compared to other MCS hardware implementations found in literatures.","PeriodicalId":144020,"journal":{"name":"2018 International Conference on Advanced Science and Engineering (ICOASE)","volume":"02 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Advanced Science and Engineering (ICOASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOASE.2018.8548802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Lightweight cryptography such as PHOTON or LED has a transform named as Mix-Column-Serial (MCS). Within the MCS, matrix manipulations use Galois polynomial multiplications that require lengthy steps of logical operations. This paper proposes the use of a look-up table with comparators to replace the lengthy steps. As PHOTON’s Galois matrix multiplication produces identical results for pairs of column-row and row-columns, with comparators, the table size is reduced to half. The tables and comparators have been implemented on FPGAs. FPGA’s synthesized results of the newly proposed MCS in the form table with comparators are superior in terms of throughput and area compared to other MCS hardware implementations found in literatures.
用于光子和LED轻量级密码的小足迹混合列串行
轻量级加密(如PHOTON或LED)具有称为混合列串行(MCS)的转换。在MCS中,矩阵操作使用伽罗瓦多项式乘法,这需要冗长的逻辑操作步骤。本文建议使用带有比较器的查找表来代替冗长的步骤。由于PHOTON的伽罗瓦矩阵乘法对列-行和行-列对产生相同的结果,使用比较器,表大小减少到一半。表和比较器已在fpga上实现。与文献中发现的其他MCS硬件实现相比,新提出的带有比较器的表格MCS的FPGA综合结果在吞吐量和面积方面都优于其他MCS硬件实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信