Reference : Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applic...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/31652
Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications
English
Biryukov, Alex mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) > ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)]
Dinu, Dumitru-Daniel [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Khovratovich, Dmitry [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Computer Science and Communications Research Unit (CSC) >]
2016
IEEE European Symposium on Security and Privacy
292-302
Yes
International
EuroS&P IEEE European Symposium on Security and Privacy
March 21-24, 2016
Saarbr├╝cken
Germany
[en] Memory management ; Cryptography
[en] 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.
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > CryptoLUX
Researchers ; Professionals ; Students ; General public
http://hdl.handle.net/10993/31652

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
Argon2ESP.pdfAuthor postprint364.51 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.