首页> 外文会议>2019 56th ACM/IEEE Design Automation Conference >Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications
【24h】

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

机译:降低密码和安全应用逻辑网络中的乘法复杂性

获取原文
获取原文并翻译 | 示例

摘要

Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates. Our approach is fully automatic and exploits cut enumeration algorithms to explore optimization potentials in local subcircuits. The experimental results show that our approach can reduce the number of AND gates by 34% on average compared to generic size optimization algorithms. Further, we are able to reduce the number of AND gates up to 76% in best-known benchmarks from the cryptography community.
机译:减少AND门的数量在许多密码和安全应用程序中起着核心作用。我们提出一种逻辑综合算法和工具,以最小化由AND,XOR和反相器门组成的逻辑网络中AND门的数量。我们的方法是全自动的,并利用cut枚举算法来探索局部子电路中的优化潜力。实验结果表明,与通用尺寸优化算法相比,我们的方法平均可将AND门的数量减少34%。此外,在密码学界最知名的基准测试中,我们能够将AND门的数量减少多达76%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号