Guessing bank PINs by winning a mastermind game
From MaRDI portal
Publication:692940
DOI10.1007/S00224-011-9340-9zbMATH Open1254.68116DBLPjournals/mst/FocardiL12OpenAlexW2013533834WikidataQ57832068 ScholiaQ57832068MaRDI QIDQ692940FDOQ692940
Authors: Riccardo Focardi, Flaminia L. Luccio 
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9340-9
Recommendations
Data encryption (aspects in computer science) (68P25) Applications of game theory (91A80) Cryptography (94A60)
Cites Work
- Mastermind
- On the security of PKCS \#11.
- Efficient solutions for mastermind using genetic algorithms
- Title not available (Why is that?)
- Extending security protocol analysis: new challenges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Guessing bank PINs by winning a mastermind game
- Formal analysis of PIN block attacks
- The number of pessimistic guesses in Generalized Mastermind
Cited In (7)
- Guessing bank PINs by winning a mastermind game
- An introduction to security API analysis
- Bounds for the static permutation mastermind game
- Optimal strategies for the static black-peg AB game with two and three pegs
- The worst case number of questions in generalized AB game with and without white-peg answers
- The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)
- An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs
This page was built for publication: Guessing bank PINs by winning a mastermind game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692940)
