Fast norm computation in smooth-degree abelian number fields

DOI10.1007/S40993-022-00402-0MaRDI QIDQ6142769zbMATH OpenOpenAlexFDO

Authors Daniel J. Bernstein

Publication date 4 January 2024

Published in Research in Number Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s40993-022-00402-0

zbMATH Keywords

abelian number fieldscomputing norms in number fieldsfast method

Mathematics Subject Classification ID

Cyclotomic extensions (11R18) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing normal integral bases of abelian number fields
• Norm relations and computational problems in number fields
• Fast computation of class fields given their norm group
• scientific article; zbMATH DE number 176719
• scientific article; zbMATH DE number 833314

Cites work

• Accelerated tower arithmetic
• Advanced Topics in Computional Number Theory
• Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings
• 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
• Algebraic theory of finite Fourier transforms
• Algorithms -- ESA '94. 2nd annual European symposium, Utrecht, the Netherlands, September 26--28, 1994. Proceedings
• ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 -- July 4, 2020
• Canonical bases for cyclotomic fields
• Chebotarëv and his density theorem
• Class numbers of totally real fields and applications to the Weber class number problem
• Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
• Computing the N-th term of a q-holonomic sequence
• Dandelin, Lobacevskii, or Graeffe
• Explicit smoothed prime ideals theorems under GRH
• Factoring with Cyclotomic Polynomials
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
• Fast Library for Number Theory: An Introduction
• Fast multiplication and its applications
• Fast multiplication of large numbers
• Faster computation of isogenies of large prime degree
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3856407 (Why is no real title available?)
• scientific article; zbMATH DE number 3743192 (Why is no real title available?)
• scientific article; zbMATH DE number 3765129 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 3480719 (Why is no real title available?)
• scientific article; zbMATH DE number 1246620 (Why is no real title available?)
• scientific article; zbMATH DE number 467153 (Why is no real title available?)
• scientific article; zbMATH DE number 475433 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• scientific article; zbMATH DE number 3794179 (Why is no real title available?)
• scientific article; zbMATH DE number 3801619 (Why is no real title available?)
• scientific article; zbMATH DE number 5486283 (Why is no real title available?)
• scientific article; zbMATH DE number 3221502 (Why is no real title available?)
• scientific article; zbMATH DE number 967875 (Why is no real title available?)
• Implementing Gentry's fully-homomorphic encryption scheme
• Integer multiplication in time \(O(n\log n)\)
• Integral bases for subfields of cyclotomic fields
• LATIN '95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3--7, 1995. Proceedings
• Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings
• Norm forms for arbitrary number fields as products of linear polynomials
• Number fields
• Numbers with small prime factors, and the least 𝑘th power non-residue
• On Computing the Discrete Fourier Transform
• On the Stickelberger ideal and the circular units of a cyclotomic field
• Probabilistic algorithms for computing resultants
• Proceedings of the 2005 international symposium on symbolic and algebraic computation, ISSAC'05, Beijing, China, July 24--27, 2005.
• Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
• Selected areas in cryptography -- SAC 2014. 21st international conference, Montreal, QC, Canada, August 14--15, 2014. Revised selected papers
• Short generators without quantum computers: the case of multiquadratics
• Smooth numbers: computational number theory and beyond
• Some Applications of the Mellin Transform in Statistics
• Some results on computational complexity
• Subresultants and Reduced Polynomial Remainder Sequences
• Subring homomorphic encryption
• The Calculation of Multivariate Polynomial Resultants
• The Computational Complexity of Continued Fractions
• The determination of Gauss sums
• The development of the number field sieve
• The Fast Fourier Transform in a Finite Field
• The last chapter of the Disquisitiones of Gauss
• The number of extensions of a number field with fixed degree and bounded discriminant
• The Prime Factors of Wendt's Binomial Circulant Determinant
• Topics in computational algebraic number theory

Cited in

(3)

• Subquadratic-time algorithms for normal bases
• Carousel: fully homomorphic encryption with bootstrapping over automorphism group
• A survey of polynomial multiplications for lattice-based cryptosystems

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Fast norm computation in smooth-degree abelian number fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6142769)