<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=SHA-256d</id>
	<title>SHA-256d - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=SHA-256d"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=SHA-256d&amp;action=history"/>
	<updated>2026-05-15T09:39:21Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=SHA-256d&amp;diff=6664&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;{{#seo: |title= SHA-256d Algorithm – Encryption – zaoniaoWiki |keywords=sha-256d, sha, 256d, algorithm, cryptography |description=SHA-256d is the hash function forming the...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=SHA-256d&amp;diff=6664&amp;oldid=prev"/>
		<updated>2019-07-06T13:09:32Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;{{#seo: |title= SHA-256d Algorithm – Encryption – zaoniaoWiki |keywords=sha-256d, sha, 256d, algorithm, cryptography |description=SHA-256d is the hash function forming the...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{#seo:&lt;br /&gt;
|title= SHA-256d Algorithm – Encryption – zaoniaoWiki&lt;br /&gt;
|keywords=sha-256d, sha, 256d, algorithm, cryptography&lt;br /&gt;
|description=SHA-256d is the hash function forming the core of Bitcoin. SHA-256d(x) = SHA-256(SHA-256(x))&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
'''SHA-256d''' is the hash function forming the core of Bitcoin.&lt;br /&gt;
==About==&lt;br /&gt;
'''SHA-256d''' was proposed in one of the Ferguson/Schneier books like so:&lt;br /&gt;
&lt;br /&gt;
'''SHA-256d(x) = SHA-256(SHA-256(x))'''&lt;br /&gt;
&lt;br /&gt;
The motivation for this construction is to avoid length extension attacks.&lt;br /&gt;
&lt;br /&gt;
==Example==&lt;br /&gt;
'''An example''' is this protocol designed to provide mutual proof that each party has made some minimum number of evaluations of some 256-bit hash function H (note: Alice performs the odd steps, and the next even step is performed by Bob with roles reversed):&lt;br /&gt;
[[File:SHA-256d_1.png|600px|center|SHA-256d description]]&lt;br /&gt;
When H is SHA-256, this protocol is safe for both Alice and Bob. However if H is SHA-256d, defined as x↦SHA-256(SHA-256(x)), there is a simple &amp;quot;mirror&amp;quot; attack for Bob:&lt;br /&gt;
[[File:SHA-256d_2.png|600px|center|SHA-256d  description]]&lt;br /&gt;
&lt;br /&gt;
This strategy allows Bob to apparently perform his duties with computational effort about a single evaluation of SHA-256d, by circumventing the tests performed by Alice at step 5., which intend was to prevent Bob from choosing B0 as one of the Aj so that most of his work could in fact be done by Alice.&lt;br /&gt;
==See also==&lt;br /&gt;
* [[SHA-512]]&lt;br /&gt;
* [[SHA-3]]&lt;br /&gt;
* [[SHA-255]]&lt;br /&gt;
* [[SHA-1]]&lt;br /&gt;
* [[SHA-2]]&lt;br /&gt;
&lt;br /&gt;
==Refernces==&lt;br /&gt;
[https://crypto.stackexchange.com/questions/7895/weaknesses-in-sha-256d Weaknesses in SHA-256d]&lt;br /&gt;
[[de: SHA-256d]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>