From 63f56721d4c420307112f253de473455bcd0c627 Mon Sep 17 00:00:00 2001 From: Sebastiano Tronto Date: Thu, 27 Feb 2025 15:42:02 +0100 Subject: Make capitalization consistent in ECM talk --- src/talks/ecm/index.html.raw | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'src/talks') diff --git a/src/talks/ecm/index.html.raw b/src/talks/ecm/index.html.raw index 1ed9eb5..93b0919 100644 --- a/src/talks/ecm/index.html.raw +++ b/src/talks/ecm/index.html.raw @@ -1,7 +1,7 @@ - Elliptic Curves and the ECM algorithm + Elliptic Curves and the ECM Algorithm @@ -438,7 +438,7 @@ def find_factor(n: int) -> int:

To find a factor of \(n\):

    -
  1. Take a random Elliptic Curve \(E\) +
  2. Take a random elliptic curve \(E\) and a random point \(P\) of \(E\)
  3. Take a suitable number \(m\)
  4. Try to compute \(m\cdot P = P+P+\cdots+P\quad\) (\(m\) times) @@ -484,7 +484,7 @@ background-blend-mode: overlay;"> Q: Aren't we just computing the \(\operatorname{GCD}\) with random numbers?

    -A: Yes, but Elliptic Curve operations produce "good candidates" +A: Yes, but elliptic curve operations produce "good candidates" for these random numbers.

@@ -504,7 +504,7 @@ Pollard's \(p-1\) Algorithm, but ECM is faster.

Elliptic Curve Method - Questions

-Q: Are there objects that are more complicated than Elliptic Curves +Q: Are there objects that are more complicated than elliptic curves and can make the method even faster?

A: Yes, there are higher-dimensional @@ -594,7 +594,7 @@ background-blend-mode: overlay;"> // Function to add a footer to every slide. function slideFooter() { const start = "

"; - const title = "Elliptic Curves and the ECM algorithm" + const title = "Elliptic Curves and the ECM Algorithm" const link = "tronto.net/talks/ecm"; const end = "
"; const content = -- cgit v1.3