A formula for disaster: a unified approach to elliptic curve special-point-based attacks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F21%3A00119154" target="_blank" >RIV/00216224:14330/21:00119154 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-92062-3_5" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-92062-3_5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-92062-3_5" target="_blank" >10.1007/978-3-030-92062-3_5</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A formula for disaster: a unified approach to elliptic curve special-point-based attacks

Popis výsledku v původním jazyce

The Refined Power Analysis, Zero-Value Point, and Exceptional Procedure attacks introduced side-channel attack techniques against specific cases of elliptic curve cryptography. The three attacks recover bits of a static ECDH key adaptively, collecting information on whether a certain multiple of the input point was computed. We unify and generalize these attacks in a common framework and solve the corresponding problem for a broader class of inputs. We also introduce a version of the attack against windowed scalar multiplication methods, recovering the full scalar instead of just a part of it. Finally, we systematically analyze elliptic curve point addition formulas from the Explicit-Formulas Database, classify all non-trivial exceptional points, and find them in new formulas. These results indicate the usefulness of our tooling for unrolling formulas and finding special points, which might be of independent research interest.

Název v anglickém jazyce

A formula for disaster: a unified approach to elliptic curve special-point-based attacks

Popis výsledku anglicky

The Refined Power Analysis, Zero-Value Point, and Exceptional Procedure attacks introduced side-channel attack techniques against specific cases of elliptic curve cryptography. The three attacks recover bits of a static ECDH key adaptively, collecting information on whether a certain multiple of the input point was computed. We unify and generalize these attacks in a common framework and solve the corresponding problem for a broader class of inputs. We also introduce a version of the attack against windowed scalar multiplication methods, recovering the full scalar instead of just a part of it. Finally, we systematically analyze elliptic curve point addition formulas from the Explicit-Formulas Database, classify all non-trivial exceptional points, and find them in new formulas. These results indicate the usefulness of our tooling for unrolling formulas and finding special points, which might be of independent research interest.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

<a href="/cs/project/GA20-03426S" target="_blank" >GA20-03426S: Ověření a zlepšení bezpečnosti kryptografie eliptických křivek</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Advances in Cryptology – ASIACRYPT 2021

ISBN

9783030920616

ISSN

0302-9743

e-ISSN

1611-3349

Počet stran výsledku

30

Strana od-do

130-159

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Singapore

Datum konání akce

1. 1. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000926634200005