Cracking Bank PINs by Playing Mastermind
暂无分享,去创建一个
[1] Graham Steel. Formal analysis of PIN block attacks , 2006, Theor. Comput. Sci..
[2] Joseph Bonneau,et al. What's in a Name? , 2020, Financial Cryptography.
[3] Peng Ning,et al. Computer Security - ESORICS 2009, 14th European Symposium on Research in Computer Security, Saint-Malo, France, September 21-23, 2009. Proceedings , 2009, ESORICS.
[4] Piotr Zielinski,et al. Decimalisation table attacks for PIN cracking , 2003 .
[5] Tom Kalisker,et al. Solving Mastermind Using Genetic Algorithms , 2003, GECCO.
[6] Julian F. Miller,et al. Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.
[7] Gerold Jäger,et al. The number of pessimistic guesses in Generalized Mastermind , 2009, Inf. Process. Lett..
[8] Graham Steel,et al. Blunting Differential Attacks on PIN Processing APIs , 2009, NordSec.
[9] K. Koyama,et al. An Optimal Mastermind Strategy , 1993 .
[10] D. Knuth. The Computer as Master Mind , 1977 .
[11] Wayne Goddard,et al. Mastermind Revisited , 2004 .
[12] Guo-Qiang Zhang,et al. Mastermind is NP-Complete , 2005, ArXiv.
[13] Vasek Chvátal,et al. Mastermind , 1983, Comb..
[14] Agostinho C. Rosa,et al. Mastermind by evolutionary algorithms , 1999, SAC '99.
[15] Donald E. Knuth,et al. The Stanford GraphBase - a platform for combinatorial computing , 1993 .
[16] Zhixiang Chen,et al. Finding a Hidden Code by Asking Questions , 1996, COCOON.
[17] Omer Berkman,et al. The Unbearable Lightness of PIN Cracking , 2007, Financial Cryptography.
[18] Graham Steel,et al. Type-Based Analysis of PIN Processing APIs , 2009, ESORICS.