Layered ROLLO-I: Faster rank-metric code-based KEM using ideal LRPC codes

Chanki Kim; Young-Sik Kim; Jong-Seon No

Paper 2022/1572

Layered ROLLO-I: Faster rank-metric code-based KEM using ideal LRPC codes

Chanki Kim

, Chosun University

Young-Sik Kim, Chosun University

Jong-Seon No

, Seoul National University

Abstract

For the fast cryptographic operation, we newly propose a key encapsulation mechanism (KEM) called layered ROLLO-I by using block-wise interleaved ideal LRPC (BII-LRPC) codes. By multiplying random polynomials by small-sized ideal LRPC codes, faster operation can be obtained with an additional key size. Finally, some parameters of the proposed algorithm are suggested and compared with that of the existing ROLLO-I scheme.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
Keywords: Code-based cryptography low-rank parity-check (LRPC) codes KEM post-quantum cryptography (PQC)
Contact author(s): carisis @ chosun ac kr
iamyskim @ chosun ac kr
jsno @ snu ac kr
History: 2022-11-14: approved; 2022-11-12: received; See all versions
Short URL: https://ia.cr/2022/1572
License: CC0

BibTeX

@misc{cryptoeprint:2022/1572,
      author = {Chanki Kim and Young-Sik Kim and Jong-Seon No},
      title = {Layered ROLLO-I: Faster rank-metric code-based KEM using ideal LRPC codes},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1572},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/1572}},
      url = {https://eprint.iacr.org/2022/1572}
}