Lectures related to Computing Intersection Numbers

Explores the discrete log problem and index calculus method in cryptography.

Explains how to find particular solutions for first-order differential equations using different types of functions.

Covers the concept of real functions, focusing on continuity and the behavior of polynomials and ratios of polynomials.

Explores integration by recurrence method with examples of square roots and polynomials.

Covers Reed-Solomon codes for error handling in communication and practical applications in 2D barcodes.

Covers second degree trinomials, discriminants, Viète's formulas, and root calculations.

Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.

Introduces the problem of interpolation and demonstrates challenges with adding more points.

Covers Coppersmith's method for finding small roots of polynomials modulo N efficiently.