Sept. 22, 2022, 1:20 a.m. | Jeremiah Blocki, Peiyuan Liu

cs.CR updates on arXiv.org arxiv.org

A central challenge in password security is to characterize the attacker's
guessing curve i.e., what is the probability that the attacker will crack a
random user's password within the first $G$ guesses. A key challenge is that
the guessing curve depends on the attacker's guessing strategy and the
distribution of user passwords both of which are unknown to us. In this work we
aim to follow Kerckhoffs' principle and analyze the performance of an optimal
attacker who knows the password …

analysis datasets password

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Cyber Security Cloud Solution Architect

@ Microsoft | London, London, United Kingdom

Compliance Program Analyst

@ SailPoint | United States

Software Engineer III, Infrastructure, Google Cloud Security and Privacy

@ Google | Sunnyvale, CA, USA

Cryptography Expert

@ Raiffeisen Bank Ukraine | Kyiv, Kyiv city, Ukraine

Senior Cyber Intelligence Planner (15.09)

@ OCT Consulting, LLC | Washington, District of Columbia, United States