Efficient software-implementation of finite fields with applications to cryptography

DOI10.1007/S10440-006-9046-1MaRDI QIDQ850780zbMATH OpenOpenAlexFDO

Authors Jorge Guajardo, Sandeep S. Kumar, Christof Paar, Jan Pelzl

Publication date 6 November 2006

Published in Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10440-006-9046-1

zbMATH Keywords

cryptographyfield arithmeticefficient implementationoptimal extension fieldbinary field arithmeticextension field arithmeticprime field arithmetic

Mathematics Subject Classification ID

Field arithmetic (12E30) Number-theoretic algorithms; complexity (11Y16) Special polynomials in general fields (12E10) Research exposition (monographs, survey articles) pertaining to field theory (12-02)

Recommendations

• Efficient hardware implementation of finite fields with applications to cryptography
• Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
• scientific article; zbMATH DE number 1759279
• scientific article; zbMATH DE number 2080690
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• Efficient Finite Fields in the Maxima Computer Algebra System
• The computational efficacy of finite-field arithmetic
• scientific article; zbMATH DE number 2058638
• scientific article; zbMATH DE number 1504541

Cites work

• scientific article; zbMATH DE number 1583946 (Why is no real title available?)
• scientific article; zbMATH DE number 1617931 (Why is no real title available?)
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 177038 (Why is no real title available?)
• scientific article; zbMATH DE number 1302866 (Why is no real title available?)
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 1030980 (Why is no real title available?)
• scientific article; zbMATH DE number 1759279 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Computer Algorithm for Calculating the Product AB Modulo M
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Constructive and destructive facets of Weil descent on elliptic curves
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
• Modular Multiplication Without Trial Division
• New directions in cryptography

Cited in

(25)

• Efficient software implementation of binary field arithmetic using vector instruction sets
• scientific article; zbMATH DE number 1857519 (Why is no real title available?)
• Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
• Efficient Finite Fields in the Maxima Computer Algebra System
• scientific article; zbMATH DE number 3961485 (Why is no real title available?)
• scientific article; zbMATH DE number 1878332 (Why is no real title available?)
• scientific article; zbMATH DE number 2085208 (Why is no real title available?)
• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• scientific article; zbMATH DE number 5066607 (Why is no real title available?)
• An alternative class of irreducible polynomials for optimal extension fields
• Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
• Practical fast algorithm for finite field arithmetics using group rings
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• scientific article; zbMATH DE number 2043312 (Why is no real title available?)
• Binary fields on limited systems
• Arithmetic of binary finite fields
• Information Security and Privacy
• scientific article; zbMATH DE number 1979305 (Why is no real title available?)
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• Selected Areas in Cryptography
• Efficient hardware implementation of finite fields with applications to cryptography
• Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
• scientific article; zbMATH DE number 2080690 (Why is no real title available?)
• scientific article; zbMATH DE number 1759315 (Why is no real title available?)
• Software-implementable pseudoprobabilistic fast block ciphers

Describes a project that uses

Uses Software

• DSP56000

This page was built for publication: Efficient software-implementation of finite fields with applications to cryptography

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