Search Results - "Decoding problem"

Polynomial reduction from syndrome decoding problem to regular decoding problem by Zajac, Pavol

“…The regular decoding problem asks for (the existence of) regular solutions to a syndrome decoding problem (SDP). This problem has increased applications in…”
Get full text

On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes by Gaborit, Philippe, Zemor, Gilles

“…We give a randomized reduction for the Rank Syndrome Decoding problem and Rank Minimum Distance problem for rank codes over extension fields. Our results are…”
Get full text

Generic Decoding in the Sum-Rank Metric by Puchinger, Sven, Renner, Julian, Rosenkilde, Johan

“…We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in…”
Get full text

MODRED: A code-based non-interactive key exchange protocol by Pei, Junling, Fu, Fang-Wei

“…How to construct a non-interactive key exchange (NIKE) protocol based on coding theory is an opening problem. In this paper, we propose the first code-based…”
Get full text

Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems With Smaller Sizes by Song, Yongcheng, Zhang, Jiang, Huang, Xinyi, Wu, Wei

“…In this paper, we initiate the study of the Rank Decoding (RD) problem and Low Rank Parity Check (LRPC) codes with blockwise structure in rank-based…”
Get full text

Quantum sieving for code-based cryptanalysis and its limitations for ISD by 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…”
Get full text

A Hidden Markov Model for Forecasting Rainfall Data Availability at the Weather Station in West Sumatra by Ramadhan, Rahmawati, Devianto, Dodi

“…Indonesia is a maritime continent in Southeast Asian, laying between Indian Ocean and Pacific Ocean. This position intensely affects the level of rainfall in…”
Get full text

Syndrome decoding with MRHS solver by Smičík, Miloslav, Zajac, Pavol

“…The syndrome decoding problem (SDP) is an NPcomplete problem that has important applications in the development of post-quantum cryptography. Currently, the…”
Get full text

New code-based cryptosystems via the IKKR framework by Lau, Terry Shue Chien, Ivanov, Fedor, Ariffin, Muhammad Rezal Kamel, Chin, Ji-Jian, Yap, Timothy Tzen Vun

“…One main construct for code-based public key cryptosystems is the McEliece framework that hedges upon the hardness of decoding arbitrary linear codes. Based on…”
Get full text

Solving systems of algebraic equations over finite commutative rings and applications by Kamche, Hermann Tchatchiem, Kalachi, Hervé Talé

“…Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the…”
Get full text

Profiled Side-Channel Attack on Cryptosystems Based on the Binary Syndrome Decoding Problem by Colombier, Brice, Dragoi, Vlad-Florin, Cayrel, Pierre-Louis, Grosso, Vincent

“…The NIST standardization process for post-quantum cryptography has been drawing the attention of researchers to the submitted candidates. One direction of…”
Get full text

A quantum resistant universal designated verifier signature proof by Thanalakshmi, P., Anbazhagan, N., Joshi, Gyanendra Prasad, Yang, Eunmok

“…In order to ensure that only the designated person can verify the signer's signature on the message, Steinfeld et al. introduced the concept of Universal…”
Get full text

Connecting the Complexity of MQ- and Code-Based Cryptosystems by Zajac, Pavol

“…We study the connection between the MQ problem and the de­coding problem, through the intermediate MRHS representation. The main goal of this study is to…”
Get full text

Improved analysis of the reduction from BDD to uSVP by Zhao, Chunhuan, Zheng, Zhongxiang

“…In ICALP 2016, Bai, Stehlé and Wen showed that for polynomially bounded parameter γ, the Bounded Distance Decoding (BDD) problem with parameter 1/(2γ) can be…”
Get full text

DECODING M-ARY LINEAR CODES WITH THE QUANTUM APPROXIMATE OPTIMIZATION ALGORITHM by Epelde, M., Combarro, E. F., R ́ua, I. F.

“…Abstract The NP-hardness of the Minimum Distance Decoding Problem (MDDP) is the core of the McEliece cryptosystem. The difficulty of decoding a received word…”
Get full text

Integer syndrome decoding in the presence of noise by 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…”
Get full text

Grover Adaptive Search With Spin Variables by Fujiwara, Shintaro, Ishikawa, Naoki

“…This article presents a novel approach to Grover adaptive search (GAS) for a combinatorial optimization problem whose objective function involves spin…”
Get full text

A New Secret Sharing Scheme by Ozbek, Ibrahim, Siap, Irfan

“…Secret sharing schemes (SSS) offer efficient methods in protecting a secret data shared in parts by shareholders against unauthorized people. Furthermore, this…”
Get full text

On the subset sum problem over finite fields by Li, Jiyou, Wan, Daqing

“…The subset sum problem over finite fields is a well-known NP-complete problem. It arises naturally from decoding generalized Reed–Solomon codes. In this paper,…”
Get full text

Quantum approximate optimization of the coset leader problem for binary linear codes by Epelde, Markel, Combarro, Elías F., Rúa, Ignacio F.

“…The security of a broad family of coding‐based cryptographic techniques relies on the hardness of the Syndrome Decoding Problem (SDP). In this problem, the aim…”
Get full text