Fast Chinese remaindering in practice

DOI10.1007/978-3-319-72453-9_7MaRDI QIDQ4628483zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven

Publication date 14 March 2019

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72453-9_7

zbMATH Keywords

algorithmChinese remainder theoremcomplexityinteger matrix multiplication

Mathematics Subject Classification ID

Matrices of integers (15B36) Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast arithmetics using Chinese remaindering
• scientific article; zbMATH DE number 17620
• A Sharpened Dynamic Range of a Generalized Chinese Remainder Theorem for Multiple Integers
• scientific article; zbMATH DE number 1122449
• Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system

Cited in

(9)

• A note on Chang-Lai's modular square algorithm based on the generalized Chinese remainder theorem
• Integer multiplication in time \(O(n\log n)\)
• Fast evaluation of iterated multiplication of very large polynomials: an application to Chinese remainder theory
• scientific article; zbMATH DE number 17620 (Why is no real title available?)
• scientific article; zbMATH DE number 2114065 (Why is no real title available?)
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• Dyadically resolving trinomials for fast modular arithmetic
• Chinese remaindering with multiplicative noise
• Fast arithmetics using Chinese remaindering

This page was built for publication: Fast Chinese remaindering in practice

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