Dense Arithmetic over Finite Fields with the CUMODP Library

DOI10.1007/978-3-662-44199-2_108zbMATH Open1402.11143OpenAlexW237584866MaRDI QIDQ2879202FDOQ2879202

Authors: Sardar Anisul Haque, Xin Li, F. Mansouri, Marc Moreno Maza, Ning Xie, Wei Pan 

Publication date: 8 September 2014

Published in: Mathematical Software – ICMS 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44199-2_108

Recommendations

• Fast arithmetic for the algebraic closure of finite fields
• On arithmetical algorithms over finite fields
• Algorithms for finite field arithmetic
• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
• The computational efficacy of finite-field arithmetic
• Selected Areas in Cryptography
• Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
• An efficient implementation for computing Gröbner bases over algebraic number fields
• Faster polynomial multiplication over finite fields

zbMATH Keywords

parallel processingpolynomial arithmeticmany-core GPUs

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to number theory (11-04) Finite fields and commutative rings (number-theoretic aspects) (11Txx)

Cited In (2)

• CUMODP
• CUMODP

Uses Software

• Magma
• CUDA
• FFTW

This page was built for publication: Dense Arithmetic over Finite Fields with the CUMODP Library

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