Pollard's rho algorithm for logarithms: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

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

curprev 04:5704:57, 16 July 2018 72.33.2.214 talk 6,495 bytes +11 clarified that G is of order n for eta's formula in the intro, not of order p as in algorithm description subsequently. undo

curprev 05:2005:20, 28 June 2018 KatnissEverdeen talk contribs m 6,484 bytes +282 Reverted 1 edit by 103.86.23.15 (talk) to last revision by 128.30.60.184. (TW) undo Tag: Undo

curprev 11:1611:16, 27 June 2018 103.86.23.15 talk 6,202 bytes −282 →Complexity undo

curprev 02:3902:39, 19 March 2018 128.30.60.184 talk 6,484 bytes −24 →Algorithm: Use less painful typography for modulo. undo

curprev 13:1913:19, 13 December 2017 201.4.65.187 talk 6,508 bytes +25 Fixing the code example undo

curprev 12:0212:02, 18 November 2017 89.204.154.226 talk 6,483 bytes −25 →Example: Fixed the double random generation of A and B. undo Tags: Mobile edit Mobile web edit

curprev 22:2622:26, 21 February 2017 82.79.114.5 talk 6,508 bytes +4 →Algorithm: cg link undo

curprev 16:3916:39, 22 January 2017 145.116.188.225 talk 6,504 bytes −7 Clarify that not every solution of <math>(B-b)\gamma = (a-A) \pmod{n}</math> is a logarithm undo

curprev 20:1020:10, 16 November 2016 145.116.189.186 talk 6,511 bytes −28 It is not a "simplification" to assume that a finite cyclic group has an order undo

curprev 18:4318:43, 9 October 2016 Headbomb talk contribs m 6,539 bytes +2 fix minus sign, cleanup sup/sub, replaced: <sup>- → <sup>− using AWB undo

curprev 06:4006:40, 11 February 2016 Cedar101 talk contribs m 6,537 bytes −56 →Algorithm: \begin{cases} undo
curprev 06:3706:37, 11 February 2016 Cedar101 talk contribs m 6,593 bytes +354 →Algorithm: https://en.wikipedia.org/wiki/Wikipedia:WikiProject_Computer_science/Manual_of_style#Low-level_pseudocode undo

curprev 04:3004:30, 31 October 2015 Jerryobject talk contribs m 6,239 bytes −2 Cut needless carriage returns. undo
curprev 04:2804:28, 31 October 2015 Jerryobject talk contribs m 6,241 bytes −32 Small WP:EoS WP:COPYEDITs. Cut needless carriage return. WP:LINK update, cut needless WP:PIPE. undo

curprev 19:0719:07, 15 October 2015 142.254.29.241 talk 6,273 bytes +5 →Example undo
curprev 19:0519:05, 15 October 2015 142.254.29.241 talk 6,268 bytes +2 →Algorithm undo

curprev 08:5208:52, 15 June 2015 Rjwilmsi talk contribs 6,266 bytes +1 →References: 10.2307/2006496 undo

curprev 16:3616:36, 20 April 2015 Goffrie talk contribs m 6,265 bytes +6 →Example: C doesn't have '&' references undo

curprev 18:3218:32, 17 March 2015 Garve Ragnara talk contribs 6,259 bytes +207 →Complexity undo

curprev 00:2800:28, 7 October 2014 2607:f470:6:5002:28a8:dfa:6ece:8b37 talk 6,052 bytes −13 No edit summary undo

curprev 19:0919:09, 7 July 2014 134.3.201.241 talk 6,065 bytes +23 →Example: That's C without using C++ additions. undo

curprev 13:4913:49, 16 August 2013 94.224.28.191 talk 6,042 bytes −7 No edit summary undo

curprev 06:3106:31, 16 July 2013 2.182.30.99 talk 6,049 bytes 0 →Complexity undo
curprev 06:3106:31, 16 July 2013 2.182.30.99 talk 6,049 bytes 0 →Complexity undo

curprev 10:4110:41, 4 May 2013 Niceguyedc talk contribs m 6,049 bytes +29 WPCleaner v1.27 - Repaired 1 link to disambiguation page - (You can help) - John Pollard undo

curprev 01:0301:03, 28 April 2013 70.36.136.174 talk 6,020 bytes +39 No edit summary undo

