Communications - Scientific Letters of the University of Zilina 2015, 17(3):108-112 | DOI: 10.26552/com.C.2015.3.108-112

On the Optimal Pin Set Generation

Karol Grondzak1, Juraj Branicky1
1 Faculty of Management Science and Informatics, University of Zilina, Slovakia

Security of the information is one of the recent topics, attracting attention of security professionals as well as common people. With deep penetration of electronic devices into our everyday life the challenge to protect our privacy is increasing. Simple mechanism for authentication is shared secret in the form of password. In this paper we describe a method for generating a set of passwords in the form of Personal Identification Number (PIN), which can be used to provide an authentication mechanism for simple electronic devices with limited input possibilities.

Keywords: information security; PIN code generation; maximum clique; genetic algorithm

Published: August 31, 2015  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Grondzak, K., & Branicky, J. (2015). On the Optimal Pin Set Generation. Communications - Scientific Letters of the University of Zilina, 17(3), 108-112. doi: 10.26552/com.C.2015.3.108-112
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. CARRAGHAN, R., PARDALOS P. M.: An Exact Algorithm for the Maximum Clique Problem, Operations Research Letters, 9, 1990, 375-382. Go to original source...
    2. PARDALOS, P. M., RAPPE, J., RESENDE, M. G. C.: An Exact Parallel Algorithm for the Maximum Clique Problem. High Performance and Software in Nonlinear Optimization, Kluwer Academic Publishers, 1997, 279-300. Go to original source...
    3. KONC, J., JANEZIC, D.: An Improved Branch and Bound Algorithm for the Maximum Clique Problem, Commun. Math. Comput. Chem., 58, 2007, 569-590.
    4. OSTERGARD, P. R. J.: A Fast Algorithm for the Maximum Clique Problem, Discrete Applied Mathematics, 120 2002, 197-207. Go to original source...
    5. TOMITA, E., KAMEDA, T.: An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments, J. of Global Optimization, 37, 2007, 95-111 Go to original source...
    6. GENG, X., XU, J., XIAO, J., PAN L.: A Simple Simulated Annealing Algorithm for the Maximum Clique Problem, Information Sciences, 177, 2007, No. 22, 5064-5071 Go to original source...
    7. SOLNON, CH., FENET, S.: A Study of ACO Capabilities for Solving the Maximum Clique Problem, J. of Heuristics, 12, 2006, 155-180 Go to original source...
    8. MARCHIORI, E.: A Simple Heuristic Based Genetic Algorithm for the Maximum Clique Problem, Proc. of ACM Symp. Appl. Comput.: 366-373, 1998. Go to original source...
    9. KATAYAMA, K., HAMAMOTO, A., NARIHISA, H.: An Effective Local Search for the Maximum Clique Problem, Information Processing Letters, 95, 2005, 503-511 Go to original source...
    10. HASSELBERG, J., PARDALOS, P. M., VAIRAKTARAKIS, G.: Test Case Generators and Computational Results for the Maximum Clique Problem, J. Global Optim., 3, 1993, 463-482. Go to original source...

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content