翻訳言語

Slither.ioのネットワークプロトコルをリバースエンジニアリングする

本記事では、人気オンラインゲームSlither.ioのiOS版におけるネットワークプロトコルのリバースエンジニアリング手法を解説する。パケット解析や通信の傍受を通じて、サーバーとのデータのやり取りやゲーム内の動作ロジックを解明していく過程を紹介する。

Reverse engineering Mersenne Twister with Linear Algebra
3.0
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.
Hacking the lehmer64 RNG
2.0
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.
Probability that a random binary matrix is invertible
1.5
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.
Euler function
1.0
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.

翻訳言語

Reverse engineering Mersenne Twister with Linear Algebra
3.0
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.
Hacking the lehmer64 RNG
2.0
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.
Probability that a random binary matrix is invertible
1.5
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.
Euler function
1.0
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.

関連記事