Skip to main content
Conference ProceedingsOPEN ACCESS

Proofs of security for the unix password hashing algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1976 560-572
DOI: 10.1007/3-540-44448-3_43
12Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

We give the first proof of security for the full Unix password hashing algorithm (rather than of a simplified variant). Our results show that it is very good at extracting almost all of the available strength from the underlying cryptographic primitive and provide good reason for confidence in the Unix construction.

Cite

CITATION STYLE

APA

Wagner, D., & Goldberg, I. (2000). Proofs of security for the unix password hashing algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1976, pp. 560–572). Springer Verlag. https://doi.org/10.1007/3-540-44448-3_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free