The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper aims to present cube neutral bit tester on EPCBC. Cube neutral bit tester is a generic class of methods for building distinguishers, which find function approximating F(K, V) that depend on less than all key bits. We demonstrate how to use an efficient FPGA implementation cube neutral bit tester on the block cipher EPCBC. Different from the previous kinds of attack, the primary purpose...
This paper presents the implementation of curve on FPGA circuit (Field Programmable Gate Array) Spartan 3 of Xilinx, it based on Taylor approximation by segment, used third order polynomial in order to reduce the maximum error. First of all, we have stocked all coefficients, computing with Mat lab tool, in the block memory. After that, an architecture is proposed and implemented under ISE9.2i environment...
AES-GCM(Advanced Encryption Standard with Galois Counter Mode) is an encryption authentication algorithm, which includes two main components: an AES engine and Ghash module. Because of the computation feedback in Ghash operation, the Ghash module limits the performance of the whole AES-GCM system. In this study, an efficient architecture of Ghash is presented. The architecture uses an optimized bit-parallel...
Additional coding gain of about 0.6 dB is observed for binary BCH codes compared to RS codes with similar code rate and codeword length under AWGN channel. This paper presents a new CRT-based (Chinese Remainder Theorem) BCH encoding. CRT-based encoding method has higher speed than original LFSR encoding method. An encoding scheme is proposed which makes trade-off between resource usage and speed possible...
Our paper presents the prototyping of a BCH (Bose, Chaudhuri, and Hocquenghem) encoder and decoder using a Field Programmable Gate Array (FPGA) reconfigurable chip. The solutions implemented on FPGA lead to a high calculation rate using parallelization. We implemented the BCH code in a 3s400FG456 FPGA. In this implementation we used 15 bits-size word code and the results show that the circuits work...
In this paper, we propose a high-speed parallel GF(2128) bit multiplier for Ghash function in conjunction with its FPGA implementation. Through the use of Verilog the designs are evaluated by using Xilinx Vertax5 with 65 nm technic and 30,000 logic cells. The highest throughput of 30.764 Gpbs can be achieved on Virtex5 with the consumption of 8864 slices LUT. The proposed design of the multiplier...
This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of which is a modular multiplication unit implemented using the systolic montgomery multiplication algorithm. Another novelty of our proposed architecture is that it implements the field GF(3m), which provides significant performance...
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the evaluation of the bilinear pairings over elliptic curves, known to be prohibitively expensive, efficient implementations are required to render them applicable in real life scenarios. We present an efficient accelerator for...
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the NFG's memory size. However, larger k requires more logic elements and multipliers. To quantify this tradeoff, we introduce the FPGA utilization measure, and then determine the optimum polynomial order k. Experimental results...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.