McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks

DOI10.1007/978-3-642-22792-9_43zbMath1287.94065arXiv1008.2390OpenAlexW1885079520WikidataQ28020178 ScholiaQ28020178MaRDI QIDQ5199224

Alexander Russell, Moore, Cristopher, Hang Dinh

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.2390

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

LESS is More: Code-Based Signatures Without Syndromes ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Unnamed Item ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ Unnamed Item ⋮ Computer algebra tales on Goppa codes and McEliece cryptography ⋮ Mathematical models of modified crypto-code means of information protection based on coding theory schemes

Uses Software

• McEliece

This page was built for publication: McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks