Guessing bank PINs by winning a mastermind game
From MaRDI portal
Publication:692940
Recommendations
Cites work
- scientific article; zbMATH DE number 3559318 (Why is no real title available?)
- scientific article; zbMATH DE number 599564 (Why is no real title available?)
- scientific article; zbMATH DE number 2040686 (Why is no real title available?)
- scientific article; zbMATH DE number 2148779 (Why is no real title available?)
- Efficient solutions for mastermind using genetic algorithms
- Extending security protocol analysis: new challenges
- Formal analysis of PIN block attacks
- Guessing bank PINs by winning a mastermind game
- Mastermind
- On the security of PKCS \#11.
- The number of pessimistic guesses in Generalized Mastermind
Cited in
(7)- Bounds for the static permutation mastermind game
- An introduction to security API analysis
- An optimal strategy for static black-peg Mastermind with two pegs
- Optimal strategies for the static black-peg AB game with two and three pegs
- Guessing bank PINs by winning a mastermind game
- 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 \)
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)
