A Polynomial-Time Attack on the BBCRS Scheme

DOI10.1007/978-3-662-46447-2_8zbMath1345.94054arXiv1501.03736OpenAlexW1562964166WikidataQ62039159 ScholiaQ62039159MaRDI QIDQ2941191

Jean-Pierre Tillich, Ayoub Otmani, Valérie Gauthier-Umaña, Alain Couvreur

Publication date: 27 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

code-based cryptographygeneralized Reed-Solomon codesdistinguisherkey-recoverycomponent-wise product of codes

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem ⋮ On the security of a Loidreau rank metric code based encryption scheme ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ Encryption scheme based on expanded Reed-Solomon codes ⋮ Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes

This page was built for publication: A Polynomial-Time Attack on the BBCRS Scheme