An Algebraic Attack Against McEliece-like Cryptosystems Based on BCH codes

Freja Elbro*, Christian Majenz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

We present an algebraic attack on a McEliece-like scheme based on BCH codes (BCH-McEliece), where the Goppa code is replaced by a suitably permuted BCH code. Our attack continues the line of work devising attacks against McEliece-like schemes with Goppa-like codes, with the goal of getting a better understanding of why Goppa codes are so intractable. Our starting point is the work of Faugère, Perret and Portzamparc (Asiacrypt 2014). We take their algebraic model and adapt and improve their attack algorithm so that it can handle BCH-McEliece. We demonstrate experimentally that our attack is practical for high rate codes over non-prime fields for parameters where generic attacks suggest cryptographic security.

Original languageEnglish
Title of host publicationProceedings of the 2023 IEEE Information Theory Workshop (ITW)
PublisherIEEE
Publication date2023
Pages70-75
ISBN (Print)979-8-3503-0150-2
ISBN (Electronic)979-8-3503-0149-6
DOIs
Publication statusPublished - 2023
Event2023 IEEE Information Theory Workshop - Saint-Malo, France
Duration: 23 Apr 202328 Apr 2023

Workshop

Workshop2023 IEEE Information Theory Workshop
Country/TerritoryFrance
CitySaint-Malo
Period23/04/202328/04/2023
Series2023 IEEE Information Theory Workshop, ITW 2023

Fingerprint

Dive into the research topics of 'An Algebraic Attack Against McEliece-like Cryptosystems Based on BCH codes'. Together they form a unique fingerprint.

Cite this