Efficient Encryption From Random Quasi-Cyclic Codes

From MaRDI portal
Publication:5375555

DOI10.1109/TIT.2018.2804444zbMath1395.94345arXiv1612.05572OpenAlexW2566390621WikidataQ123360425 ScholiaQ123360425MaRDI QIDQ5375555

Jean-Christophe Deneuville, Carlos Aguilar-Melchor, Gilles Zémor, Olivier Blazy, Philippe Gaborit

Publication date: 14 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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




Related Items (23)

A practicable timing attack against HQC and its countermeasureA rank metric code-based group signature schemeProperties of constacyclic codes under the Schur productA new algebraic approach to the regular syndrome decoding problem and implications for PCG constructionsCryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018Constructions of optimal rank-metric codes from automorphisms of rational function fieldsTowards automating cryptographic hardware implementations: a case study of HQCNon-interactive secure computation of inner-product from LPN and LWEAnalysis of the security of the PSSI problem and cryptanalysis of the Durandal signature schemeEquivalence and characterizations of linear rank-metric codes based on invariantsCorrelated pseudorandomness from expand-accumulate codesCorrelated pseudorandomness from the hardness of quasi-abelian decodingExpand-convolute codes for pseudorandom correlation generators from LPNCryptanalysis of a code-based one-time signatureA new decryption failure attack against HQCCryptographic group actions and applicationsStatistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledgeEncryption scheme based on expanded Reed-Solomon codesCryptanalysis of a rank-based signature with short public keysNew rank codes based encryption scheme using partial circulant matricesEfficient pseudorandom correlation generators from ring-LPNA gapless code-based hash proof system based on RQC and its applicationsRank-Metric Codes and Their Applications




This page was built for publication: Efficient Encryption From Random Quasi-Cyclic Codes