Jump to content

Tonelli–Shanks algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

9 July 2025

15 May 2025

17 February 2025

22 December 2024

20 November 2024

18 January 2024

13 September 2023

11 September 2023

7 September 2023

14 May 2023

19 April 2022

15 November 2021

25 March 2021

  • curprev 15:4715:47, 25 March 2021 71.187.248.147 talk 18,511 bytes +51 Uses: The quadratic sieve is a better example than Rabin's cryptosystem, which frequently sidesteps Tonelli-Shanks by restricting to the p=3 mod 4 case. The linked page on the quadratic sieve mentions Shanks-Tonelli already. undo

21 December 2020

27 November 2020

28 July 2020

15 April 2020

31 March 2020

20 March 2020

17 March 2020

13 February 2020

3 January 2020

19 November 2019

10 June 2019

2 April 2019

2 March 2019

20 November 2018

18 September 2018

14 June 2018

16 May 2018

10 May 2018

30 March 2018

11 March 2018

22 February 2018

21 February 2018

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)