Skip to content

ὑπομνήματα

HomeTopicsLexiconOn the Custos
HomeTopicsLexiconOn the Custos
Home

❯

Topics

❯

Physics

❯

Quantum Computing

❯

I. Fundamental Concepts

❯

Preliminaries

❯

Number Theory

Number Theory

Sep 24, 20261 min read

Hypomnemata

Language: English
English한국어AIFrançaisno translationDeutschno translationLatinano translationРусскийno translation

This section focuses on the number theory behind classical public-key cryptography and Shor’s algorithm.

Use the sequence below as the local map for this section.

Sequence

  • 01. Modular Arithmetic
  • 02. The Euclidean Algorithm and GCD
  • 03. The Chinese Remainder Theorem
  • 04. Euler’s and Fermat’s Theorems
  • 05. Discrete Logarithms and Primitive Roots
  • 06. Primality and Factoring
  • 07. Elliptic Curves and the ECDLP
  • 08. Continued Fractions
  • Sep 24, 2026

    01. Modular Arithmetic

    • Sep 24, 2026

      02. The Euclidean Algorithm and GCD

      • Sep 24, 2026

        03. The Chinese Remainder Theorem

        • Sep 24, 2026

          04. Euler's and Fermat's Theorems

          • Sep 24, 2026

            05. Discrete Logarithms and Primitive Roots

            • Sep 24, 2026

              06. Primality and Factoring

              • Sep 24, 2026

                07. Elliptic Curves and the ECDLP

                • Sep 24, 2026

                  08. Continued Fractions

                  Written directly in English

                  Created with Quartz v4.5.2 © 2026

                  • Lexicon
                  • Map of the Notebook
                  • Colophon