Matrix inversion
Matrix inversion is the operation of computing a matrix that, when multiplied by a given invertible matrix, produces the identity matrix.
Hacking Cryptography
Matrix inversion is the operation of finding a matrix that multiplies with a given invertible matrix to produce the identity matrix.
- How it is used
- Recovers LFSR tap coefficients from observed output bits during a stream-cipher exploit.
- How deep it goes
- Explains matrix construction, Boolean arithmetic, inversion failure, and executable recovery, but stops short of deriving inversion internals.
- Examples
- Demonstrates inversion through Go recovery routines and a known-prefix attack that decrypts a timestamp.
- What you can do after
- Diagnose and clone an LFSR when enough observed bits and a valid invertible state matrix are available.
Geometry for Programmers
Matrix inversion is the operation of finding a matrix that multiplies with a given matrix to produce an identity matrix, when such a matrix exists.
- How it is used
- Uses inversion to undo geometrical transformations and clean up matrix-based computations.
- How deep it goes
- Defines inverse matrices and identity multiplication, but defers manual algorithms and detailed applications.
- Examples
- Uses a paired-matrix example whose products produce the identity matrix.
- What you can do after
- Apply inversion with SymPy and recognize when multiplication produces an identity matrix.
Read how Geometry for Programmers explains matrix inversion →
Related concepts
- cofactor transpositionalternative to · Cofactor transposition is the construction of a transposed cofactor matrix that represents a matrix inverse up to multiplication by the determinant.
- diagonalizationcontrasts with · A matrix transformation technique that expresses a square matrix in a basis where it becomes diagonal, simplifying computations such as powers.
- linear systemaddressed by · A linear system is a set of linear relationships among variables, commonly expressed as simultaneous equations or a linear transformation, for which superposition applies.
- singular value decompositioncontrasts with · Singular value decomposition is a matrix factorization that expresses a matrix as the product of orthogonal or unitary matrices and a diagonal matrix of nonnegative singular values.
- determinantcontrasts with · A determinant is a scalar computed from a square matrix that characterizes properties such as invertibility and signed volume scaling.
- projective transformationuses · A projective transformation is a mapping of projective-space points represented by homogeneous linear coordinates that preserves incidence but may not preserve parallelism.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.