Stories
Slash Boxes
Comments

SoylentNews is people

posted by martyb on Wednesday September 11 2019, @05:54AM   Printer-friendly
from the renaming-it-to-be-NSHA:-the-Not-Secure-Hashing-Algorithm dept.

Arthur T Knackerbracket has found the following story:

The Wall Street fintech Treadwell Stanton DuPont broke silence today as it announced its Research & Development and Science Teams successfully broke the SHA-256[*] hashing algorithm silently in controlled laboratory conditions over a year ago. The announcement aims to secure financial and technological platform superiority to its clients and investors worldwide.

[...] While the best public cryptanalysis has tried to break the hashing function since its inception in 2001, work on searching, developing and testing practical collision and pre-image vulnerabilities on the SHA-256 hashing algorithm began back in 2016 in Treadwell Stanton DuPont's R&D facilities, culminating 2 years later with the successful discovery of a structural weakness and the initial development of the first practical solution space of real world value by its researchers.

"While we have successfully broken all 64 rounds of pre-image resistance," said Seiijiro Takamoto, Treadwell Stanton DuPont's director of newly formed Hardware Engineering Division, "it is not our intention to bring down Bitcoin, break SSL/TLS security or crack any financial sector security whatsoever."

[*] See the SHA-2 page on Wikipedia for background on SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, and SHA-512/256.


Original Submission

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 1, Insightful) by Anonymous Coward on Wednesday September 11 2019, @11:52AM (1 child)

    by Anonymous Coward on Wednesday September 11 2019, @11:52AM (#892630)

    Having 2 or more individual hashes, from different ciphers or techniques should not interact in the way you describe. This does mean that tiy either need multiple passes over the data or a specially optimized set of functions that can iterate the data through multiple ciphers side by side, allowing the performance benefit of the current data still being in-memory for each hashing function's pass. Given modern cpu technology the cpu time is negligible but the disk i/o wasted could be dramatic.

    Starting Score:    0  points
    Moderation   +1  
       Insightful=1, Total=1
    Extra 'Insightful' Modifier   0  

    Total Score:   1  
  • (Score: 0) by Anonymous Coward on Wednesday September 11 2019, @06:51PM

    by Anonymous Coward on Wednesday September 11 2019, @06:51PM (#892859)

    If you are talking about something like H1(H2(password)), H1(password)||H2(password), H1(password) xor H2(password), etc. then they absolutely do interact that way. There are numerous papers that prove that, which I can find when off work, if you'd like.