According to the news three years ago, MD5 and SHA1 seem no longer
sufficiently safe.
News link: http://www.eetimes.com/showArticle.jhtml?articleID=60402150

NIST also encourages people and organizations to make an transition on
its hash algorithm from SHA-1 or MD5 to more advanced ones, such as
SHA256, SHA384, SHA512.

So, I have a question that according to current technology, is SHA256
sufficiently safe as the hash algorithm and is it supposed to be safe
enough in the coming 5 years, if no new crypto attack method about
hash algorithm is invented only with the computation ability
increasing under Moore's Law.

Thank you for your reply :)

According to the news three years ago, MD5 and SHA1 seem no longer
sufficiently safe.
News link: http://www.eetimes.com/showArticle.jhtml?articleID=60402150

NIST also encourages people and organizations to make an transition on
its hash algorithm from SHA-1 or MD5 to more

advanced ones, such as SHA256, SHA384, SHA512.

So, I have a question that according to current technology, is SHA256
sufficiently safe as the hash algorithm and is

it supposed to be safe enough in the coming 5 years, if no new crypto
attack method about hash algorithm is invented

only with the computation ability increasing under Moore's Law.

Thank you for your reply :)

l on the internet appears the issue concering Skype.

As encryption goes a donut algorithm would likely attack. Donuts take
the first alphabet and then allow all asci to appear as the signal
code.

A codec transform binary to signal.

Allow the first clear signal to be the decrypted signal. A basic
decoding was not the only method as a technique to attacking all
encrypted analog signals. Take the first set. And shuffle as a long
signal. Assume a binary represents a certain signal strength. And
assume a message block size, or signal duration.

Shuffle. As the next block appears overlay as single words. And
shuffle again the first message block in its entirty. So a signal in
encrypted form will randomly appear. A quite arbitrary signal in
simulation only of the true signal.

Alphabet as signal strength then occurs. A decryption then demands a
complete hard crack of this first message block. Shuffle the block as
a hard crack occurs.