Fast norm computation in smooth-degree abelian number fields
From MaRDI portal
Publication:6142769
DOI10.1007/s40993-022-00402-0OpenAlexW4388565810MaRDI QIDQ6142769
Publication date: 4 January 2024
Published in: Research in Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40993-022-00402-0
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Cyclotomic extensions (11R18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selected areas in cryptography -- SAC 2014. 21st international conference, Montreal, QC, Canada, August 14--15, 2014. Revised selected papers
- Advances in cryptology -- EUROCRYPT 2017. 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30 -- May 4, 2017. Proceedings. Part III
- Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings
- Topics in computational algebraic number theory
- The development of the number field sieve
- Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
- Some results on computational complexity
- On the Stickelberger ideal and the circular units of a cyclotomic field
- Algorithms -- ESA '94. 2nd annual European symposium, Utrecht, the Netherlands, September 26--28, 1994. Proceedings
- Integral bases for subfields of cyclotomic fields
- Chebotarëv and his density theorem
- Subring homomorphic encryption
- LATIN '95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3--7, 1995. Proceedings
- Canonical bases for cyclotomic fields
- ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 -- July 4, 2020
- Accelerated tower arithmetic
- The number of extensions of a number field with fixed degree and bounded discriminant
- Algebraic theory of finite Fourier transforms
- Fast multiplication of large numbers
- Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings
- Integer multiplication in time \(O(n\log n)\)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Explicit smoothed prime ideals theorems under GRH
- Class numbers of totally real fields and applications to the Weber class number problem
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Norm forms for arbitrary number fields as products of linear polynomials
- Dandelin, Lobacevskii, or Graeffe
- The Computational Complexity of Continued Fractions
- Factoring with Cyclotomic Polynomials
- The determination of Gauss sums
- The Prime Factors of Wendt's Binomial Circulant Determinant
- On Computing the Discrete Fourier Transform
- Advanced Topics in Computional Number Theory
- The last chapter of the Disquisitiones of Gauss
- Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
- Computing the N-th term of a q-holonomic sequence
- Probabilistic algorithms for computing resultants
- Subresultants and Reduced Polynomial Remainder Sequences
- Numbers with small prime factors, and the least 𝑘th power non-residue
- The Fast Fourier Transform in a Finite Field
- The Calculation of Multivariate Polynomial Resultants
- Short Generators Without Quantum Computers: The Case of Multiquadratics
- Fast Library for Number Theory: An Introduction
- Some Applications of the Mellin Transform in Statistics
- Faster computation of isogenies of large prime degree
- Number fields
