Attacking Reduced Round SHA-256 (Q3506406)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Attacking Reduced Round SHA-256	scientific article

Statements

scholarly article

0 references

Attacking Reduced Round SHA-256 (English)

0 references

Somitra Kumar Sanadhya

0 references

0 references

Applied Cryptography and Network Security

0 references

publication date

13 June 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-68914-0_8

0 references

Advances in Cryptology – CRYPTO 2004

0 references

A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

0 references

0 references

Advances in cryptology -- EUROCRYPT 2005. 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22--26, 2005. Proceedings

0 references

Selected Areas in Cryptography

0 references

A probabilistic algorithm for computing minimum weights of large error-correcting codes

0 references

Analysis of Step-Reduced SHA-256

0 references

Collisions for Step-Reduced SHA-256

0 references

Cryptography and Coding

0 references

Topics in Cryptology – CT-RSA 2005

0 references

Attacking Reduced Round SHA-256

0 references

0 references

Cryptanalysis of the Hash Functions MD4 and RIPEMD

0 references

Finding Collisions in the Full SHA-1

0 references

How to Break MD5 and Other Hash Functions

0 references

Analysis of a SHA-256 Variant

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-68914-0_8

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3506406

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3506406&oldid=35060599"