scientific article; zbMATH DE number 5494037
From MaRDI portal
Publication:5301666
zbMath1190.68088MaRDI QIDQ5301666
Paul Zimmermann, Alexander Kruppa, Pierrick Gaudry
Publication date: 20 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items (6)
A multimodular algorithm for computing Bernoulli numbers ⋮ Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Integer multiplication in time \(O(n\log n)\) ⋮ Complexity of computation in finite fields ⋮ Fast integer multiplication using generalized Fermat primes ⋮ Faster Multiplication in GF(2)[x]
Uses Software
This page was built for publication:
