A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Bit-serial and digit-serial GF(2m) Montgomery multipliers using linear feedback shift registers
2011
IET Computers & Digital Techniques
This work presents novel multipliers for Montgomery multiplication defined on binary fields GF(2 m ). Different to state of the art Montgomery multipliers, this work uses a Linear Feedback Shift Register (LFSR) as the main building block. We studied different architectures for bit-serial and digit-serial Montgomery multipliers using the LFSR and the Montgomery factors x m and x m−1 . The proposed multipliers are for different classes of irreducible polynomials: general, all one polynomials
doi:10.1049/iet-cdt.2010.0021
fatcat:tpkee25zubdj7le7nm7zpdgy3u