Dyadically resolving trinomials for fast modular arithmetic

DOI10.1007/S11786-026-00634-8MaRDI QIDQ7356893zbMATH OpenFDO

Authors Robert Dougherty-Bliss, Natalya Ter-Saakov, Mits Kobayashi, Eugene Zima

Publication date 25 September 2026

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11786-026-00634-8

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Congruences; primitive roots; residue systems (11A07) Polynomials in number theory (11C08)

Cites work

• A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form (2n - (2p   1))
• Algorithm 457: finding all cliques of an undirected graph
• Cunningham numbers in modular arithmetic
• Factorization of polynomials over finite fields
• Fast Chinese remaindering in practice
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• Integer multiplication in time \(O(n\log n)\)
• Lots and lots of Perrin-type primality tests and their pseudo-primes
• Multiplikation großer Zahlen
• On A 4 + B 4 + C 4 = D 4
• On a two-layer modular arithmetic
• Proof of George Andrews's and David Robbins's q-TSPP conjecture
• Resultants of Cyclotomic Polynomials
• Simultaneous conversions with the residue number system using linear algebra
• The LLL algorithm. Survey and applications
• The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier

This page was built for publication: Dyadically resolving trinomials for fast modular arithmetic

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