curprev 19:4519:45, 24 March 2013 128.173.58.205 talk 5,981 bytes +2 →Example undo
curprev 19:3519:35, 24 March 2013 2001:468:c80:8109:f8d7:66ae:f92d:f7f5 talk 5,979 bytes −2 →Example undo

curprev 02:1402:14, 14 March 2013 Addbot talk contribs m 5,981 bytes −95 Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q4053693 undo

curprev 09:2009:20, 21 July 2012 89.102.37.210 talk 6,076 bytes +9 No edit summary undo
curprev 09:1709:17, 21 July 2012 89.102.37.210 talk 6,067 bytes −32 edited intro: partition G into G_0, G_1 and G_2 will never be into subgroups! undo

curprev 22:3322:33, 5 July 2012 72.37.244.76 talk 6,099 bytes +10 →Algorithm undo

curprev 18:2518:25, 30 June 2012 188.230.130.59 talk 6,089 bytes −1 →Complexity undo

curprev 22:3222:32, 22 May 2012 213.143.72.172 talk 6,090 bytes −8 Corrected the moduli in f and g (should be the order of the underlying group, i.e. p). undo

curprev 03:4903:49, 11 November 2011 138.16.109.55 talk 6,098 bytes +18 →Complexity undo

curprev 20:5820:58, 24 July 2011 Bender235 talk contribs 6,080 bytes +215 →References undo

curprev 05:2805:28, 29 May 2011 Ciphergoth talk contribs 5,865 bytes −26 Remove markup that assumes the group is the multiplicative one mod N; this applies also to eg elliptic curves undo

curprev 15:0015:00, 26 May 2011 67.189.3.92 talk 5,891 bytes +8 →Algorithm: a^(p-1) = 1, which is what we want since g() and h() are exponents. undo

curprev 23:1323:13, 22 April 2011 129.137.213.62 talk 5,883 bytes 0 Changed wording slightly. undo

curprev 12:3312:33, 17 April 2011 213.67.74.59 talk 5,883 bytes −24 Correction undo

curprev 23:4923:49, 19 December 2009 Maikol~enwiki talk contribs 5,907 bytes −23 No edit summary undo

curprev 14:2514:25, 4 November 2009 Jengelh talk contribs m 5,930 bytes +2 →Example: that's just C undo

curprev 13:1313:13, 5 September 2009 Prophile talk contribs 5,928 bytes +4 →Example: Notated the program as being C++ - this is NOT valid C, C has no concept of references as used in the parameters of new_xab. undo

curprev 16:4616:46, 22 August 2009 84.153.12.71 talk 5,924 bytes −6 order of group does not have to be prime - in fact, it probably is not undo

curprev 09:1509:15, 9 August 2009 Charvest talk contribs 5,930 bytes +33 {{Number-theoretic algorithms}} undo

curprev 09:1309:13, 19 July 2009 Laurentius talk contribs m 5,897 bytes +41 +Category:Number theoretic algorithms undo

curprev 23:4923:49, 25 April 2009 91.78.251.107 talk 5,856 bytes +3 →Algorithm <sup> -1 </sup> undo

curprev 20:0420:04, 10 March 2009 Quadrescence talk contribs m 5,853 bytes −8 →Algorithm undo

curprev 14:2914:29, 7 February 2009 Phraine talk contribs m 5,861 bytes 0 →changed the example into pure C, since it already is 99% C-compatible undo

curprev 13:1613:16, 6 November 2008 124.183.144.90 talk 5,861 bytes 0 →Algorithm undo

Pollard's rho algorithm for logarithms: Revision history

16 July 2018

28 June 2018

27 June 2018

19 March 2018

13 December 2017

18 November 2017

21 February 2017

22 January 2017

16 November 2016

9 October 2016

11 February 2016

31 October 2015

15 October 2015

15 June 2015

20 April 2015

17 March 2015

7 October 2014

7 July 2014

16 August 2013

16 July 2013

4 May 2013

28 April 2013

24 March 2013

14 March 2013

21 July 2012

5 July 2012

30 June 2012

22 May 2012

11 November 2011

24 July 2011

29 May 2011

26 May 2011

22 April 2011

17 April 2011

19 December 2009

4 November 2009

5 September 2009

22 August 2009

9 August 2009

19 July 2009

25 April 2009

10 March 2009

7 February 2009

6 November 2008