Poly-logarithmic side channel rank estimation via exponential sampling

DOI10.1007/978-3-030-12612-4_17MaRDI QIDQ2290460zbMATH OpenOpenAlexFDO

Authors Liron David, Avishai Wool

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-12612-4_17

zbMATH Keywords

exponential samplingrank estimation algorithmside-channel evaluation

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Fast analytical rank estimation
• Simpler and more efficient rank estimation for side-channel security assessment
• Characterisation and estimation of the key rank distribution in the context of side channel evaluations
• Counting Keys in Parallel After a Side Channel Attack
• Security evaluations beyond computing power. How to analyze side-channel attacks you cannot mount?

Cited in

(5)

• Simpler and more efficient rank estimation for side-channel security assessment
• Characterisation and estimation of the key rank distribution in the context of side channel evaluations
• Security evaluations beyond computing power. How to analyze side-channel attacks you cannot mount?
• Back to Massey: impressively fast, scalable and tight security evaluation tools
• Fast analytical rank estimation

This page was built for publication: Poly-logarithmic side channel rank estimation via exponential sampling

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