<?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=Streebog</id>
	<title>Streebog - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Streebog"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Streebog&amp;action=history"/>
	<updated>2026-05-15T12:02:19Z</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=Streebog&amp;diff=7011&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;'''Streebog''' is a family of two hash functions, Streebog-256 and Streebog-512, that produce output 256-bit or 512-bit hash respectively from a bit string of arbitrary size u...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Streebog&amp;diff=7011&amp;oldid=prev"/>
		<updated>2019-07-21T04:08:24Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Streebog&amp;#039;&amp;#039;&amp;#039; is a family of two hash functions, Streebog-256 and Streebog-512, that produce output 256-bit or 512-bit hash respectively from a bit string of arbitrary size u...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Streebog''' is a family of two hash functions, Streebog-256 and Streebog-512, that produce output 256-bit or 512-bit hash respectively from a bit string of arbitrary size using the [[Merkle–Damgård construction]]. The high-level structure of the new hash function resembles the one from GOST R 34.11-94, however, the compression function was changed significantly. The compression function operates in [[Miyaguchi–Preneel]] mode and employs a 12-round [[Advanced Encryption Standard|AES]]-like cipher.&lt;br /&gt;
&lt;br /&gt;
The function was named '''Streebog''' after [[Stribog]], the god of rash wind in ancient Slavic mythology,&lt;br /&gt;
&lt;br /&gt;
==Examples of Streebog hashes==&lt;br /&gt;
Hash values of empty string.&lt;br /&gt;
 &amp;lt;span style=&amp;quot;color: green;&amp;quot;&amp;gt;Streebog-256(&amp;quot;&amp;quot;)&amp;lt;/span&amp;gt;&lt;br /&gt;
 0x 3f539a213e97c802cc229d474c6aa32a825a360b2a933a949fd925208d9ce1bb&lt;br /&gt;
 &amp;lt;span style=&amp;quot;color: green;&amp;quot;&amp;gt;Streebog-512(&amp;quot;&amp;quot;)&amp;lt;/span&amp;gt;&lt;br /&gt;
 0x 8e945da209aa869f0455928529bcae4679e9873ab707b55315f56ceb98bef0a7 \&lt;br /&gt;
 362f715528356ee83cda5f2aac4c6ad2ba3a715c1bcd81cb8e9f90bf4c1c1a8a&lt;br /&gt;
&lt;br /&gt;
Even a small change in the message will (with overwhelming probability) result in a mostly different hash, due to the [[avalanche effect]]. For example, adding a period to the end of the sentence:&lt;br /&gt;
 &amp;lt;span style=&amp;quot;color: green;&amp;quot;&amp;gt;Streebog-256(&amp;quot;[[The quick brown fox jumps over the lazy dog]]&amp;quot;)&amp;lt;/span&amp;gt;&lt;br /&gt;
 0x 3e7dea7f2384b6c5a3d0e24aaa29c05e89ddd762145030ec22c71a6db8b2c1f4&lt;br /&gt;
 &amp;lt;span style=&amp;quot;color: green;&amp;quot;&amp;gt;Streebog-256(&amp;quot;[[The quick brown fox jumps over the lazy dog]].&amp;quot;)&amp;lt;/span&amp;gt;&lt;br /&gt;
 0x 36816a824dcbe7d6171aa58500741f2ea2757ae2e1784ab72c5c3c6c198d71da&lt;br /&gt;
 &amp;lt;span style=&amp;quot;color: green;&amp;quot;&amp;gt;Streebog-512(&amp;quot;[[The quick brown fox jumps over the lazy dog]]&amp;quot;)&amp;lt;/span&amp;gt;&lt;br /&gt;
 0x d2b793a0bb6cb5904828b5b6dcfb443bb8f33efc06ad09368878ae4cdc8245b9 \&lt;br /&gt;
 7e60802469bed1e7c21a64ff0b179a6a1e0bb74d92965450a0adab69162c00fe&lt;br /&gt;
 &amp;lt;span style=&amp;quot;color: green;&amp;quot;&amp;gt;Streebog-512(&amp;quot;[[The quick brown fox jumps over the lazy dog]].&amp;quot;)&amp;lt;/span&amp;gt;&lt;br /&gt;
 0x fe0c42f267d921f940faa72bd9fcf84f9f1bd7e9d055e9816e4c2ace1ec83be8 \&lt;br /&gt;
 2d2957cd59b86e123d8f5adee80b3ca08a017599a9fc1a14d940cf87c77df070&lt;br /&gt;
