View More View Less
  • 1 College of Nyíregyháza, H-4400 Nyíregyháza, Sóstói út 36, Hungary
  • 2 University of Debrecen, H-4028 Debrecen, Kassai út 26, Hungary
  • 3 Pannon Softver Ltd., 4024 Debrecen, Csapó u. 28. 1. em., Hungary
Restricted access

Purchase article

USD  $25.00

1 year subscription (Individual Only)

USD  $800.00

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

  • [1]

    Dömösi, P. and Nehaniv, C. L., Algebraic Theory of Automata Networks: An Introduction, ser. SIAM monographs on Discrete Mathematics and Applications, vol. 11, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2005, doi 10.1137/1.9780898718492.

    • Search Google Scholar
    • Export Citation
  • [2]

    Gécseg, F., Products of Automata, ser. EATCS Monographs on Theoretical Computer Science, vol. 7, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1986, doi 10.1007/978-3-642-61611-2.

    • Search Google Scholar
    • Export Citation
  • [3]

    Gécseg, F. and Peák, I., Algebraic Theory of Automata, Ser. Disquisitiones Mathematicae Hungaricae, vol. 2, Akadémia Kiadó, Budapest, 1972.

    • Search Google Scholar
    • Export Citation
  • [4]

    Hopcroft, J. E., Motwani, R. and Ullman, J. D., Introduction to Automata Theory, Languages and Computation, second edition, Addison-Wesley seriesin computer science, Addison-Wesley, 2001.

    • Search Google Scholar
    • Export Citation
  • [5]

    Menezes, A. J., Oorschot, P. C. and Vanstone, S. A., Handbook of Applied Cryptography, ser. Discrete Mathematics and Its Applications, CRC Press, 1996, doi 10.1201/9781439821916.

    • Search Google Scholar
    • Export Citation
  • [6]

    Tao, R., Finite Automata and Application to Cryptography, Springer-Verlag, Berlin, 2009, doi. 10.1007/978-3-540-78257-5.

The author instruction is available in PDF.

Please, download the file from HERE

Manuscript submission: HERE


  • Impact Factor (2019): 0.486
  • Scimago Journal Rank (2019): 0.234
  • SJR Hirsch-Index (2019): 23
  • SJR Quartile Score (2019): Q3 Mathematics (miscellaneous)
  • Impact Factor (2018): 0.309
  • Scimago Journal Rank (2018): 0.253
  • SJR Hirsch-Index (2018): 21
  • SJR Quartile Score (2018): Q3 Mathematics (miscellaneous)

Language: English, French, German

Founded in 1966
Publication: One volume of four issues annually
Publication Programme: 2020. Vol. 57.
Indexing and Abstracting Services:

  • CompuMath Citation Index
  • Mathematical Reviews
  • Referativnyi Zhurnal/li>
  • Research Alert
  • Science Citation Index Expanded (SciSearch)/li>
  • The ISI Alerting Services


Subscribers can access the electronic version of every printed article.

Senior editors

Editor(s)-in-Chief: Pálfy Péter Pál

Managing Editor(s): Sági, Gábor

Editorial Board

  • Biró, András (Number theory)
  • Csáki, Endre (Probability theory and stochastic processes, Statistics)
  • Domokos, Mátyás (Algebra (Ring theory, Invariant theory))
  • Győri, Ervin (Graph and hypergraph theory, Extremal combinatorics, Designs and configurations)
  • O. H. Katona, Gyula (Combinatorics)
  • Márki, László (Algebra (Semigroup theory, Category theory, Ring theory))
  • Némethi, András (Algebraic geometry, Analytic spaces, Analysis on manifolds)
  • Pach, János (Combinatorics, Discrete and computational geometry)
  • Rásonyi, Miklós (Probability theory and stochastic processes, Financial mathematics)
  • Révész, Szilárd Gy. (Analysis (Approximation theory, Potential theory, Harmonic analysis, Functional analysis))
  • Ruzsa, Imre Z. (Number theory)
  • Soukup, Lajos (General topology, Set theory, Model theory, Algebraic logic, Measure and integration)
  • Stipsicz, András (Low dimensional topology and knot theory, Manifolds and cell complexes, Differential topology)
  • Szász, Domokos (Dynamical systems and ergodic theory, Mechanics of particles and systems)
  • Tóth, Géza (Combinatorial geometry)

Gábor Sági
Address: P.O. Box 127, H–1364 Budapest, Hungary
Phone: (36 1) 483 8344 ---- Fax: (36 1) 483 8333