[U-Boot-Users] SHA1 Hash calculation

[U-Boot-Users] SHA1 Hash calculation

[Tom Saarnio]

>> 
>> I am wondering whether it would be worth to implement a SHA1 
hash 
>> calculation over given memory address range. In this way one 
could 
>> assure for example that the binary image version is correct 
or that 
>> binary image is intact.
>
>Is the existing CRC32 checksum 
not good enough for your purposes?

The CRC32 is not collision-proof in 
similar fashion that SHA1. In real life, if two binary images give the 
same SHA1 checksum, you can say that these binaries are identical. With 
CRC32 this is not so - or at least I would not count on that :-)

br,

Tom

[U-Boot-Users] SHA1 Hash calculation

[Wolfgang Denk]

In message <31192263.1132734126001.JavaMail.root@eni-cpps05.sth.basefarm.net> you wrote:
>
> The CRC32 is not collision-proof in 
> similar fashion that SHA1. In real life, if two binary images give the 
> same SHA1 checksum, you can say that these binaries are identical. With 
> CRC32 this is not so - or at least I would not count on that :-)

Well, normally you have additional information like the U-Boot  image
header, version id, etc.

But feel free to implement sha1 support - if  it  can  be  configured
cleanly away then it's fine...

Best regards,

Wolfgang Denk

-- 
Software Engineering:  Embedded and Realtime Systems,  Embedded Linux
Phone: (+49)-8142-66989-10 Fax: (+49)-8142-66989-80 Email: wd at denx.de
"Wagner's music is better than it sounds."               - Mark Twain

[U-Boot-Users] SHA1 Hash calculation

[Tom Saarnio]

Hi!

I am wondering whether it would be worth to implement a SHA1 hash 
calculation over given memory address range. In this way one could 
assure for example that the binary image version is correct or that 
binary image is intact.

For those who are not familiar waith SHA1 (or 
other hash algorithms), the SHA1 algorithm computes a 160 bit 
"fingerprint" of given byte stream. The algorithm is designed so that 
collisions between any given byte stream is "unlikely" as it is very 
unlikely that two persons have identical fingerprints or dna.

Wikipedia:
http://en.wikipedia.org/wiki/SHA-1

Source code:
http://www.
cr0.net:8040/code/crypto/sha1/

Any comments?

br,

Tom

[U-Boot-Users] SHA1 Hash calculation

[Wolfgang Denk]

In message <19732218.1132731152180.JavaMail.root@eni-cpps05.sth.basefarm.net> you wrote:
> 
> I am wondering whether it would be worth to implement a SHA1 hash 
> calculation over given memory address range. In this way one could 
> assure for example that the binary image version is correct or that 
> binary image is intact.

Is the existing CRC32 checksum not good enough for your purposes?

> Any comments?

Use the existing CRC command instead.

Best regards,

Wolfgang Denk

-- 
Software Engineering:  Embedded and Realtime Systems,  Embedded Linux
Phone: (+49)-8142-66989-10 Fax: (+49)-8142-66989-80 Email: wd at denx.de
Anyone who knows history, particularly the history of Europe, will, I
think, recognize that the domination of education or of government by
any one particular religious faith is never a happy  arrangement  for
the people.                                       - Eleanor Roosevelt