A study of password security

DOI10.1007/BF02252873MaRDI QIDQ1121243zbMATH OpenWikidataFDO

Authors Michael Luby, Charles W. Rackoff

Publication date 1989

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02252873

zbMATH Keywords

encryption schemepassword securitypseudorandom function generatorsecurity of a function generatorUNIX-like password scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1583806
• Password authentication using public-key cryptography
• Selecting Secure Passwords
• Automata, Languages and Programming
• Cryptanalysis of a password authentication scheme over insecure networks

Cites work

• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)

Cited in

(8)

• Challenge response password security using combinatorial group theory
• scientific article; zbMATH DE number 2044524 (Why is no real title available?)
• Reliability check for passwords based on the modified Bloom filter
• Comment and modification of RSA based remote password authentication using smart card
• Selecting Secure Passwords
• Automata, Languages and Programming
• The security of the cipher block chaining message authentication code
• Quantifying the security advantage of password expiration policies

This page was built for publication: A study of password security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121243)