Suchergebnisse - "Information-Set Decoding"

A New Sieving-Style Information-Set Decoding Algorithm von Guo, Qian, Johansson, Thomas, Nguyen, Vu

“… The problem of decoding random codes is a fundamental problem for code-based cryptography, including recent code-based candidates in the NIST post-quantum …”
Volltext

On Hard and Soft Decision Decoding of BCH Codes von Bossert, Martin, Schulz, Rebekka, Bitzer, Sebastian

“… The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic cosets. Which subset is chosen determines the dimension, …”
Volltext

采用定权最近邻搜索的信息集译码算法 von LIU, Bing, Yu-wei, FENG, NIE Ting, Xu-Dan, WU, 刘冰, 冯雨薇, 聂艇, 吴旭聃

“… 伴随式译码问题是基于编码的密码算法核心问题之一, 通常用信息集译码 (ISD) 方式来评估这类算法, 而近期信息集译码算法的进展又依赖于该算法中非常重要的步骤---最近邻技 …”
Volltext

An Algorithmic Reduction Theory for Binary Codes: LLL and More von Debris-Alazard, Thomas, Ducas, Leo, van Woerden, Wessel P. J.

“… In this article, we propose an adaptation of the algorithmic reduction theory of lattices to binary codes. This includes the celebrated LLL algorithm (Lenstra, …”
Volltext

Security analysis of the Classic McEliece, HQC and BIKE schemes in low memory von Li, Yu, Wang, Li-Ping

Volltext

Quantum sieving for code-based cryptanalysis and its limitations for ISD von Engelberts, Lynn, Etinski, Simona, Loyer, Johanna

“… Sieving using near-neighbor search techniques is a well-known method in lattice-based cryptanalysis, yielding the current best runtime for the shortest vector …”
Volltext

Information-set decoding for convolutional codes: Information-set decoding for convolutional codes von Gassner, Niklas, Lieb, Julia, Mazumder, Abhinaba, Schaller, Michael

“… In this paper, we present a framework for generic decoding of convolutional codes, which allows us to do cryptanalysis of code-based systems that use …”
Volltext

How to lose some weight: a practical template syndrome decoding attack von Bitzer, Sebastian, Delvaux, Jeroen, Kirshanova, Elena, Maaßen, Sebastian, May, Alexander, Wachter-Zeh, Antonia

“… We study the hardness of the Syndrome Decoding problem, the base of most code-based cryptographic schemes, such as Classic McEliece, in the presence of …”
Volltext

From Subset-Sum to Decoding: Improved Classical and Quantum Algorithms via Ternary Representation Technique von Li, Yang

“… The subset-sum problem, a foundational NP-hard problem in theoretical computer science, serves as a critical building block for cryptographic constructions …”
Volltext

Secure and Compact: A New Variant of McEliece Cryptosystem von Bindal, Ekta, Singh, Abhay Kumar

“… This paper introduces a variant of the McEliece cryptosystem and employs the <inline-formula> <tex-math notation="LaTeX">(C_{1}, C_{1} + C_{2}) …”
Volltext

Symbol-level iterative information set decoding of RS codes von Genga, Yuval, Oyerinde, Olutayo, Versfeld, Jaco

“… This paper presents the implementation of a low-complex iterative symbol-level decoding scheme for Reed-Solomon codes. Most soft-decision iterative decoders …”
Volltext

A Finite Regime Analysis of Information Set Decoding Algorithms von Baldi, Marco, Barenghi, Alessandro, Chiaraluce, Franco, Pelosi, Gerardo, Santini, Paolo

“… Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric …”
Volltext

Depth-Optimized Quantum Circuit of Gauss–Jordan Elimination von Jang, Kyungbae, Oh, Yujin, Seo, Hwajeong

“… Quantum computers have the capacity to solve certain complex problems more efficiently than classical computers. To fully leverage these quantum advantages, …”
Volltext

Integer syndrome decoding in the presence of noise von Drăgoi, Vlad-Florin, Colombier, Brice, Cayrel, Pierre-Louis, Grosso, Vincent

“… Code-based cryptography received attention after the NIST started the post-quantum cryptography standardization process in 2016. A central NP-hard problem is …”
Volltext

Improved Information Set Decoding Algorithms over Galois Ring in the Lee Metric von Li, Yu, Wang, Li-Ping

“… The security of most code-based cryptosystems relies on the hardness of the syndrome decoding (SD) problem. The best solvers of the SD problem are known as …”
Volltext

A New Class of Q-Ary Codes for the McEliece Cryptosystem von Freudenberger, Jürgen, Thiers, Johann-Philipp

“… The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers for the …”
Volltext

Survey on PQCC with Self Dual Code over Integer Modulo Ring von Nagata, Kiyoshi

“… Since the proposal of the RSA cryptosystem as an implementation of public-key cryptography proposed by Diffie-Hemann in 1976, public key cryptosystems became …”
Volltext

Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension von Löndahl, Carl, Johansson, Thomas, Koochak Shooshtari, Masoumeh, Ahmadian-Attari, Mahmoud, Aref, Mohammad Reza

“… We present a general purpose algorithm for finding low-weight codewords as well as for decoding a received codeword in any quasi-cyclic code whose length and …”
Volltext

Complexity of statistical attacks on QC-LDPC code-based cryptosystems von Santini, Paolo, Baldi, Marco, Chiaraluce, Franco

“… Public-key cryptosystems built on quasi-cyclic (QC) low-density parity-check and moderate-density parity-check codes are promising candidates for post-quantum …”
Volltext

信息集攻击算法的改进 von Meng-Dong, LI, Kun-Jin, CAI, Yu-Fang, SHAO, 李梦东, 蔡坤锦, 邵玉芳

“… 在信息论和密码学中, 线性码有各种不同的应用. 其中随机线随性码有很多困难问题, 如伴随式译码问题是已知的NP-hard问题. 随机线性码的译码问题是基于纠错码的密码方案所依 …”
Volltext