Math & Engineering
xn--2-umb.com · 2,042 words · saved by 3 readers
Random collections of my notes and articles over the years, mostly about maths and/or engineering.
The Goldilocks Prime \gdef\delim#1#2#3{\mathopen{}\mathclose{\left#1 #2 \right#3}} \gdef\F{\mathbb{F}} \gdef\mod#1{\delim[{#1}]} In Ham15 Mike Hamburg introduced a class of primes of the form p = φ^2 - φ - 1 and named them Goldilocks primes. In those prime fields φ satisfies the Golden ratio relation φ² = φ + 1 . When φ is a power of two this allows for very efficient implementation. Unfortunately, the -1 at the end means it will have very few power-of-two roots of unity. We'd like to have many so we can do big number theoretic transforms. We will instead consider primes of the form p = φ^2 -
saved by
related reading
- VROOM: Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number Systemeprint.iacr.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- Napkin.pdfvenhance.github.io
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- RSA numbersen.wikipedia.org
- Structure and Interpretation of Computer Programs, 2e: 1.2sarabander.github.io
- Binary Exponentiation - Algorithms for Competitive Programmingcp-algorithms.com
- Factoring RSA-260cognition.com
- Number Theory - The Chinese Remainder Theoremcrypto.stanford.edu
- Cyclotomic polynomial - Wikipediaen.wikipedia.org
- Finite Fields and Modular Arithmetic for ZK Proofs | RareSkillsrareskills.io