<para>Ueli Maurer's <quote>Universal Statistical Test for Random
- Bit Generators</quote>(<link xlink:href="http://www.geocities.com/SiliconValley/Code/4704/universal.pdf">
+ Bit Generators</quote>(<link xlink:href="https://web.archive.org/web/20011115002319/http://www.geocities.com/SiliconValley/Code/4704/universal.pdf">
<acronym>MUST</acronym></link>) quickly measures the entropy
of a sample. It uses a compression-like algorithm. <link linkend="code">The code is given below</link> for a variant
which measures successive (~quarter megabyte) chunks of a
@@ -199,7 +199,7 @@
<title>Maurer's Universal Statistical Test (for block size=8
bits)</title>
- <para>You can find the same code at <link xlink:href="http://www.geocities.com/SiliconValley/Code/4704/uliscanc.txt">
+ <para>You can find the same code at <link xlink:href="https://web.archive.org/web/20031204230654/http://www.geocities.com:80/SiliconValley/Code/4704/uliscanc.txt">