Private multiplication over finite fields

DOI10.1007/978-3-319-63697-9_14zbMath1418.94031OpenAlexW2740740730MaRDI QIDQ1675211

Adrian Thillard, Fabrice Benhamouda, Sonia Belaïd, Alain Passelègue, Emmanuel Prouff, Damien Vergnaud

Publication date: 27 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63697-9_14

zbMATH Keywords

constructionslower boundsprobabilistic methodside-channel analysisbilinear complexityrandomness complexityprobing model

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (6)

Secure and efficient software masking on superscalar pipelined processors ⋮ Dynamic random probing expansion with quasi linear asymptotic complexity ⋮ Unifying freedom and separation for tight probing-secure composition ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Fast verification of masking schemes in characteristic two ⋮ Random probing security: verification, composition, expansion and new constructions

This page was built for publication: Private multiplication over finite fields