Home           Contact us           FAQs           
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
2009 (Vol. 1, Issue: 1)
Article Information:

Analysis of building blocks in SHA 256

A.Arul Lawernce selvakumar and Dr. R.S.Ratastogi
Corresponding Author:  Arul Lawrence selvakumar 

Key words:  Hash functions, collisions, optimization, mess age expans ion, , ,
Vol. 1 , (1): Page No: 10-15
Submitted Accepted Published

In this study, we analyse the role of some of the building blocks in SHA-256. We show that the disturbance correction strategy is applicable to the SHA-256 architecture and we prove that functions ∑, σ are vital for the security of SHA-256 by showing that for a variant without them it is possible to Wnd collisions with complexity 264 hash operations. As a step towards an analysis of the full function, we present the results of our experiments on Hamming weights of expanded messages for different variants of the message expansion and show that there exist low-weight expanded messages for XOR-linearised variants.
Abstract PDF HTML
  Cite this Reference:
A.Arul Lawernce selvakumar and Dr. R.S.Ratastogi, 2009. Analysis of building blocks in SHA 256.  Research Journal of Applied Sciences, Engineering and Technology, 1(1): Page No: 10-15.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved