Polynomial structures in code-based cryptography

DOI10.1007/978-3-319-03515-4_19MaRDI QIDQ2872062zbMATH OpenOpenAlexFDO

Authors Vlad-Florin Drăgoi, Pierre-Louis Cayrel, Brice Colombier, Tania Richmond

Publication date 14 January 2014

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

Full work available at URL https://doi.org/10.1007/978-3-319-03515-4_19

zbMATH Keywords

Monte-Carlo methodMcElieceGalois fieldsimple roots problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1925556
• scientific article; zbMATH DE number 2085200
• Security bounds for the design of code-based cryptosystems
• Timing attacks against the syndrome inversion in code-based cryptosystems
• Don't forget your roots: constant-time root finding over \(\mathbb{F}_{2^m}\)

Cited in

(1)

• Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard

This page was built for publication: Polynomial structures in code-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872062)