<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ko">
	<id>https://wiki.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=SHA-2</id>
	<title>SHA-2 - 편집 역사</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=SHA-2"/>
	<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=SHA-2&amp;action=history"/>
	<updated>2026-04-04T21:36:11Z</updated>
	<subtitle>이 문서의 편집 역사</subtitle>
	<generator>MediaWiki 1.35.0</generator>
	<entry>
		<id>https://wiki.mathnt.net/index.php?title=SHA-2&amp;diff=51342&amp;oldid=prev</id>
		<title>2021년 2월 17일 (수) 08:19에 Pythagoras0님의 편집</title>
		<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=SHA-2&amp;diff=51342&amp;oldid=prev"/>
		<updated>2021-02-17T08:19:31Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;ko&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← 이전 판&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;2021년 2월 17일 (수) 08:19 판&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l98&quot; &gt;98번째 줄:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;98번째 줄:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== 메타데이터 ==&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==메타데이터==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===위키데이터===&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===위키데이터===&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;* ID :  [https://www.wikidata.org/wiki/Q1968605 Q1968605]&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;* ID :  [https://www.wikidata.org/wiki/Q1968605 Q1968605]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;===Spacy 패턴 목록===&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LOWER&amp;#039;: &amp;#039;secure&amp;#039;}, {&amp;#039;LOWER&amp;#039;: &amp;#039;hash&amp;#039;}, {&amp;#039;LOWER&amp;#039;: &amp;#039;algorithm&amp;#039;}, {&amp;#039;LEMMA&amp;#039;: &amp;#039;2&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;sha-224&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;sha-256&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;sha-384&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;sha-512&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;SHA-2&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LEMMA&amp;#039;: &amp;#039;SHA2&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* [{&amp;#039;LOWER&amp;#039;: &amp;#039;sha&amp;#039;}, {&amp;#039;LEMMA&amp;#039;: &amp;#039;2&amp;#039;}]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Pythagoras0</name></author>
	</entry>
	<entry>
		<id>https://wiki.mathnt.net/index.php?title=SHA-2&amp;diff=47139&amp;oldid=prev</id>
		<title>Pythagoras0: /* 메타데이터 */ 새 문단</title>
		<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=SHA-2&amp;diff=47139&amp;oldid=prev"/>
		<updated>2020-12-26T12:23:26Z</updated>

		<summary type="html">&lt;p&gt;&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;메타데이터: &lt;/span&gt; 새 문단&lt;/span&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;ko&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← 이전 판&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;2020년 12월 26일 (토) 12:23 판&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l97&quot; &gt;97번째 줄:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;97번째 줄:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===소스===&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;===소스===&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;  &amp;lt;references /&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;== 메타데이터 ==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;===위키데이터===&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* ID :  [https://www.wikidata.org/wiki/Q1968605 Q1968605]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Pythagoras0</name></author>
	</entry>
	<entry>
		<id>https://wiki.mathnt.net/index.php?title=SHA-2&amp;diff=46178&amp;oldid=prev</id>
		<title>Pythagoras0: /* 노트 */ 새 문단</title>
		<link rel="alternate" type="text/html" href="https://wiki.mathnt.net/index.php?title=SHA-2&amp;diff=46178&amp;oldid=prev"/>
		<updated>2020-12-21T08:59:27Z</updated>

		<summary type="html">&lt;p&gt;&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;노트: &lt;/span&gt; 새 문단&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;새 문서&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== 노트 ==&lt;br /&gt;
&lt;br /&gt;
===위키데이터===&lt;br /&gt;
* ID :  [https://www.wikidata.org/wiki/Q1968605 Q1968605]&lt;br /&gt;
===말뭉치===&lt;br /&gt;
# and SHA-512/t (including SHA-512/224 and SHA-512/256).&amp;lt;ref name=&amp;quot;ref_a7484740&amp;quot;&amp;gt;[https://developer.aliyun.com/mirror/npm/package/sha2 Package]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# For SHA-512/t (t must satisfy 1 ≤ t ≤ 511 and t ≠ 384.&amp;lt;ref name=&amp;quot;ref_a7484740&amp;quot; /&amp;gt;&lt;br /&gt;
# Making a hash of a password with one of the algorithms of the SHA-2 family and keeping it, is not recommended.&amp;lt;ref name=&amp;quot;ref_a7484740&amp;quot; /&amp;gt;&lt;br /&gt;
# The 256 in SHA-256 represents the bit size of the hash output or digest when the hash function is performed.&amp;lt;ref name=&amp;quot;ref_6e2b7c95&amp;quot;&amp;gt;[https://www.posdigicert.com.my/support/faq-kb Pos Digicert Sdn Bhd]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# Not all software supports every digest size within the SHA-2 family.&amp;lt;ref name=&amp;quot;ref_6e2b7c95&amp;quot; /&amp;gt;&lt;br /&gt;
# Most browsers, platforms, mail clients, and mobile devices already support SHA-2.&amp;lt;ref name=&amp;quot;ref_6e2b7c95&amp;quot; /&amp;gt;&lt;br /&gt;
# However, some older operating systems such as Windows XP pre-SP3 do not support SHA-2 encryption.&amp;lt;ref name=&amp;quot;ref_6e2b7c95&amp;quot; /&amp;gt;&lt;br /&gt;
# The second version of SHA, called SHA-2, has many variants.&amp;lt;ref name=&amp;quot;ref_d291847c&amp;quot;&amp;gt;[https://www.freecodecamp.org/news/md5-vs-sha-1-vs-sha-2-which-is-the-most-secure-encryption-hash-and-how-to-check-them/ MD5 vs SHA-1 vs SHA-2 - Which is the Most Secure Encryption Hash and How to Check Them]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# The SHA-256 algorithm returns hash value of 256-bits, or 64 hexadecimal digits.&amp;lt;ref name=&amp;quot;ref_d291847c&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-2 provides better prevention against collision, meaning the same input data always has a different hash value.&amp;lt;ref name=&amp;quot;ref_a5cb4aa5&amp;quot;&amp;gt;[https://www.punitkthanki.co/2020/11/secure-hash-algorithm-2-sha-2.html Secure Hash Algorithm 2 (SHA-2)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# Because of weaknesses in the SHA-1 algorithm and to align to industry standards, we have changed the signing of Windows updates to use the more secure SHA-2 algorithm exclusively.&amp;lt;ref name=&amp;quot;ref_a5cb4aa5&amp;quot; /&amp;gt;&lt;br /&gt;
# Any devices without SHA-2 support will not be able to install Windows updates on or after July 2019.&amp;lt;ref name=&amp;quot;ref_a5cb4aa5&amp;quot; /&amp;gt;&lt;br /&gt;
# To help prepare you for this change, we released support for SHA-2 signing in starting March 2019 and have made incremental improvements.&amp;lt;ref name=&amp;quot;ref_a5cb4aa5&amp;quot; /&amp;gt;&lt;br /&gt;
# (National Institure of Standards and Technology), of which SHA-2 and SHA-3 algorithm families are considered secure and are used in numerous applications today.&amp;lt;ref name=&amp;quot;ref_0c84c77a&amp;quot;&amp;gt;[https://xiphera.com/cryptographic-hash-functions.php Peace of mind in a dangerous world.]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# Its days are numbered and the SSL industry is migrating to SHA-2.&amp;lt;ref name=&amp;quot;ref_7405334e&amp;quot;&amp;gt;[https://www.ssl247.com/kb/ssl-certificates/generalinformation/what-is-sha1-sha2 What is SHA-1 / SHA-2 ?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# The most common hash function used is SHA-256.&amp;lt;ref name=&amp;quot;ref_7405334e&amp;quot; /&amp;gt;&lt;br /&gt;
# The hard work required to transition from SHA-1 to SHA-2 has already been taken care of.&amp;lt;ref name=&amp;quot;ref_7405334e&amp;quot; /&amp;gt;&lt;br /&gt;
# In any case, your SSL certificate must use SHA-2 from January 1st, 2017, and all Certification Authorities are currently ensuring you can purchase SHA-2 certificates from now on.&amp;lt;ref name=&amp;quot;ref_7405334e&amp;quot; /&amp;gt;&lt;br /&gt;
# “The variety of SHA-2 hashes can lead to a bit of confusion, as websites and authors express them differently.&amp;lt;ref name=&amp;quot;ref_c52f3e28&amp;quot;&amp;gt;[https://www.rapidsslonline.com/blog/sha1-vs-sha2-vs-sha256-whats-the-difference/ SHA1 vs SHA2 vs SHA256 – What’s the difference?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# If you see “SHA-2,” “SHA-256” or “SHA-256 bit,” those names are referring to the same thing.&amp;lt;ref name=&amp;quot;ref_c52f3e28&amp;quot; /&amp;gt;&lt;br /&gt;
# those are referring to the alternate bit-lengths of SHA-2.&amp;lt;ref name=&amp;quot;ref_c52f3e28&amp;quot; /&amp;gt;&lt;br /&gt;
# All end user SSL/TLS certificates must use SHA2, but owing to their ubiquity and age, intermediates may still use SHA1 in some cases.&amp;lt;ref name=&amp;quot;ref_c52f3e28&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-256 sets additional constants that define the behavior of the SHA-2 algorithm.&amp;lt;ref name=&amp;quot;ref_f6c19323&amp;quot;&amp;gt;[https://raevskymichail.medium.com/how-the-sha-2-sha-256-hashing-algorithm-works-17d0ff72dbfc How the SHA-2 (SHA-256) Hashing Algorithm Works]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# (Secure Hash Algorithm 2), of which SHA-256 is a part, is one of the most popular hashing algorithms out there.&amp;lt;ref name=&amp;quot;ref_3b1f042c&amp;quot;&amp;gt;[https://qvault.io/2020/07/08/how-sha-2-works-step-by-step-sha-256/ How SHA-2 Works Step-By-Step (SHA-256)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-2 is known for its security (it hasn’t broken down like SHA-1), and its speed.&amp;lt;ref name=&amp;quot;ref_3b1f042c&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-2 is a very famous and strong family of hash functions, as as you would expect, it fulfills all of the above purposes.&amp;lt;ref name=&amp;quot;ref_3b1f042c&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-256 sets additional constants that define the SHA-2 algorithm’s behavior.&amp;lt;ref name=&amp;quot;ref_3b1f042c&amp;quot; /&amp;gt;&lt;br /&gt;
# After the unfortunate incident with the SHA-1 algorithm in 2015, the industry started moving away from SHA-1 and mostly shifted to SHA-2.&amp;lt;ref name=&amp;quot;ref_23d15d55&amp;quot;&amp;gt;[https://www.ssl2buy.com/wiki/difference-between-sha1-sha2-sha256-hash-algorithms The Difference Between SHA-1, SHA-2 and SHA-256 Hash Algorithms]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA 2, known as Secure Hashing Algorithm – 2, is also a mathematical cryptographic hash function.&amp;lt;ref name=&amp;quot;ref_23d15d55&amp;quot; /&amp;gt;&lt;br /&gt;
# The SHA2 hash is extensively used for encryption-decryption in security protocols and programs like SSL, TLS, S/MIME, and many more.&amp;lt;ref name=&amp;quot;ref_23d15d55&amp;quot; /&amp;gt;&lt;br /&gt;
# Secure hashing algorithm – 256, commonly known as SHA256, is a member of the SHA-2 algorithm family, as discussed above.&amp;lt;ref name=&amp;quot;ref_23d15d55&amp;quot; /&amp;gt;&lt;br /&gt;
# For example: use sha256() to create a SHA-256 hash object.&amp;lt;ref name=&amp;quot;ref_1482ddaa&amp;quot;&amp;gt;[https://docs.python.org/3/library/hashlib.html hashlib — Secure hashes and message digests — Python 3.9.1 documentation]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-2 is part of the so-called &amp;quot;cryptographic hash algorithms&amp;quot; that can generate.&amp;lt;ref name=&amp;quot;ref_c72ec005&amp;quot;&amp;gt;[https://joinup.ec.europa.eu/collection/dutch-standardisation-forum-comply-or-explain-standards/solution/secure-hash-algorithm-2 Secure Hash Algorithm 2]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# They differ in the word size; SHA-256 uses 32-byte words where SHA-512 uses 64-byte words.&amp;lt;ref name=&amp;quot;ref_eb68f99e&amp;quot;&amp;gt;[https://en.wikipedia.org/wiki/Secure_Hash_Algorithms Secure Hash Algorithms]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# There are also truncated versions of each standard, known as SHA-224 , SHA-384 , SHA-512/224 and SHA-512/256 .&amp;lt;ref name=&amp;quot;ref_eb68f99e&amp;quot; /&amp;gt;&lt;br /&gt;
# customers prepare for and move to SHA-2, the set of cryptographic hash functions that have succeeded SHA-1.&amp;lt;ref name=&amp;quot;ref_d0b4eb33&amp;quot;&amp;gt;[https://www.csoonline.com/article/2879073/all-you-need-to-know-about-the-move-from-sha1-to-sha2-encryption.html All you need to know about the move from SHA-1 to SHA-2 encryption]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# Last year, moving to SHA-2 ahead of the global deadline was a nice-to-do preparatory step.&amp;lt;ref name=&amp;quot;ref_d0b4eb33&amp;quot; /&amp;gt;&lt;br /&gt;
# Because of the continued success against SHA-1, the NSA and NIST identified its related successor, SHA-2, as the new recommended hashing standard in 2002.&amp;lt;ref name=&amp;quot;ref_d0b4eb33&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-2 is the cryptographic hashing standard that all software and hardware should be using now, at least for the next few years.&amp;lt;ref name=&amp;quot;ref_d0b4eb33&amp;quot; /&amp;gt;&lt;br /&gt;
# Definition - What does Secure Hash Algorithm 2 (SHA-2) mean?&amp;lt;ref name=&amp;quot;ref_8416073f&amp;quot;&amp;gt;[https://www.techopedia.com/definition/30571/secure-hash-algorithm-2-sha-2 What is the Secure Hash Algorithm 2 (SHA-2)?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-2 includes significant changes from its predecessor, SHA-1.&amp;lt;ref name=&amp;quot;ref_e66c6118&amp;quot;&amp;gt;[https://en.wikipedia.org/wiki/SHA-2 Wikipedia]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# and SHA-512 are novel hash functions computed with 32-bit and 64-bit words, respectively.&amp;lt;ref name=&amp;quot;ref_e66c6118&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-224 and SHA-384 are truncated versions of SHA-256 and SHA-512 respectively, computed with different initial values.&amp;lt;ref name=&amp;quot;ref_e66c6118&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-2 was first published by the National Institute of Standards and Technology (NIST) as a U.S. federal standard (FIPS).&amp;lt;ref name=&amp;quot;ref_e66c6118&amp;quot; /&amp;gt;&lt;br /&gt;
# In the “DNA initialization and preprocessing” section, we show how initialization and preprocessing operations, especially in SHA-512, are imitated in DNA computing.&amp;lt;ref name=&amp;quot;ref_153085c3&amp;quot;&amp;gt;[https://joems.springeropen.com/articles/10.1186/s42787-019-0037-6 Secure Hash Algorithm-2 formed on DNA]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# (left shift by k&amp;lt;2m bits) in SHA-2 to be \(\bar {L}^{k}(\alpha)\) in DNSHA-2.&amp;lt;ref name=&amp;quot;ref_153085c3&amp;quot; /&amp;gt;&lt;br /&gt;
# The nucleotide block i\(\bar {M}^{(i)}\) (of 512 nucleotides) in DNSHA-512 has to imitate the 1024-bit block M(i) in SHA-512.&amp;lt;ref name=&amp;quot;ref_153085c3&amp;quot; /&amp;gt;&lt;br /&gt;
# The variety of SHA-2 hashes can lead to a bit of confusion, as websites and authors express them differently.&amp;lt;ref name=&amp;quot;ref_1e0358ea&amp;quot;&amp;gt;[https://www.thesslstore.com/blog/difference-sha-1-sha-2-sha-256-hash-algorithms/ The Difference Between SHA-1, SHA-2 and SHA-256 Hash Algorithms]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# Occasionally you will see certificates using SHA-2 384-bit.&amp;lt;ref name=&amp;quot;ref_1e0358ea&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-2 will likely remain in use for at least five years.&amp;lt;ref name=&amp;quot;ref_1e0358ea&amp;quot; /&amp;gt;&lt;br /&gt;
# It involved re-issuing thousands of existing certificates so that new files could be created and signed with SHA-2.&amp;lt;ref name=&amp;quot;ref_1e0358ea&amp;quot; /&amp;gt;&lt;br /&gt;
# Currently only the four fixed-length SHA-3 algorithms are approved hash algorithms, providing alternatives to the SHA-2 family of hash functions.&amp;lt;ref name=&amp;quot;ref_91df44fc&amp;quot;&amp;gt;[https://csrc.nist.gov/projects/hash-functions Hash Functions]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# The SHA-2 family consists of multiple closely related hash functions.&amp;lt;ref name=&amp;quot;ref_1d07e97d&amp;quot;&amp;gt;[https://www.algorithmhalloffame.org/algorithms/sha-2/ SHA-2 – Algorithm Hall of Fame]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-256 generates an almost-unique 256-bit (32-byte) signature for a text.&amp;lt;ref name=&amp;quot;ref_ea252c83&amp;quot;&amp;gt;[https://www.movable-type.co.uk/scripts/sha256.html Movable Type Scripts]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-256 is one of the successor hash functions to SHA-1 (collectively referred to as SHA-2), and is one of the strongest hash functions available.&amp;lt;ref name=&amp;quot;ref_ea252c83&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-256 is not much more complex to code than SHA-1, and has not yet been compromised in any way.&amp;lt;ref name=&amp;quot;ref_ea252c83&amp;quot; /&amp;gt;&lt;br /&gt;
# and SHA-512, for computing a condensed representation of a message or a data file.&amp;lt;ref name=&amp;quot;ref_4699d01c&amp;quot;&amp;gt;[https://tools.ietf.org/html/rfc4634 US Secure Hash Algorithms (SHA and HMAC-SHA)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# &amp;lt; 2^128 bits (for SHA-384 and SHA-512) is input to one of these algorithms, the result is an output called a message digest.&amp;lt;ref name=&amp;quot;ref_4699d01c&amp;quot; /&amp;gt;&lt;br /&gt;
# The SHA-224 and SHA-256 algorithms produce 224-bit and 256-bit * message digests for a given data stream.&amp;lt;ref name=&amp;quot;ref_4699d01c&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-256 are defined in terms of 32-bit &amp;quot;words&amp;quot;.&amp;lt;ref name=&amp;quot;ref_4699d01c&amp;quot; /&amp;gt;&lt;br /&gt;
# What role does SHA-256 hashing play in cybersecurity?&amp;lt;ref name=&amp;quot;ref_79cd06b0&amp;quot;&amp;gt;[https://www.solarwindsmsp.com/blog/sha-256-encryption SHA-256 Algorithm Overview]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-256 is used in some of the most popular authentication and encryption protocols, including SSL, TLS, IPsec, SSH, and PGP.&amp;lt;ref name=&amp;quot;ref_79cd06b0&amp;quot; /&amp;gt;&lt;br /&gt;
# In Unix and Linux, SHA-256 is used for secure password hashing.&amp;lt;ref name=&amp;quot;ref_79cd06b0&amp;quot; /&amp;gt;&lt;br /&gt;
# Cryptocurrencies such as Bitcoin use SHA-256 for verifying transactions.&amp;lt;ref name=&amp;quot;ref_79cd06b0&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-2 is a family of hashing algorithms to replace the SHA-1 algorithm.&amp;lt;ref name=&amp;quot;ref_366087bf&amp;quot;&amp;gt;[https://www.entrust.com/knowledgebase/ssl/what-is-sha2 What is SHA-2?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-2 features a higher level of security than its predecessor.&amp;lt;ref name=&amp;quot;ref_366087bf&amp;quot; /&amp;gt;&lt;br /&gt;
# Entrust is introducing the SHA-256 variant of the SHA-2 family as a signing option for all certificates.&amp;lt;ref name=&amp;quot;ref_366087bf&amp;quot; /&amp;gt;&lt;br /&gt;
# One of the major benefits of using SHA-2 is that it addresses some weaknesses in the SHA-1 hashing algorithm.&amp;lt;ref name=&amp;quot;ref_366087bf&amp;quot; /&amp;gt;&lt;br /&gt;
# We use SHA-256 because this 256-bit key is much more secure than other common hashing algorithms.&amp;lt;ref name=&amp;quot;ref_fe423e59&amp;quot;&amp;gt;[https://blog.pagefreezer.com/sha-256-benefits-evidence-authentication Why You Should Use SHA-256 in Evidence Authentication]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# SHA-256 is an industry standard that is trusted by leading public-sector agencies and used widely by technology leaders.&amp;lt;ref name=&amp;quot;ref_fe423e59&amp;quot; /&amp;gt;&lt;br /&gt;
# There are 2 possible hash values when using SHA-256, which makes it nearly impossible for two different documents to coincidentally have the exact same hash value.&amp;lt;ref name=&amp;quot;ref_fe423e59&amp;quot; /&amp;gt;&lt;br /&gt;
# It’s also why we use SHA-256.&amp;lt;ref name=&amp;quot;ref_fe423e59&amp;quot; /&amp;gt;&lt;br /&gt;
# const uint8_t *message, uint32_t *intermediateDigest, uint32_t hashAlgorithm, uint32_t initialMessageLength) Start a new SHA-2 hash operation.&amp;lt;ref name=&amp;quot;ref_67132787&amp;quot;&amp;gt;[http://software-dl.ti.com/simplelink/esd/simplelink_cc13x0_sdk/2.20.00.38/exports/docs/driverlib_cc13xx_cc26xx/cc13x2_cc26x2_v1/driverlib/group__sha2__api.html CC26xx Driver Library: [sha2.h] Secure Hash Algorithm 2]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# (const uint8_t *message, uint32_t *intermediateDigest, uint32_t hashAlgorithm, uint32_t intermediateMessageLength) Resume a SHA-2 hash operation but do not finalize it.&amp;lt;ref name=&amp;quot;ref_67132787&amp;quot; /&amp;gt;&lt;br /&gt;
# , uint32_t totalMsgLength, uint32_t messageLength, uint32_t hashAlgorithm) Resume a SHA-2 hash operation and finalize it.&amp;lt;ref name=&amp;quot;ref_67132787&amp;quot; /&amp;gt;&lt;br /&gt;
# Start a SHA-2 hash operation and return the finalized digest.&amp;lt;ref name=&amp;quot;ref_67132787&amp;quot; /&amp;gt;&lt;br /&gt;
# SHA-2 is a set of secure hash functions including SHA 224, SHA 256, SHA 384, and SHA 512 developed by the NSA intended to provide a higher level of security than the SHA-1 algorithm.&amp;lt;ref name=&amp;quot;ref_d07c846f&amp;quot;&amp;gt;[https://patents.google.com/patent/US20170147340A1/en US20170147340A1 - Method and apparatus to process sha-2 secure hashing algorithm - Google Patents]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# The SHA-2 algorithm is computationally more complex the SHA 1, relying on carry propagate additions as well as logical operations and rotates.&amp;lt;ref name=&amp;quot;ref_d07c846f&amp;quot; /&amp;gt;&lt;br /&gt;
# A critical path for a round of SHA-2 operations consists of four consecutive propagate additions with adder inputs being determined by complex logical and rotation functions.&amp;lt;ref name=&amp;quot;ref_d07c846f&amp;quot; /&amp;gt;&lt;br /&gt;
# 1 depicts details of the SHA-2 algorithm.&amp;lt;ref name=&amp;quot;ref_d07c846f&amp;quot; /&amp;gt;&lt;br /&gt;
# The SHA-256 algorithm generates an almost-unique, fixed-size 256-bit (32-byte) hash.&amp;lt;ref name=&amp;quot;ref_75b489f8&amp;quot;&amp;gt;[https://www.baeldung.com/sha-256-hashing-java SHA-256 Hashing in Java]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# NIST released SHA-3 in 2015, so there are not quite as many SHA-3 libraries as SHA-2 for the time being.&amp;lt;ref name=&amp;quot;ref_75b489f8&amp;quot; /&amp;gt;&lt;br /&gt;
# SHAs come in three forms: SHA-1, SHA-2, and SHA-256. SHA-1 is the first iteration of the algorithm, followed by SHA-2, which is seen as an improved and updated version of the first.&amp;lt;ref name=&amp;quot;ref_01944115&amp;quot;&amp;gt;[https://www.sslauthority.com/the-difference-between-sha-1-sha-2-and-sha-256-hash-algorithms-2/ The Difference Between Sha-1, Sha-2, Sha-256]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# While SHA-1 is the more basic version of the hash providing a shorter code with fewer possibilities for unique combinations, SHA-2 or SHA-256 creates a longer, and thus more complex, hash.&amp;lt;ref name=&amp;quot;ref_01944115&amp;quot; /&amp;gt;&lt;br /&gt;
# By 2016, it became mandatory for SHA-2 to be used for all new certificates.&amp;lt;ref name=&amp;quot;ref_01944115&amp;quot; /&amp;gt;&lt;br /&gt;
# Since the switch to SHA-2 was only made two years ago, there are tons of websites that still communicate using the first version of the hashing algorithm.&amp;lt;ref name=&amp;quot;ref_01944115&amp;quot; /&amp;gt;&lt;br /&gt;
# While hash generated by SHA2 is strong.&amp;lt;ref name=&amp;quot;ref_cada236e&amp;quot;&amp;gt;[https://www.geeksforgeeks.org/difference-between-sha1-and-sha2/ Difference between SHA1 and SHA2]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# Tech giants including Microsoft, Google, and Mozilla are all aboard with SHA-2.&amp;lt;ref name=&amp;quot;ref_349d9d7d&amp;quot;&amp;gt;[https://cheapsslsecurity.com/blog/what-is-sha2-and-what-are-sha-2-ssl-certificates/ What is SHA2 and What Are SHA 2 SSL Certificates?]&amp;lt;/ref&amp;gt;&lt;br /&gt;
# From the image above, this site uses SHA-256, which is the most popular hash function.&amp;lt;ref name=&amp;quot;ref_349d9d7d&amp;quot; /&amp;gt;&lt;br /&gt;
# Unlike SHA-1 which was found to be susceptible to collision attacks, SHA-2 is collision-resistant.&amp;lt;ref name=&amp;quot;ref_349d9d7d&amp;quot; /&amp;gt;&lt;br /&gt;
# If you plan on installing a SHA 2 Certificate, make sure that you’re using it on a compatible server.&amp;lt;ref name=&amp;quot;ref_349d9d7d&amp;quot; /&amp;gt;&lt;br /&gt;
===소스===&lt;br /&gt;
 &amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Pythagoras0</name></author>
	</entry>
</feed>