Reliability check for passwords based on the modified Bloom filter

MaRDI QIDQ4900207zbMATH OpenFDO

Authors Dmitriĭ Nikolaevich Lavrov, E. A. Pervushin

Publication date 14 January 2013

Full work available at URL http://msm.univer.omsk.su/jrn17.html

zbMATH Keywords

allowable errorhash coding

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• An algorithm for approximate membership checking with application to password security
• Selecting Secure Passwords
• scientific article; zbMATH DE number 2044524
• A study of password security
• scientific article; zbMATH DE number 1583806

Cited in

(3)

• An algorithm for approximate membership checking with application to password security
• scientific article; zbMATH DE number 2044524 (Why is no real title available?)
• scientific article; zbMATH DE number 1753916 (Why is no real title available?)

This page was built for publication: Reliability check for passwords based on the modified Bloom filter

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