All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Decompose and Conquer: ZVP Attacks on GLV Curves

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F25%3A00140501" target="_blank" >RIV/00216224:14330/25:00140501 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-031-95764-2_3" target="_blank" >http://dx.doi.org/10.1007/978-3-031-95764-2_3</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-95764-2_3" target="_blank" >10.1007/978-3-031-95764-2_3</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Decompose and Conquer: ZVP Attacks on GLV Curves

  • Original language description

    While many side-channel attacks on elliptic curve cryptography can be avoided by coordinate randomization, this is not the case for the zero-value point (ZVP) attack. This attack can recover a prefix of static ECDH key but requires solving an instance of the dependent coordinates problem (DCP), which is open in general. We design a new method for solving the DCP on GLV curves, including the Bitcoin secp256k1 curve, outperforming previous approaches. This leads to a new type of ZVP attack on multiscalar multiplication, recovering twice as many bits when compared to the classical ZVP attack. We demonstrate a 63% recovery of the private key for the interleaving algorithm for multiscalar multiplication. Finally, we analyze the largest database of curves and addition formulas with over 14 000 combinations and provide the first classification of their resistance against the ZVP attack.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2025

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2025, PT II

  • ISBN

    9783031957635

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    25

  • Pages from-to

    49-73

  • Publisher name

    SPRINGER INTERNATIONAL PUBLISHING AG

  • Place of publication

    CHAM

  • Event location

    Munich, GERMANY

  • Event date

    Jun 23, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001549663000003