首页> 外文期刊>Circuits, Devices & Systems, IET >Efficient and high-throughput application-specific integrated circuit implementations of HIGHT and PRESENT block ciphers
【24h】

Efficient and high-throughput application-specific integrated circuit implementations of HIGHT and PRESENT block ciphers

机译:高效和高吞吐量的应用专用集成电路实现的高效和呈现块CIPHERS

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this study, low-cost and high-throughput hardware implementations of the HIGHT (HIGh security and lightweigHT) and PRESENT lightweight block ciphers are presented. One of the most complex blocks in the HIGHT algorithm is addition modulo 28. In the proposed structure for implementation of this modular adder, the authors used the structure of Ladner-Fischer, Han-Carlson, Kogge-Stone and Sklansky adders, which are parallel prefix adders with low critical path delay and suitable hardware resources. In the PRESENT block cipher, for two key lengths 80-bit and 128-bit, the S-box is implemented based on an area-optimised combinational logic circuit. In the proposed S-box structure, the number of logic gates and critical path delay is reduced by using Karnaugh mapping and further factorisation. Also, to reduce the latency and increase throughput, the loop unrolling technique is applied in the structures. Implementation results of the proposed architectures in 180 nm complementary metal-oxide-semiconductor technology for different unroll factors are achieved. The results show improvements in terms of execution time, throughput and throughput/area compared to other related works.
机译:在本研究中,提出了低成本和高通量硬件实现(高安全性和轻质)和现有的轻质块密码。 Hight算法中最复杂的块之一是添加模数2 8 。在建议的实施该模块化加法器的结构中,作者使用了梯子 - 费舍,汉卡尔森,吉吉 - 石头和Sklansky添加剂的结构,这些加法器是具有低关键路径延迟和合适的硬件资源的并行前缀加法器。在本块密码中,对于两个键长度80位和128位,基于区域优化组合逻辑电路来实现S盒。在所提出的S盒结构中,通过使用Karnaugh Mapping和进一步的分解,减少了逻辑门的数量和临界路径延迟。此外,为了降低延迟和增加吞吐量,在结构中应用了环路展开技术。实现了用于不同展开因子的180nm互补金属氧化物半导体技术的拟议架构的实现结果。结果显示与其他相关工程相比的执行时间,吞吐量和吞吐量/区域的改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号