• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on High Performance Computing and Simulation >A new Parallelization for p3Enum and Parallelized Generation of Optimized Pruning Functions
【24h】

A new Parallelization for p3Enum and Parallelized Generation of Optimized Pruning Functions

机译：p3Enum的新并行化和优化修剪函数的并行生成

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Since quantum computers will be able to break all public-key encryption schemes employed today efficiently, quantum-safe cryptographic alternatives are required. One group of candidates are lattice-based schemes since they are efficient and versatile. To make them practical, their security level must be assessed on classical HPC systems in order to determine efficient but secure parameterization.In this paper, we propose a novel parallelization strategy for the open source framework p3Enum which is designed to solve the important lattice problem of finding the shortest non-zero vector in a lattice (SVP). We also present the p3Enum extreme pruning function generator (p3Enum-epfg) which generates optimized extreme pruning functions for p3Enum's pruned lattice enumeration by employing a parallelized simulated annealing approach. We demonstrate the quality of the pruning functions delivered. Combining the new parallelization with optimized pruning functions speeds up p3Enum by a factor up to 3 compared to the previous version.Additionally, we compare the required runtime to solve the SVPs with state-of-the art tools and, for the first time, also visualize the statistical effects in the runtime of the algorithms under consideration. This allows a considerably better understanding of the behavior of the implementations than previous average-value considerations and demonstrates the relative stability of p3Enum's parallel runtimes which improve reproducibility and predictability. All these advancements make it the fastest SVP solver for lattice dimensions 66 to 92 and a suitable building block as SVP-oracle in lattice basis reduction.
机译：由于量子计算机将能够有效地打破当今采用的所有公钥加密方案，因此需要量子安全的密码替代方案。一组候选者是基于格的方案，因为它们是高效且通用的。为了使它们实用，必须在经典HPC系统上评估其安全级别，以便确定有效但安全的参数化。本文针对开放源代码框架p3Enum提出了一种新颖的并行化策略，旨在解决P3Enum的重要晶格问题。在晶格（SVP）中找到最短的非零向量。我们还介绍了p3Enum极端修剪函数生成器（p3Enum-epfg），该生成器通过使用并行模拟退火方法为p3Enum修剪的晶格枚举生成优化的极端修剪函数。我们展示了所提供的修剪功能的质量。将新的并行化与优化的修剪功能相结合，与以前的版本相比，将p3Enum的速度提高了3倍。此外，我们还比较了使用最先进的工具解决SVP所需的运行时，并且首次可视化正在考虑的算法在运行时的统计效果。与以前的平均值考虑相比，这可以更好地理解实现的行为，并证明了p3Enum并行运行时的相对稳定性，从而提高了可重复性和可预测性。所有这些进步使它成为晶​​格尺寸从66到92的最快SVP求解器，并且是晶格基缩减中SVP-oracle的合适构建基块。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号