Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes
type: Item
instance of: scholarly article
title: Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes
DOI: 10.1007/978-981-99-8739-9_10
author: Yongcheng Song
author: Jiang Zhang
author: Xinyi Huang
author: Wei Wu
publication date: 2024-08-30T00:00:00Z
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
zbMATH DE Number: 7904508
zbMATH Keywords: post-quantum cryptography
zbMATH Keywords: NIST PQC candidates
zbMATH Keywords: rank metric code-based cryptography
zbMATH Keywords: rank decoding problem
zbMATH Keywords: LRPC codes
MaRDI profile type: Publication
cites work: Ouroboros: An Efficient and Provably Secure KEM Family
cites work: Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
cites work: Generalized Gabidulin codes over fields of any characteristic
cites work: An algebraic attack on rank metric code-based cryptosystems
cites work: Revisiting algebraic attacks on MinRank and on the rank decoding problem
cites work: Improvements of algebraic attacks for solving the rank decoding and MinRank problems
cites work: Fundamental Properties of Sum-Rank-Metric Codes
cites work: Q4536280
cites work: On the security of a Loidreau rank metric code based encryption scheme
cites work: Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
cites work: Cryptanalysis of MinRank
cites work: Theory of codes with maximum rank distance
cites work: Q4037491
cites work: On the Complexity of the Rank Syndrome Decoding Problem
cites work: New Results for Rank-Based Cryptography
cites work: On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
cites work: Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
cites work: Q3840170
cites work: A modular analysis of the Fujisaki-Okamoto transformation
cites work: Coding and Cryptography
cites work: A new rank metric codes based encryption scheme
cites work: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
cites work: On a special class of polynomials.
cites work: New technique for decoding codes in the rank metric and its cryptography applications
cites work: Progress in Cryptology – Mycrypt 2005
cites work: On the edge-independence number and edge-covering number for regular graphs
description: scientific article; zbMATH DE number 7904508