شماره ركورد كنفرانس :
766
عنوان مقاله :
Fast and Pipelined Bit-Parallel Montgomery Multiplication and Squaring over GF(2m)
عنوان به زبان ديگر :
Fast and Pipelined Bit-Parallel Montgomery Multiplication and Squaring over GF(2m)
پديدآورندگان :
Rashidi Bahram نويسنده Iran - Isfahan - Isfahan University of Technology - Dept. of Elec. & Comp. Eng., , Sayedi Masoud نويسنده ran - Isfahan - Isfahan University of Technology - Dept. of Elec. & Comp. Eng , Rezaeian Farashahi Reza نويسنده Iran - Isfahan - Isfahan University of Technology, - Dept. of Mathematics
كليدواژه :
Montgomery multiplier , Pipelining , elliptic curve cryptography , Trinomials
عنوان كنفرانس :
12 دهمين كنفرانس بين المللي انجمن رمز ايران
چكيده لاتين :
This paper presents an efficient implementation of
a fast and pipelined Bit-parallel Montgomery multiplier and
squaring over GF(2m) generated by irreducible trinomials. The
architecture of the multiplier is based on a parallel and
independent computation of multiplication by negative powers of
x as polynomial variable in multiplication and squaring. The
structure has a regular and low complex architecture with a low
critical path. The critical path delay is decreased by using a 2-
stage pipelining technique. The proposed method over the binary
extension field GF(2233) has been successfully verified and
synthesized using Xilinx ISE 11 by Virtex-4, XC4VLX100 FPGA.
Maximum operation frequency of multiplier is 281.3 MHz..
شماره مدرك كنفرانس :
4490565
