Brute-force search tests candidate values systematically until one satisfies the required conditions. Recovering an unknown LFSR length becomes practical when each candidate is checked by matrix inversion. section 4.2.2
Brute-force search
A brute-force search systematically tests possible candidates until one satisfies the required conditions.
How Hacking Cryptography covers it
- How deep it goes
- Demonstrates candidate enumeration, matrix inversion, decryption, and validation, stopping short of deriving the more efficient Berlekamp–Massey algorithm.
- Examples
- Demonstrates recovery from an ATTACK AT prefix and validates the decrypted timestamp against a concrete test message.
- What it assumes
- Assumes known plaintext, ciphertext, XOR, observed keystream bits, and matrix inversion while teaching the recovery workflow concretely.
- What you can do after
- Diagnose and exploit recoverable LFSR ciphertext by testing lengths, reconstructing taps, and validating decrypted plaintext.
- How it connects
- Connects LFSRs with known-plaintext attacks, XOR, matrix inversion, and Berlekamp–Massey algorithm.
Also explained in
-
Optimization Algorithms: AI techniques for design, planning, and control problemsA graph-search strategy that explores states without using problem-specific information to prioritize promising alternatives.
-
Advanced Algorithms and Data StructuresBrute-force search exhaustively examines the available candidates to find results without using an indexing or pruning strategy.
-
Grokking AI Algorithms, Second EditionA brute-force approach systematically evaluates every possible combination or candidate in a problem's search space.
-
Classic Computer Science Problems in Swift: Essential techniques for practicing programmersBrute-force search systematically examines many or all possible candidates until a valid solution is found.
-
Machine Learning Algorithms in DepthComplete search is a problem-solving technique that traverses an entire search space to find a solution, optionally pruning parts known not to contain one.
-
Natural Language Processing in Action, Second EditionA brute-force search algorithm evaluates candidates directly, typically examining all available possibilities to find a match or optimum.
Compare how 7 books explain brute-force search →
Related concepts
- similarity searchkind of · Similarity search is a retrieval technique that finds or ranks items by comparing their representations with a query according to a similarity or distance measure.
- local searchcontrasts with · Local search is an optimization technique that iteratively modifies a candidate solution by exploring neighboring alternatives according to an improvement rule.
- informed searchcontrasts with · Informed search is a search strategy that uses problem-specific knowledge or heuristic estimates to prioritize promising states or paths.
- uniform-cost searchincludes · Uniform-cost search is a graph-search algorithm that repeatedly expands the frontier node with the lowest accumulated path cost.
- Dijkstra's algorithmincludes · Dijkstra's algorithm computes shortest paths from a source vertex in a weighted graph with nonnegative edge weights.
This explainer was generated by Manning's knowledge graph from the text of Hacking Cryptography. The section links point to the parts of the book it draws on.