&lt;br /&gt;
==Cryptanalysis==&lt;br /&gt;
In 2013 the Russian Technical Committee for Standardization &amp;quot;Cryptography and Security Mechanisms&amp;quot; (TC 26) with the participation of Academy of Cryptography of the Russian Federation declared an open competition for cryptanalysis of Streebog hash function, which attracted the international attention to the function.&lt;br /&gt;
&lt;br /&gt;
Ma, ''et al'', describe a [[preimage attack]] that takes 2&amp;lt;sup&amp;gt;496&amp;lt;/sup&amp;gt; time and 2&amp;lt;sup&amp;gt;64&amp;lt;/sup&amp;gt; memory or 2&amp;lt;sup&amp;gt;504&amp;lt;/sup&amp;gt; time and 2&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; memory to find a single preimage of GOST-512 reduced to 6 rounds. They also describe a [[collision attack]] with 2&amp;lt;sup&amp;gt;181&amp;lt;/sup&amp;gt; [[time complexity]] and 2&amp;lt;sup&amp;gt;64&amp;lt;/sup&amp;gt; memory requirement in the same paper.&lt;br /&gt;
&lt;br /&gt;
Guo, ''et al'', describe a [[second preimage attack]] on full Streebog-512 with total time complexity equivalent to 2&amp;lt;sup&amp;gt;266&amp;lt;/sup&amp;gt; compression function evaluations, if the message has more than 2&amp;lt;sup&amp;gt;259&amp;lt;/sup&amp;gt; blocks.&lt;br /&gt;
&lt;br /&gt;
AlTawy and Youssef published an attack to a modified version of Streebog with different round constants. While this attack may not have a direct impact on the security of the original Streebog hash function, it raised a question about the origin of the used parameters in the function. The designers published a paper explaining that these are pseudorandom constants generated with Streebog-like hash function, provided with 12 different natural language input messages.&lt;br /&gt;
&lt;br /&gt;
AlTawy, ''et al'', found 5-round free-start collision and a 7.75 free-start near collision for the internal cipher with complexities 2&amp;lt;sup&amp;gt;8&amp;lt;/sup&amp;gt; and 2&amp;lt;sup&amp;gt;40&amp;lt;/sup&amp;gt;, respectively, as well as attacks on the compression function with 7.75 round semi free-start collision with time complexity 2&amp;lt;sup&amp;gt;184&amp;lt;/sup&amp;gt; and memory complexity 2&amp;lt;sup&amp;gt;8&amp;lt;/sup&amp;gt;, 8.75 and 9.75 round semi free-start near collisions with time complexities 2&amp;lt;sup&amp;gt;120&amp;lt;/sup&amp;gt; and 2&amp;lt;sup&amp;gt;196&amp;lt;/sup&amp;gt;, respectively.&lt;br /&gt;
&lt;br /&gt;
Wang, ''et al'', describe a collision attack on the compression function reduced to 9.5 rounds with 2&amp;lt;sup&amp;gt;176&amp;lt;/sup&amp;gt; time complexity and 2&amp;lt;sup&amp;gt;128&amp;lt;/sup&amp;gt; memory complexity.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Hash function security summary]]&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptography]]&lt;br /&gt;
[[Category:Cryptographic algorithms]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>