Brute-force Search

Brute-Force Search is a cryptographic attack method that systematically enumerates all possible keys or solutions within a given key space to exhaustively test each until the correct one is found, distinguished from other cryptanalytic techniques by its reliance on computational power rather than analytical or statistical shortcuts.

712

Publications

46.2K

Citations

2.1K

Authors

753

Institutions

Publications per year

2017–2026

241

Variants

Brute-force AttackExhaustive Key Search

Authors

2.1K

  1. EK
    Eamonn Keogh

    University of California, Riverside, United States

    8 publications · 976 citations

    8

    h-index

  2. GY
    Guang‐Hong Yang

    Northeastern University, China

    5 publications · 182 citations

    5

    h-index

  3. JS
    Jonathan Schaeffer

    University of Alberta, Canada

    5 publications · 136 citations

    5

    h-index

  4. FV
    Fedor V. Fomin

    University of Bergen, Norway

    5 publications · 116 citations

    5

    h-index

  5. RW
    Robert W. Heath

    The University of Texas at Austin, United States

    4 publications · 697 citations

    4

    h-index

1–5 of 2.1K

Venues

  1. arXiv (Cornell University)

    Repository · 17 publications · 6.2K citations

    14

    h-index

  2. Bioinformatics

    8 publications · 1.5K citations

    8

    h-index

  3. IEEE Transactions on Automatic Control

    7 publications · 250 citations

    7

    h-index

  4. IEEE Transactions on Wireless Communications

    6 publications · 159 citations

    6

    h-index

  5. IEEE Access

    6 publications · 136 citations

    6

    h-index

1–5