A recent “dimension padding” note proposes a structural countermeasure to linear inversion in a dual-public-key code-based encryption construction. The note argues that padding makes the private parity structure non-identifiable from the public key and suggests phrasing security in terms of this non-identifiability. This comment points out that non-identifiability of a particular trapdoor representation does not prevent message recovery. In the padded construction, the public relations used for decryption remain linear constraints. Any solution to these public constraints suffices to recover the encryption randomness and then the plaintext by linear algebra. Consequently, public-key-only decryption remains polynomial-time
BibTeX
@misc{cryptoeprint:2026/163,
author = {Mohammad Sadegh Ghorlivandzadeh},
title = {{CommentonTechRxiv} preprint 1374260 ({DOI}: 10.36227/techrxiv.176765338.86836807/v1): “Dimension Padding as a Structural Countermeasure to Linear Inversion in Dual-Public-Key Code-Based Cryptosystems”},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/163},
year = {2026},
url = {https://eprint.iacr.org/2026/163}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。