Xorshift Generators
Summary
This article discusses Xorshift generators, a type of fast pseudorandom number generator used in computational applications.
Similar Articles
How hackers reverse Math.random()
This article demonstrates how to reverse common pseudo-random number generators (such as linear congruential generators, XOR shift, and Flash's RNG), and shows a practical attack by predicting mine positions in a Minesweeper game, emphasizing that ordinary random numbers should not be used in security contexts.
What is random generation?
An exploration of pseudo-random number generation in computers, focusing on linear congruential generators (LCGs) and their quality visualization. The article also touches on entropy sources like Cloudflare's lava lamps and serves as a precursor to property-based testing.
XOR'ing a register with itself is the idiom for zeroing it out. Why not sub?
Raymond Chen explores why x86 compilers universally prefer "xor eax,eax" over "sub eax,eax" to zero a register, attributing it to historical momentum and slightly safer flag behavior rather than technical superiority.
Suffix BWT vs cyclic shift BWT, and fast computation
Explains two variants of the Burrows-Wheeler transform (cyclic shift and suffix) and fast computation methods, aimed at data compression enthusiasts.
Device Clock Generation
A technical blog post discussing methods for generating device clocks in FPGA and ASIC designs for interfacing with peripherals such as NOR flash and NAND flash.