Hardware implementation of finite-field division

DOI10.1007/S10440-006-9049-YMaRDI QIDQ850787zbMATH OpenOpenAlexFDO

Authors Jean-Pierre Deschamps, Gustavo D. Sutter

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-9049-y

Mathematics Subject Classification ID

Arithmetic theory of polynomial rings over finite fields (11T55) Field arithmetic (12E30)

Recommendations

• Efficient hardware implementation of finite fields with applications to cryptography
• Hardware Division by Small Integer Constants
• Hardware implementation of multiplication over quartic extension fields
• scientific article; zbMATH DE number 1979307
• scientific article; zbMATH DE number 5504474
• scientific article; zbMATH DE number 1135079
• Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)
• Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
• Hardware Aspects of Montgomery Modular Multiplication

Cites work

• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 682387 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• Modular Multiplication Without Trial Division

Cited in

(3)

• Arithmetic division in RNS using Galois field GF(p)
• scientific article; zbMATH DE number 139976 (Why is no real title available?)
• scientific article; zbMATH DE number 1866869 (Why is no real title available?)

Describes a project that uses

Uses Software

• Xilinx

This page was built for publication: Hardware implementation of finite-field division

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