Grover vs. McEliece
From MaRDI portal
Publication:3569138
DOI10.1007/978-3-642-12929-2_6zbMath1284.94053OpenAlexW1942594900WikidataQ56429758 ScholiaQ56429758MaRDI QIDQ3569138
Publication date: 17 June 2010
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12929-2_6
Related Items (21)
Information set decoding in the Lee metric with applications to cryptography ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ Using low-density parity-check codes to improve the McEliece cryptosystem ⋮ Syndrome Decoding Estimator ⋮ The non-gap sequence of a subcode of a generalized Reed-Solomon code ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Relationship between codes and idempotents in a dihedral group algebra ⋮ Solving the learning parity with noise problem using quantum algorithms ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes ⋮ Hybrid decoding -- classical-quantum trade-offs for information set decoding ⋮ Quantum-assisted QD-CFS signatures ⋮ Reproducible families of codes and cryptographic applications ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Квантовые атаки на итерационные блочные шифры ⋮ Анализ влияния линейной избыточности в S-боксах на аффинную эквивалентность в раундовых функциях XSL-схем ⋮ Wild McEliece ⋮ On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes ⋮ The variational quantum eigensolver: a review of methods and best practices ⋮ Cryptanalysis of LEDAcrypt
This page was built for publication: Grover vs. McEliece