利用线性代数逆向工程梅森旋转算法
本文探讨如何通过线性代数方法逆向工程梅森旋转算法（Mersenne Twister）。梅森旋转算法是一种广泛使用的伪随机数生成器，但其内部状态可以通过观察足够多的输出值并结合线性代数技术进行恢复。文章详细介绍了该算法的数学结构，并展示了如何利用矩阵运算和线性方程组求解来重建其内部状态，从而预测后续生成的随机数。
相关报道
The Mersenne Twister (MT) is a random number generator with strong statistical but weak cryptographic properties. This post demonstrates how to recover the internal state of an MT generator from its output using linear algebra, contrasting this approach with the usual bit twiddling method.
The post explains how to recover the internal state of the lehmer64 random number generator from its outputs, following a similar approach to a previous article on hacking the Mersenne Twister. The lehmer64 generator is noted for its simple implementation and high speed.
The article discusses the probability that a random n × n binary matrix (filled with 0s and 1s) is invertible, exploring different approaches to calculating this probability depending on the underlying assumptions about the entries.
A blog post discusses the probability that a random matrix over a finite field is invertible, noting that this probability converges quickly as the matrix dimension n increases.