RELIABLE FRAMEWORK FOR ERROR-DETECTION POLICY USING HASH CODINGS

Kalicheti Mounika, V. Ramesh

Abstract


Within this paper, to be able to provide reliable architectures with this formula, a competent concurrent error recognition plan for that selected SHA-3 formula, i.e., Keccak, is suggested. To the very best of our understanding, effective countermeasures for potential reliability issues within the hardware implementations of the formula haven't been given to date. The secure hash formula (SHA)-3 continues to be selected this year and will also be accustomed to provide security to the application which requires hashing, pseudo-random number generation, and integrity checking. This formula continues to be selected according to various benchmarks for example security, performance, and complexity. In proposing the mistake recognition approach, goal to possess acceptable complexity and gratification overheads while keeping high error coverage. In connection with this, we present a minimal-complexity recomposing with rotated operands-based plan that is a step-forward toward lowering the hardware overhead from the suggested error recognition approach. Through the use of the suggested high-performance concurrent error recognition plan, more reliable and powerful hardware implementations for that recently-standardized SHA-3 are recognized. Furthermore, we perform injection-based fault simulations and reveal that the mistake coverage of near to 100% comes. In addition, we've designed the suggested plan and thru ASIC analysis, it's proven that acceptable complexity and gratification overheads are arrived at.


Keywords


Application-Specific Integrated Circuit (ASIC); High Performance; Reliability; Secure Hash Algorithm (SHA)-3; Security;

References


E. Homsirikamol, M. Rogawski, and K. Gaj, “Throughput vs. area trade-offs in high-speed architectures of five round 3 SHA-3 candidates implemented using Xilinx and Altera FPGAs,” in Proc. Workshop Cryptograph. Hardw. Embedded Syst., 2011, pp. 491–506.

M. Mozaffari-Kermani and A. Reyhani-Masoleh, “Reliable hardware architectures for the third-round SHA-3 finalist Grøstl benchmarked on FPGA platform,” in Proc. Conf. Defect Fault Tolerance VLSI Syst., Oct. 2011, pp. 325–331.

M. Juliato, C. Gebotys, and R. Elbaz, “Efficient fault tolerant SHA-2 hash functions for space applications,” in Proc. IEEE Conf. Aerosp., 2009, pp. 1–16.

S. Bayat-Sarmadi and M. Hasan, “Concurrent error detection in finitefield arithmetic operations using pipelined and systolic architectures,” IEEE Trans. Comput., vol. 58, no. 11, pp. 1553–1567, Nov. 2009.

M. Mozaffari-Kermani and A. Reyhani-Masoleh, “Parity-based fault detection architecture of S-box for advanced encryption standard,” in Proc. IEEE Int. Symp. Defect Fault-Tolerance VLSI Syst., 2006, pp. 572–580.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.