Search Results - "Syndrome 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

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

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

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

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

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

A new code‐based designated verifier signature scheme by Thanalakshmi, Perumal, Anitha, Ramalingam

“…Summary Designated verifier signature (DVS) scheme allows the verifier to verify the signature of a message but prevents from transferring the conviction to…”
Get full text

One-time signature scheme from syndrome decoding over generic error-correcting codes by Barreto, Paulo S.L.M., Misoczki, Rafael, Simplicio Jr, Marcos A.

“…We describe a one-time signature scheme based on the hardness of the syndrome decoding problem, and prove it secure in the random oracle model. Our proposal…”
Get full text

Blind Signature Scheme Based on QC-MDPC Codes by Ren, Fang, Xiu, Haiyan, Gao, Anqi, Shi, Xuan

“…In this paper, we construct a new blind signature scheme based on Quasi-cyclic Moderate Density Parity-Check (QC-MDPC) codes. This scheme is realized by using…”
Get full text

Integer Syndrome Decoding in the Presence of Noise by Dragoi, 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

A Signature Scheme Based on the Syndrome Decoding Problem Using LDPC Codes by Tsuchida, Toshiki, Hirotomo, Masanori, Ito, Haruka, Takita, Makoto, Shiraishi, Yoshiaki, Nomura, Kenta, Mohri, Masami, Fukuta, Youji, Morii, Masakatu

“…The security of widely used authentication and signature schemes is based on the difficulty of the discrete logarithm problem and the prime factorization…”
Get full text

Identification Scheme Based on the Binary Syndrome Decoding Problem Using High-Density Parity-Check Matrices by Hirotomo, Masanori, Ito, Haruka, Fukuta, Youji, Mohri, Masami, Shiraishi, Yoshiaki

“…Most of cryptosystems, identification and signature schemes rely on the discrete logarithm problem and the prime factorization problem. These problems would be…”
Get full text

New code based identification scheme by Moufek, Hamza, Guenda, Kenza

“…In this paper, we propose a new identification scheme, based on two hard problems: the syndrome decoding problem and the problem of finding the parity-check…”
Get full text