A modified MixColumn-InversMixColumn in AES algorithm suitable for hardware implementation using FPGA device

Q3 Engineering
Ragiel Hadi Prayitno, Latifah, S. Sudiro, S. Madenda, Suryadi Harmanto
{"title":"A modified MixColumn-InversMixColumn in AES algorithm suitable for hardware implementation using FPGA device","authors":"Ragiel Hadi Prayitno, Latifah, S. Sudiro, S. Madenda, Suryadi Harmanto","doi":"10.21924/cst.8.2.2023.1257","DOIUrl":null,"url":null,"abstract":"This article described the Advanced Encryption Standard (AES) encryption and decryption process without using lookup tables in the MixColumns transformation and parallelizing the transformation process implemented in the Field Programmable Gate Array (FPGA) hardware. Parallelism of the hardware process conducted to the transformation of key schedule, addroundkey, subbyte and shiftrows (subshift) and mixcolumns in the first 5 rounds of the encryption process. The decryption process was parallelized in subshift transformations, both transformations were implemented at the same time. This research produced a modified AES encryption and decryption method and algorithm with the aim of minimizing the resources required for hardware implementation. The method in this article was applied to Xilinx ISE 14.7 software. The experimental results showed that the encryption process required 2,357 slice LUT's, 845 occupied slices and 26 IOB's, while the decryption process required 2,896 LUT's, 1,323 occupied slices and 26 IOB's resources. The encryption and decryption processes each took an average of 2.891 nanoseconds and 3.467 nanoseconds for every 128 bits of data. This approach leads us to obtain a component with minimum resources and enough computational speed.","PeriodicalId":36437,"journal":{"name":"Communications in Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21924/cst.8.2.2023.1257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

This article described the Advanced Encryption Standard (AES) encryption and decryption process without using lookup tables in the MixColumns transformation and parallelizing the transformation process implemented in the Field Programmable Gate Array (FPGA) hardware. Parallelism of the hardware process conducted to the transformation of key schedule, addroundkey, subbyte and shiftrows (subshift) and mixcolumns in the first 5 rounds of the encryption process. The decryption process was parallelized in subshift transformations, both transformations were implemented at the same time. This research produced a modified AES encryption and decryption method and algorithm with the aim of minimizing the resources required for hardware implementation. The method in this article was applied to Xilinx ISE 14.7 software. The experimental results showed that the encryption process required 2,357 slice LUT's, 845 occupied slices and 26 IOB's, while the decryption process required 2,896 LUT's, 1,323 occupied slices and 26 IOB's resources. The encryption and decryption processes each took an average of 2.891 nanoseconds and 3.467 nanoseconds for every 128 bits of data. This approach leads us to obtain a component with minimum resources and enough computational speed.
适合使用 FPGA 设备进行硬件实施的 AES 算法中的混合列-反向混合列改进版
本文介绍了高级加密标准(AES)的加密和解密过程,在混合列(MixColumns)转换过程中不使用查找表,并在现场可编程门阵列(FPGA)硬件中实现了转换过程的并行化。硬件过程的并行化进行了加密过程前 5 轮的密钥计划、addroundkey、subbyte 和 shiftrows(subshift)以及 mixcolumns 的转换。解密过程在子移位变换中进行了并行处理,两种变换同时进行。这项研究提出了一种改进的 AES 加密和解密方法和算法,目的是最大限度地减少硬件实施所需的资源。本文中的方法应用于 Xilinx ISE 14.7 软件。实验结果表明,加密过程需要 2,357 个 LUT 片、845 个占用片和 26 个 IOB,而解密过程需要 2,896 个 LUT 片、1,323 个占用片和 26 个 IOB。每 128 比特数据的加密和解密过程平均各耗时 2.891 纳秒和 3.467 纳秒。通过这种方法,我们获得了一个拥有最少资源和足够计算速度的组件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Communications in Science and Technology
Communications in Science and Technology Engineering-Engineering (all)
CiteScore
3.20
自引率
0.00%
发文量
13
审稿时长
24 weeks
×
引用
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学术官方微信