Path Category
Loading Path Category from the AllPath API…
ALLPATHFoundationALLPATHFoundationPath Category
Loading Path Category from the AllPath API…
Path Category
Guided learning journeys that build knowledge step by step.
category · Learning · slug · learning · 7819 Paths
7819 Paths · page 709 / 782
This learning path equips finance and computer science students with the number-theoretic foundations essential to modern financial cryptography. Starting from modular arithmetic and prime numbers, it progresses through RSA and elliptic curve cryptography, covering their mathematical underpinnings, practical implementations, and applications in secure transactions and digital signatures.
This learning path bridges pure number theory and practical hashing. It starts with modular arithmetic and builds toward the mathematical foundations of hash functions, including collision resistance and cryptographic applications. Designed for CS and cybersecurity students aiming to understand the 'why' behind hash function design.
This learning path guides university students from the foundations of finite fields to the construction and decoding of Reed-Solomon and BCH codes. It covers necessary number theory and algebra, emphasizing how finite field properties enable powerful error correction. The path is designed for computer science and mathematics students seeking to apply number theory in coding theory.
This learning path takes you from the fundamental number theory and algebraic structures needed to understand elliptic curves, through the elliptic curve discrete logarithm problem, to the design and analysis of the ECDSA signature scheme. It is designed for computer science and cybersecurity students seeking a rigorous, career-oriented understanding of ECC.
This path equips computer science and cybersecurity students with a rigorous understanding of the RSA public-key cryptosystem. Starting from modular arithmetic and Euler's theorem, it builds the necessary number theory, explains key generation and encryption/decryption, and discusses the security assumptions and practical considerations that underpin RSA.
A focused learning path for university-level CS and mathematics students to understand and implement integer factorization algorithms, from basic trial division through Pollard's rho and the quadratic sieve. It builds on modular arithmetic and number theory foundations, progressing to advanced algorithmic techniques.
A comprehensive learning path covering deterministic and probabilistic primality testing algorithms, from modular arithmetic foundations through Miller-Rabin and the AKS primality test. Designed for university-level mathematics and computer science students seeking career-relevant skills in number theory and algorithm design.
A systematic graduate-level path through Diophantine approximation, starting with foundational real analysis and building up through continued fractions and metric theory to the Thue-Siegel-Roth theorem and its applications. The path emphasizes rigorous proofs, quantitative bounds, and the deep interplay between number theory and analysis.
A systematic graduate-level path introducing p-adic numbers and basic p-adic analysis. It builds from algebraic foundations through analytic concepts to Hensel's lemma and applications, emphasizing the non-Archimedean perspective.
A systematic graduate-level path to understanding p-adic numbers, starting from the algebraic foundations of valuations and completions, through the construction of Z_p and Q_p, and into the analytic and algebraic properties that make p-adic numbers a powerful tool in number theory.