https://arolstar52-zhtest.hf.space/index.php?action=history&feed=atom&title=Argon2
Argon2 - 版本历史
2026-07-17T07:14:34Z
在这个wiki上该页的修订历史
MediaWiki 1.43.9
https://arolstar52-zhtest.hf.space/index.php?title=Argon2&diff=4583058&oldid=prev
~2026-28654-49 来自 2026年5月29日 (五) 09:26
2026-05-29T09:26:23Z
<p></p>
<p><b>新页面</b></p><div>{{noteTA|G1=IT}}<br />
{{Infobox encryption method<br />
| name = Argon2<br />
| designers = {{cslist|{{le|亚历克斯·比留科夫|Alex Biryukov}}|丹尼尔·迪努（Daniel Dinu）|{{le|德米特里·霍夫拉托维奇|Dmitry Khovratovich}}}}<br />
| publish date = {{start date and age|2015}}<br />
| digest size = 变长<br />
| block size = 变长<br />
| rounds = 变长<br />
}}<br />
'''Argon2'''是一种[[密钥派生函数]]，是2015年{{le|密碼散列竞赛|Password Hashing Competition}}的获胜者<ref>{{Cite web |url=https://password-hashing.net/ |title="Password Hashing Competition" |access-date=2025-01-22 |archive-date=2019-04-07 |archive-url=https://web.archive.org/web/20190407233101/https://password-hashing.net/ |dead-url=no }}</ref><ref>{{cite arXiv |author=Jos Wetzels |date=2016-02-08 |title=Open Sesame: The Password Hashing Competition and Argon2 |class=cs.CR |eprint=1602.03097 }}</ref>。它由[[卢森堡大学]]的{{le|亚历克斯·比留科夫|Alex Biryukov}}、丹尼尔·迪努（Daniel Dinu）以及{{le|德米特里·霍夫拉托维奇|Dmitry Khovratovich}}设计<ref>[https://password-hashing.net/argon2-specs.pdf Argon2: the memory-hard function for password hashing and other applications] {{Wayback|url=https://password-hashing.net/argon2-specs.pdf |date=20190605002955 }}, Alex Biryukov, et al, October 1, 2015</ref>。Argon2的参考实现以[[知识共享许可协议]]CC0许可证（即[[公有领域]]）或[[Apache许可证]]2.0发布，并提供了三种相关版本：<br />
<br />
*Argon2d最大化了对GPU{{le|密碼破解|Password cracking}}攻击的抵抗力。它以密码依赖的顺序访问内存数组，这减少了[[时空权衡|时间-内存权衡]]（TMTO）攻击的可能性，但引入了可能的[[旁路攻击]]。<br />
*Argon2i优化以抵抗旁路攻击。它以密碼独立的顺序访问内存数组。<br />
*Argon2id是一个混合版本。它在内存的第一次遍历中采用Argon2i方法，随后采用Argon2d方法。{{IETF RFC|9106}}建议，如果开发者不了解这些类型之间的区别，或认为侧信道攻击是一个可行的威胁，应该使用 Argon2id<ref name=":1">{{cite web |url=https://www.rfc-editor.org/rfc/rfc9106.html |title=Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications |date=September 2021 |access-date=September 9, 2021 |last1=Biryukov |first1=Alex |last2=Dinu |first2=Daniel |last3=Khovratovich |first3=Dmitry |last4=Josefsson |first4=Simon |archive-date=2025-01-20 |archive-url=https://web.archive.org/web/20250120164322/https://www.rfc-editor.org/rfc/rfc9106.html |dead-url=no }}</ref>。<br />
<br />
这三种模式都允许通过三个参数进行配置，包括：<br />
*执行时间<br />
*所需内存<br />
*并行度<br />
<br />
== 参考文献 ==<br />
{{reflist}}<br />
<br />
== 外部链接 ==<br />
*[https://github.com/p-h-c/phc-winner-argon2 Argon2 source code repository on Github] {{Wayback|url=https://github.com/p-h-c/phc-winner-argon2 |date=20190402211036 }}<br />
*[https://www.cryptolux.org/images/0/0d/Argon2.pdf Argon2 specification] {{Wayback|url=https://www.cryptolux.org/images/0/0d/Argon2.pdf |date=20181212092235 }}<br />
*[https://password-hashing.net/ Password Hashing Competition] {{Wayback|url=https://password-hashing.net/ |date=20190407233101 }}<br />
*[https://www.cryptolux.org/index.php/Argon2 Uni.Lu Argon2 Page] {{Wayback|url=https://www.cryptolux.org/index.php/Argon2 |date=20190331160026 }}<br />
*[https://eprint.iacr.org/2016/027.pdf Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks] {{Wayback|url=https://eprint.iacr.org/2016/027.pdf |date=20181212092253 }}<br />
*{{IETF RFC|9106|link=no}} Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications<br />
<br />
{{Cryptography navbox | hash}}<br />
<br />
[[Category:密码散列函数]]<br />
[[Category:2015年计算机科学]]</div>
~2026-28654-49