Suchergebnisse - decoding ((problem OR (problems OR problemys)) OR (problemsssys OR (problemsssys OR problemsssys)))

Efficient Authentication Protocols from the Restricted Syndrome Decoding Problem

Autoren: Thomas Johansson Mustafa Khairallah Vu Nguyen

Quelle: 2025 IEEE 10th European Symposium on Security and Privacy (EuroS&P). :845-860

Polynomial reduction from syndrome decoding problem to regular decoding problem

Autoren: Pavol Zajac

Quelle: Designs, Codes and Cryptography. 93:1777-1793

Innovation in Design Education: Decoding Problem Structuring Processes of a Natural Object Driven Open-Ended Étude

Autoren: Esther Kiruba Jebakumar Clifford Evelyn Jeny Arulmalar Ramaraj

Quelle: BCE Official Conference Proceedings. :777-787

RYDE: a digital signature scheme based on rank syndrome decoding problem with MPC-in-the-Head paradigm

Autoren: Loïc Bidoux Jesús-Javier Chi-Domínguez Thibauld Feneuil et al.

Quelle: Designs, Codes and Cryptography. 93:1451-1486

A BKW-Style Solver for the Restricted Syndrome Decoding Problem

Autoren: Thomas Johansson Qian Guo Vu Nguyen

Quantum Reduction of Finding Short Code Vectors to the Decoding Problem

Autoren: Debris-Alazard, Thomas Remaud, Maxime Tillich, Jean-Pierre et al.

Weitere Verfasser: Debris-Alazard, Thomas Remaud, Maxime Tillich, Jean-Pierre et al.

Quelle: IEEE Transactions on Information Theory. 70:5323-5342

Schlagwörter: FOS: Computer and information sciences, Quantum Physics, Computer Science - Cryptography and Security, FOS: Physical sciences, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Quantum Physics (quant-ph), Cryptography and Security (cs.CR)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2106.02747
https://inria.hal.science/hal-04276190v2
https://inria.hal.science/hal-04276190v2/document
https://doi.org/10.1109/tit.2023.3327759

On the hardness of the Lee syndrome decoding problem

Autoren: Weger, Violetta Khathuria, Karan Horlemann, Anna-Lena et al.

Quelle: Advances in Mathematics of Communications. 18:233-266

Schlagwörter: FOS: Computer and information sciences, Computer Science - Cryptography and Security, Syndrome decoding, Lee metric, information set decoding, Computer Science - Information Theory, Information Theory (cs.IT), 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Cryptography and Security (cs.CR), 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2002.12785

A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric

Autoren: Kovačević, Mladen Grbić, Tatjana Čapko, Darko et al.

Index Begriffe: Computer Science - Cryptography and Security, Computer Science - Information Theory, 94A60, 68P25, text

URL: http://arxiv.org/abs/2502.11641

The Quantum Decoding Problem : Tight Achievability Bounds and Application to Regev's Reduction

Autoren: Blanvillain, Agathe Chailloux, André Tillich, Jean-Pierre

Schlagwörter: Quantum Physics, FOS: Physical sciences, Quantum Physics (quant-ph)

Zugangs-URL: http://arxiv.org/abs/2509.24796

RYDE: a digital signature scheme based on rank syndrome decoding problem with MPC-in-the-Head paradigm.

Autoren: Bidoux, Loïc Chi-Domínguez, Jesús-Javier Feneuil, Thibauld et al.

Quelle: Designs, Codes & Cryptography; May2025, Vol. 93 Issue 5, p1451-1486, 36p

Schlagwörter: DIGITAL signatures, CRYPTOGRAPHY, CRYPTOCURRENCIES, CONFERENCES & conventions, STANDARDIZATION

On the rank decoding problem over finite principal ideal rings

Autoren: Kalachi, Hervé Tale Kamche, Hermann Tchatchiem

Quelle: Advances in Mathematics of Communications. 18:1492-1513

Schlagwörter: FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: http://arxiv.org/abs/2106.11569

Revisiting algebraic attacks on MinRank and on the rank decoding problem

Autoren: Bardet, Magali Briaud, Pierre Bros, Maxime et al.

Weitere Verfasser: Bardet, Magali Briaud, Pierre Bros, Maxime et al.

Quelle: Designs, Codes and Cryptography. 91:3671-3707

Schlagwörter: FOS: Computer and information sciences, Computer Science - Cryptography and Security, Post-quantum cryptography, NIST-PQC candidates, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, 0202 electrical engineering, electronic engineering, information engineering, Algebraic attack, [INFO]Computer Science [cs], Rank metric code-based cryptography, Cryptography and Security (cs.CR)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2208.05471

MPCitH-based Signatures from Restricted Decoding Problems

Autoren: Battagliola, Michele Bitzer, Sebastian Wachter-Zeh, Antonia et al.

Schlagwörter: Cryptography and Security, Information Theory

Zugangs-URL: http://arxiv.org/abs/2510.11224

Profiled Side-Channel Attack on Cryptosystems Based on the Binary Syndrome Decoding Problem

Autoren: Brice Colombier Vlad-Florin Dragoi Pierre-Louis Cayrel et al.

Weitere Verfasser: Brice Colombier Vlad-Florin Dragoi Pierre-Louis Cayrel et al.

Quelle: IEEE Transactions on Information Forensics and Security. 17:3407-3420

Schlagwörter: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 0202 electrical engineering, electronic engineering, information engineering, Post-quantum Cryptography, Side-channel Attack, 02 engineering and technology, Syndrome Decoding Problem, 7. Clean energy

Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems With Smaller Sizes

Autoren: Yongcheng Song Jiang Zhang Xinyi Huang et al.

Quelle: Lecture Notes in Computer Science ISBN: 9789819987382

An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem

Autoren: Yan Pan Xiang‐Ke Chang Xing‐Biao Hu

Quelle: Studies in Applied Mathematics. 151:450-474

Schlagwörter: 0103 physical sciences, 0101 mathematics, 01 natural sciences

On the List and Bounded Distance Decodability of ReedSolomon Codes

Autoren: Cheng, Qi Wan, Daqing

Quelle: SIAM Journal on Computing. 37(1)

Schlagwörter: list decoding algorithm, bounded distance decoding algorithm, Reed-Solomon codes, discrete logarithm problem, math.NT, cs.IT, math.IT, 11Y16, 68Q25, Pure Mathematics, Computation Theory and Mathematics, Computation Theory & Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/8wc6425s
https://escholarship.org/content/qt8wc6425s/qt8wc6425s.pdf

One Approach to Decoding Monotone Logical Function.

Autoren: Dragunov, N. A. Djukova, E. V.

Quelle: Automation & Remote Control; Oct2022, Vol. 83 Issue 10, p1600-1607, 8p

Schlagwörter: DECODING algorithms, PROBLEM solving, CUBES, ALGORITHMS

Multiparallel MMT: Faster ISD Algorithm Solving High-Dimensional Syndrome Decoding Problem

Autoren: Shintaro NARISADA Kazuhide FUKUSHIMA Shinsaku KIYOMOTO

Quelle: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :241-252

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Code-based signatures from new proofs of knowledge for the syndrome decoding problem

Autoren: Loïc Bidoux Philippe Gaborit Mukul Kulkarni et al.

Quelle: Designs, Codes and Cryptography. 91:497-544

Schlagwörter: FOS: Computer and information sciences, Computer Science - Cryptography and Security, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Cryptography and Security (cs.CR), 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2201.05403