Efficient Finite Fields in the Maxima Computer Algebra System

DOI10.1007/978-3-540-69499-1_6MaRDI QIDQ3519552zbMATHOpenAlexFDO

Authors Fabrizio Caruso, Jacopo D'Aurizio, A. McAndrew

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

zbMATH Keywords

finite fieldsprimitive elementMaximamodular roots

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• Efficient computation of roots in finite fields
• The computational efficacy of finite-field arithmetic
• Efficient software-implementation of finite fields with applications to cryptography
• Fast arithmetic for the algebraic closure of finite fields
• Efficient and optimal exponentiation in finite fields
• Selected Areas in Cryptography
• Algorithms for finite field arithmetic
• Computational problems in the theory of finite fields

Cites work

• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• scientific article; zbMATH DE number 1722964 (Why is no real title available?)
• scientific article; zbMATH DE number 3167868 (Why is no real title available?)
• scientific article; zbMATH DE number 4083539 (Why is no real title available?)
• scientific article; zbMATH DE number 107769 (Why is no real title available?)
• scientific article; zbMATH DE number 3480679 (Why is no real title available?)
• scientific article; zbMATH DE number 503339 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1904067 (Why is no real title available?)
• scientific article; zbMATH DE number 2104340 (Why is no real title available?)
• scientific article; zbMATH DE number 3341170 (Why is no real title available?)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Finite field manipulations in Macsyma
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• On the computation of square roots in finite fields
• Searching for Primitive Roots in Finite Fields

Cited in

(4)

• Efficient software-implementation of finite fields with applications to cryptography
• scientific article; zbMATH DE number 5926987 (Why is no real title available?)
• Finite field manipulations in Macsyma
• scientific article; zbMATH DE number 4099398 (Why is no real title available?)

Describes a project that uses

Uses Software

• Maxima

This page was built for publication: Efficient Finite Fields in the Maxima Computer Algebra System

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