Paper 2007/476

Dynamic SHA

Xu Zijie

Abstract

In this paper I describe the construction of Dynamic SHA family of cryptographic hash functions. They are built with design components from the SHA-2 family, but there is function R in the new hash functionh. It enabled us to achieve a novel design principle: When message is changed, different rotate right operation maybe done. It make the system can resistant against all extant attacks.

Note: I found D-sha is weak, if it is constituted with three same and easy backward part. I had found it at 2007/08. I revise it now. It is luck that d-sha2 is not like this, it just not so good as it can without constants.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
hash functionSHADynamic SHA
Contact author(s)
xuzijiewz @ gmail com
History
2008-11-20: last of 13 revisions
2007-12-21: received
See all versions
Short URL
https://ia.cr/2007/476
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/476,
      author = {Xu Zijie},
      title = {Dynamic SHA},
      howpublished = {Cryptology ePrint Archive, Paper 2007/476},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/476}},
      url = {https://eprint.iacr.org/2007/476}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.