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
Parents
712
An Algorithm for Subgraph Isomorphism
J. R. Ullmann · Journal of the ACM · 1976 · 2.3K citations · Full text
Proteinortho: Detection of (Co-)orthologs in large-scale analysis
Marcus Lechner, Sven Findeiß, Lydia Steiner et al. · BMC Bioinformatics · 2011 · 1.3K citations · Full text
Searching protein structure databases with DaliLite v.3
Liisa Holm, Sakari Kääriäinen, Päivi Rosenström et al. · Bioinformatics · 2008 · 1K citations · Full text
1–5 of 712
2.1K
8
h-index
5
h-index
5
h-index
5
h-index
4
h-index
1–5 of 2.1K
753
Carnegie Mellon University
Pittsburgh, United States
12 h-index
39 publications
1.2K citations
The University of Texas at Austin
Austin, United States
12 h-index
31 publications
4.8K citations
Tsinghua University
Beijing, China
11 h-index
38 publications
2.8K citations
University of California San Diego
San Diego, United States
10 h-index
21 publications
1K citations
University of California, Riverside
Riverside, United States
9 h-index
21 publications
2.7K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
19 publications
1.8K citations

University of Alberta
Edmonton, Canada
8 h-index
12 publications
443 citations
University of California, Berkeley
Berkeley, United States
8 h-index
12 publications
639 citations
1–8 of 753
Repository · 17 publications · 6.2K citations
14
h-index
8 publications · 1.5K citations
8
h-index
7 publications · 250 citations
7
h-index
6 publications · 159 citations
6
h-index
6 publications · 136 citations
6
h-index
1–5