Efficient Finite Fields in the Maxima Computer Algebra System
From MaRDI portal
Publication:3519552
DOI10.1007/978-3-540-69499-1_6zbMath1202.12001OpenAlexW1497630286MaRDI QIDQ3519552
Alasdair McAndrew, Jacopo D'Aurizio, Fabrizio Caruso
Publication date: 19 August 2008
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- On the computation of square roots in finite fields
- Finite field manipulations in Macsyma
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- Searching for Primitive Roots in Finite Fields
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient Finite Fields in the Maxima Computer Algebra System
