My Account | Careers | Downloads | Blog

PROJECT TITLE :

Efficient implementation of bit-parallel fault tolerant polynomial basis multiplication and squaring over GF(2m) - 2016

ABSTRACT:

This study presents the design and implementation of an efficient structure for fault tolerant bit-parallel polynomial basis multiplication and squaring over GF(2m), based mostly on the same strategy of Roving methodology with a minimum overhead. The Roving technique is an economical method for the circuits in that several similar and independent structures exist. The architectures of the polynomial basis multiplication and squaring over binary finite fields have inherent regularity in their subsections of the structures. Thus, they are compatible to the applied version of Roving fault tolerant method. To generalise the proposed design, the multiplication and squaring operations are examined for various primitive polynomial, as well as general irreducible polynomials, irreducible pentanomials and irreducible trinomials. In the proposed style, the extracted common circuit has low hardware utilisation compared with that of the most circuit. The fault tolerant circuit is constructed by using three copies of the common circuit, a comparator and a voter circuit. The comparator and voter have parallel architectures with low critical path delays, which is a essential issue in any highly computational system. The look has been successfully verified and synthesised onVirtex-four XC4VLX20zero FPGA using Xilinx ISE 11. The results show an overall improvement in the speed and hardware usage compared with those of previous styles.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

Field Programmable Gate Arrays Galois Fields Logic Design Polynomials Fault Tolerant Computing Multiplying Circuits Parallel Architectures
PROJECT TITLE : TARA: An Efficient Random Access Mechanism for NB-IoT by Exploiting TA Value Difference in Collided Preambles ABSTRACT: The 3rd Generation Partnership Project (3GPP) has specified the narrowband Internet of Things
PROJECT TITLE : ESVSSE Enabling Efficient, Secure, Verifiable Searchable Symmetric Encryption ABSTRACT: It is believed that symmetric searchable encryption, also known as SSE, will solve the problem of privacy in data outsourcing
PROJECT TITLE : ESA-Stream: Efficient Self-Adaptive Online Data Stream Clustering ABSTRACT: A wide variety of big data applications generate an enormous amount of streaming data that is high-dimensional, real-time, and constantly
PROJECT TITLE : Efficient Shapelet Discovery for Time Series Classification ABSTRACT: Recently, it was discovered that time-series shapelets, which are discriminative subsequences, are effective for the classification of time
PROJECT TITLE : Efficient Identity-based Provable Multi-Copy Data Possession in Multi-Cloud Storage ABSTRACT: A significant number of clients currently store multiple copies of their data on a variety of cloud servers. This helps

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry