Fixed url

jwood000 · Aug 14, 2023 · f252d54 · f252d54
1 parent 80ed3e4
commit f252d54
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/README.md b/README.md
@@ -499,7 +499,7 @@ head(testBaseSort)
 
   * [Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware](<https://www.iacr.org/archive/ches2006/10/10.pdf>) by Gaj K. et al.
 
-  * [Integer Factorization using the Quadratic Sieve](<http://micsymposium.org/mics_2011_proceedings/mics2011_submission_28.pdf>) by Chad Seibert
+  * [Integer Factorization using the Quadratic Sieve](<https://micsymposium.org/mics_2011_proceedings/mics2011_submission_28.pdf>) by Chad Seibert
 
   * In the stackoverflow question and answer [What is the most efficient factoring algorithm for quadratic sieve extraction phase?](<https://stackoverflow.com/q/63541365/4408538>) by [Ilya Gazman](<https://github.com/gazman-sdk>), an efficient method for checking divisibility is sketched out that utilizes built-in types. You can see more on a video Ilya put on youtube: [E15: Quadratic Sieve Running on Java - Receiving](<https://youtu.be/sXg_WrCUX-Q>). While `mpz_divisible_ui_p` is very efficient, we found better performance using this method.
 

diff --git a/scripts/readme_script.R b/scripts/readme_script.R
@@ -216,7 +216,7 @@ reprex::reprex({
     #'
     #' * [Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware](<https://www.iacr.org/archive/ches2006/10/10.pdf>) by Gaj K. et al.
     #'
-    #' * [Integer Factorization using the Quadratic Sieve](<http://micsymposium.org/mics_2011_proceedings/mics2011_submission_28.pdf>) by Chad Seibert
+    #' * [Integer Factorization using the Quadratic Sieve](<https://micsymposium.org/mics_2011_proceedings/mics2011_submission_28.pdf>) by Chad Seibert
     #'
     #' * In the stackoverflow question and answer [What is the most efficient factoring algorithm for quadratic sieve extraction phase?](https://stackoverflow.com/q/63541365/4408538) by  [Ilya Gazman](https://github.com/gazman-sdk), an efficient method for checking divisibility is sketched out that utilizes built-in types. You can see more on a video Ilya put on youtube: [E15: Quadratic Sieve Running on Java - Receiving](https://youtu.be/sXg_WrCUX-Q). While `mpz_divisible_ui_p` is very efficient, we found better performance using this method.
     #'