Scholarlink

<p>In this paper we introduce a rank <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\varvec{2}\)</EquationSource> </InlineEquation> lattice over a polynomial ring arising from the public key of the BIKE cryptosystem (<CitationRef CitationID="CR1">2024</CitationRef>). The secret key is a sparse vector in this lattice. We study properties of this lattice and generalize the recovery of weak keys from Bardet, Dragoi, Luque and Otmani (<CitationRef CitationID="CR2">2016</CitationRef>). In particular, we show that they implicitly solved a shortest vector problem in the lattice we constructed. Rather than finding only a shortest vector, we obtain a reduced basis of the lattice which makes it possible to check for more weak keys.</p>

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

Polynomial lattices for the BIKE cryptosystem

  • 期刊论文

  • 发表日期：

    2026年2月23日

查看全文
  • Michael Schaller

摘要

In this paper we introduce a rank \(\varvec{2}\) lattice over a polynomial ring arising from the public key of the BIKE cryptosystem (2024). The secret key is a sparse vector in this lattice. We study properties of this lattice and generalize the recovery of weak keys from Bardet, Dragoi, Luque and Otmani (2016). In particular, we show that they implicitly solved a shortest vector problem in the lattice we constructed. Rather than finding only a shortest vector, we obtain a reduced basis of the lattice which makes it possible to check for more weak keys.