Scholarlink

The security of code-based cryptography is largely based on the effectiveness of information set decoding (ISD) algorithms. This paper introduces a modification to Stern’s algorithm that reduces average decryption time by at least \(14.2\%\) for a code of length 1024, dimension 524 capable of correcting 50 errors. We accomplish this by adding 3 extra columns to the columns reduced to the identity matrix and performing extra row reductions that manipulate the matrix into a form that still allows Stern’s algorithm to be run.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Increasing Index Sizes for Information Set Decoding Algorithms

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Zachary Welch

摘要

The security of code-based cryptography is largely based on the effectiveness of information set decoding (ISD) algorithms. This paper introduces a modification to Stern’s algorithm that reduces average decryption time by at least \(14.2\%\) for a code of length 1024, dimension 524 capable of correcting 50 errors. We accomplish this by adding 3 extra columns to the columns reduced to the identity matrix and performing extra row reductions that manipulate the matrix into a form that still allows Stern’s algorithm to be run.