From f3d5157564992f1ef9f390b3ce0c7d3706ba0f19 Mon Sep 17 00:00:00 2001
From: Laurent Bercot <ska-skaware@skarnet.org>
Date: Sun, 4 Oct 2020 01:06:16 +0000
Subject:  doc: fix URLs

---
 doc/libbiguint/index.html | 7 ++-----
 1 file changed, 2 insertions(+), 5 deletions(-)

(limited to 'doc/libbiguint/index.html')

diff --git a/doc/libbiguint/index.html b/doc/libbiguint/index.html
index 101b7b7..f0378dd 100644
--- a/doc/libbiguint/index.html
+++ b/doc/libbiguint/index.html
@@ -24,7 +24,7 @@
 operations on (unsigned) integers of arbitrary length. It is nowhere
 near as powerful or efficient as specialized,
 assembly language-optimized libraries such as
-<a href="http://gmplib.org/">GMP</a>, but it has the advantages
+<a href="https://gmplib.org/">GMP</a>, but it has the advantages
 of smallness and simplicity.
 </p>
 
@@ -381,10 +381,7 @@ The functions return 1 if all went well.
 <tt>bu_invmod()</tt> computes the inverse of <tt>c</tt> modulo <tt>m</tt>
 and stores it into <tt>c</tt>. <br />
 The divisor and <tt>m</tt> must be relatively prime, else
-those functions return 0 EDOM. <br />
- The algorithm for modular division and inversion is due to
-<a href="http://research.sun.com/techrep/2001/abstract-95.html">Sheueling
-Chang Shantz</a>.
+those functions return 0 EDOM.
 </p>
 
 </body>
-- 
cgit v1.2.3