Guessing bank PINs by winning a mastermind game

DOI10.1007/s00224-011-9340-9zbMath1254.68116DBLPjournals/mst/FocardiL12OpenAlexW2013533834WikidataQ57832068 ScholiaQ57832068MaRDI QIDQ692940

Flaminia L. Luccio, Riccardo Focardi

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

zbMATH Keywords

security APIsmastermindhardware security modulesPIN processing

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ Bounds for the static permutation mastermind game ⋮ Guessing bank PINs by winning a mastermind game ⋮ The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) ⋮ An Introduction to Security API Analysis ⋮ The worst case number of questions in generalized AB game with and without white-peg answers

Cites Work

• Guessing bank PINs by winning a mastermind game
• Mastermind
• Formal analysis of PIN block attacks
• The number of pessimistic guesses in Generalized Mastermind
• Efficient solutions for mastermind using genetic algorithms
• On the Security of PKCS #11
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guessing bank PINs by winning a mastermind game