مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

275
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

187
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

EFFICIENT IMPLEMENTATION OF LOW TIME COMPLEXITY AND PIPELINED BIT-PARALLEL POLYNOMIAL BASIS MULTIPLIER OVER BINARY FINITE FIELDS

Pages

  0-0

Abstract

 This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible PENTANOMIALS and TRINOMIALS. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. The second structure only even powers of the polynomial variable are used. The parallel computation provides regular and low-cost structure with low critical path delay. In addition, the PIPELINING technique is applied to the proposed structures to shorten the critical path and to perform the computation in two clock cycles. The implementations of the proposed methods over the binary extension fields GF (2163) and GF (2233) have been successfully verified and synthesized using Xilinx ISE 11 by Virtex-4, XC4VLX200 FPGA.

Multimedia

  • No record.
  • Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    RASHIDI, BAHRAM, REZAEIAN FARASHAHI, REZA, & SAYEDI, SAYED MASOUD. (2015). EFFICIENT IMPLEMENTATION OF LOW TIME COMPLEXITY AND PIPELINED BIT-PARALLEL POLYNOMIAL BASIS MULTIPLIER OVER BINARY FINITE FIELDS. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 7(2 ), 0-0. SID. https://sid.ir/paper/673874/en

    Vancouver: Copy

    RASHIDI BAHRAM, REZAEIAN FARASHAHI REZA, SAYEDI SAYED MASOUD. EFFICIENT IMPLEMENTATION OF LOW TIME COMPLEXITY AND PIPELINED BIT-PARALLEL POLYNOMIAL BASIS MULTIPLIER OVER BINARY FINITE FIELDS. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY[Internet]. 2015;7(2 ):0-0. Available from: https://sid.ir/paper/673874/en

    IEEE: Copy

    BAHRAM RASHIDI, REZA REZAEIAN FARASHAHI, and SAYED MASOUD SAYEDI, “EFFICIENT IMPLEMENTATION OF LOW TIME COMPLEXITY AND PIPELINED BIT-PARALLEL POLYNOMIAL BASIS MULTIPLIER OVER BINARY FINITE FIELDS,” THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 7, no. 2 , pp. 0–0, 2015, [Online]. Available: https://sid.ir/paper/673874/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button