Grover vs. McEliece

From MaRDI portal
Publication:3569138

DOI10.1007/978-3-642-12929-2_6zbMath1284.94053OpenAlexW1942594900WikidataQ56429758 ScholiaQ56429758MaRDI QIDQ3569138

Daniel J. Bernstein

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 cryptographyLESS is More: Code-Based Signatures Without SyndromesUsing low-density parity-check codes to improve the McEliece cryptosystemSyndrome Decoding EstimatorThe non-gap sequence of a subcode of a generalized Reed-Solomon codeModerate classical McEliece keys from quasi-centrosymmetric Goppa codesRelationship between codes and idempotents in a dihedral group algebraSolving the learning parity with noise problem using quantum algorithmsCode-Based Signature Schemes from Identification Protocols in the Rank MetricAssessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC CodesHybrid decoding -- classical-quantum trade-offs for information set decodingQuantum-assisted QD-CFS signaturesReproducible families of codes and cryptographic applicationsDAGS: key encapsulation using dyadic GS codesLIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decodingКвантовые атаки на итерационные блочные шифрыАнализ влияния линейной избыточности в S-боксах на аффинную эквивалентность в раундовых функциях XSL-схемWild McElieceOn the Berger - Loidreau Cryptosystem on the Tensor Product of CodesThe variational quantum eigensolver: a review of methods and best practicesCryptanalysis of LEDAcrypt




This page was built for publication: Grover vs. McEliece