Jump to content

Shor's 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)

1 July 2025

17 June 2025

15 June 2025

11 June 2025

10 May 2025

7 May 2025

27 March 2025

16 March 2025

8 March 2025

25 February 2025

20 February 2025

18 January 2025

6 December 2024

26 November 2024

  • curprev 09:1309:13, 26 November 2024 217.93.164.171 talk 41,386 bytes −20 "RSA is based on the computational intractability of factoring" is wrong/unprecise. Or rather: We don't know if it's true right now. We know that RSA can be broken if factoring is easy, but there is no proof "Factoring is hard => RSA is secure". Right now, the security of RSA is based on the "RSA assumption". Statements like "RSA is based on factoring" should therefore be avoided. See for example the book "Introduction to Modern Cryptography", Katz & Lindell, Third Edition, Chapter 12.5 undo Tag: Visual edit

11 November 2024

25 October 2024

24 October 2024

22 October 2024

19 October 2024

12 September 2024

12 August 2024

  • curprev 09:5909:59, 12 August 2024 Citation bot talk contribs 41,492 bytes +111 Alter: date, title, template type. Add: pages, doi, issue, volume, journal, arxiv, pmid. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 487/748 undo

17 July 2024

15 July 2024

8 July 2024

29 June 2024

28 June 2024

27 June 2024

23 June 2024

10 June 2024

5 June 2024

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