Algebraic Cryptanalysis

Algebraic Cryptanalysis is a method in symmetric-key cryptography that models cryptographic primitives as systems of multivariate polynomial equations over finite fields, with the aim of recovering secret keys by exploiting algebraic structure and solving the resulting system through computational algebra techniques.

245

Publications

12K

Citations

537

Authors

251

Institutions

Publications per year

2017–2026

65

Authors

537

  1. JF
    Jean‐Charles Faugère

    Sorbonne Université, France

    8 publications · 431 citations

    8

    h-index

  2. NT
    Nicolas T. Courtois

    University College London, United Kingdom

    7 publications · 164 citations

    7

    h-index

  3. WM
    Willi Meier

    FHNW University of Applied Sciences and Arts Northwestern Switzerland, Switzerland

    5 publications · 101 citations

    5

    h-index

  4. AK
    Alexandr Kuznetsov

    V. N. Karazin Kharkiv National University, Ukraine

    5 publications · 85 citations

    5

    h-index

  5. SG
    Shize Guo

    PLA Army Engineering University, China

    4 publications · 118 citations

    4

    h-index

1–5 of 537

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 28 publications · 604 citations

    16

    h-index

  2. Journal of Cryptology

    14 publications · 5K citations

    14

    h-index

  3. Designs Codes and Cryptography

    9 publications · 208 citations

    10

    h-index

  4. IEEE Transactions on Information Theory

    8 publications · 393 citations

    9

    h-index

  5. Journal of Mathematical Cryptology

    JMC · 9 publications · 374 citations

    9

    h-index

1–5