Scholarlink

<p>Code-based cryptographic schemes are a very popular quantum-safe alternative to current standards. Yet, designing efficient code-based signatures is a challenging task, and current proposals are still far from the target set by other post-quantum primitives (e.g. lattice-based). In this survey, we describe a code-based approach for signing, based on the hardness of the code equivalence problem. We recall the best known techniques for solving the code equivalence problem known to date, and we discuss its theoretical complexity.</p>

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

The Code Equivalence Problem and Its Applications to Cryptography

  • 期刊论文

  • 发表日期：

    2025年4月18日

查看全文
  • Jean-François Biasse,
  • Giacomo Micheli

摘要

Code-based cryptographic schemes are a very popular quantum-safe alternative to current standards. Yet, designing efficient code-based signatures is a challenging task, and current proposals are still far from the target set by other post-quantum primitives (e.g. lattice-based). In this survey, we describe a code-based approach for signing, based on the hardness of the code equivalence problem. We recall the best known techniques for solving the code equivalence problem known to date, and we discuss its theoretical complexity.