A Course in Computational Algebraic Number Theory

1993/01/01 by Henri Cohen · 12 citations
Computer Science · Engineering · Mathematics · #Advanced Mathematical Theories #Algebraic number #Computability, Logic, AI Algorithms #Computer science #Computer security #Course (navigation) #Cryptography #Engineering #Mathematics #Mathematics education #Subject (documents) #Theoretical computer science #World Wide Web

paper · doi:10.1007/978-3-662-02945-9

crossref issued 1993/01/01 · crossref published 1993/01/01 · crossref published-print 1993/01/01 · openalex publication_date 1993/01/01 · crossref created 2013/03/09 · crossref deposited 2019/04/06 · openalex created_date 2025/10/10 · crossref indexed 2026/08/04 · openalex updated_date 2026/08/04

Cited by

• High-performance NTT accelerators for PQC leveraging Unified Redundant Arithmetic and Fine-Tuned Microarchitecture
• SU(N) monopoles and Platonic symmetry
• Explicit Factorization of Xⁿ-1 over ℤ_p^e via Cofactor-Free Single-Seed Hensel Lifting
• A C implementation of the Smith massager algorithm
• On Word Representations and Embeddings in Complex Matrices
• Computing Arithmetic Invariants of 3-Manifolds
• Repellent properties of perfect powers on partition functions: a heuristic approach
• Algebraic K-Theory of Rings of Integers in Local and Global Fields
• A space efficient algorithm for group structure computation
• On pairs of primes with small order reciprocity
• An LLL Algorithm with Quadratic Complexity
• Lenstra elliptic-curve factorization [wikipedia]