This work presents some novel techniques to enhance an encryption scheme motivated by classical McEliece cryptosystem. Contributions include: (1) using masking matrices to hide sensitive data, (2) allowing both legitimate parties to incorporate randomness in the public key without sharing any additional public information, (3) using concatenation of a repetition code for error correction, permitting key recovery with a negligible decoding complexity, (4) making attacks more difficult by increasing the complexity in verifying a given key candidate has resulted in the actual key, (5) introducing memory in the error sequence such that: (i) error vector is composed of a random number of erroneous bits, (ii) errors can be all corrected when used in conjunction with concatenation of a repetition code of length 3. Proposed techniques allow generating significantly larger keys, at the same time, with a much lower complexity, as compared to known post-quantum key generation techniques relying on randomization.

翻译：本文提出了若干新颖技术，旨在增强受经典McEliece密码系统启发的加密方案。主要贡献包括：(1) 使用掩码矩阵隐藏敏感数据；(2) 允许合法双方在不共享额外公开信息的情况下，将随机性引入公钥；(3) 采用重复码级联进行纠错，以可忽略的解码复杂度实现密钥恢复；(4) 通过增加验证给定密钥候选是否对应实际密钥的复杂度，提升攻击难度；(5) 在错误序列中引入记忆特性，使得：(i) 错误向量由随机数量的错误比特组成，(ii) 当与长度为3的重复码级联配合使用时，所有错误均可被纠正。与已知的依赖随机化的后量子密钥生成技术相比，所提技术能够生成显著更大的密钥，同时具有更低的复杂度。