Argon2: new generation of memory-hard functions for password hashing and other applications

被引：99

作者：

Biryukov, Alex ^{[1
]}

Dinu, Daniel ^{[1
]}

Khovratovich, Dmitry ^{[1
]}

机构：

[1] Univ Luxembourg, Luxembourg, Luxembourg

来源：

1ST IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY | 2016年

关键词：

D O I：

10.1109/EuroSP.2016.31

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present a new hash function Argon2, which is oriented at protection of low-entropy secrets without secret keys. It requires a certain (but tunable) amount of memory, imposes prohibitive time-memory and computation-memory tradeoffs on memory-saving users, and is exceptionally fast on regular PC. Overall, it can provide ASIC- and botnet-resistance by filling the memory in 0.6 cycles per byte in the non-compressible way.

引用

页码：292 / 302

页数：11

共 16 条

[1]

[Anonymous], 2011, LITECOIN OPEN SOURCE

[2]

[Anonymous], 2007, NIST SHA 3 COMPETITI

[3]

Aumasson J.-P., 2013, APPL CRYPTOGRAPHY NE, P119, DOI [DOI 10.1007/978-3-642-38980-1_8, DOI 10.1007/978-3-642-38980-18]

[4]

Bernstein DJ, 2013, LECT NOTES COMPUT SC, V8270, P321, DOI 10.1007/978-3-642-42045-0_17

[5] Tradeoff Cryptanalysis of Memory-Hard Functions [J].

Biryukov, Alex ;

Khovratovich, Dmitry .

ADVANCES IN CRYPTOLOGY - ASIACRYPT 2015, PT II, 2015, 9453 :633-657

[6]

Broz M., 2015, PHC BENCHMARKS

[7]

Forler C., 2013525 IACR CRYPT E

[8]

Forler C., 2014, 2014881 CRYPT EPRINT

[9]

Forler C, 2014, LECT NOTES COMPUT SC, V8874, P289, DOI 10.1007/978-3-662-45608-8_16

[10]

Giridhar Bharan., 2013, Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, P23

← 1 2 →